Data Block Transfer Device Using Dual Pointer Segmentation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Transferring large amounts of historical data from field devices, such as wind turbines, to server devices within a predetermined period is challenging due to data congestion and the need to avoid device overload, leading to inefficiencies in data transfer and potential fragmentation of databases.
Innovation Solution
A method involving the use of first and second pointers to delimit a completed time period, where data blocks are transferred chronologically after the second pointer and anti-chronologically before the first pointer, ensuring that newer data is prioritized and reducing database fragmentation by structuring the transfer process.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If data blocks are transferred in chronological order only, then data transfer is simple to implement, but newer data may be delayed and database fragmentation increases
Solution Approach 1:
The transfer device dynamically adjusts the transfer order based on the age of data blocks. It uses a dual-mode approach: chronological order for newer data blocks (after second pointer) and anti-chronological order for older data blocks (before first pointer). This dynamic adaptation optimizes transfer efficiency while prioritizing newer data without requiring complete reordering flexibility.
Solution Approach 2:
The data transfer process is segmented into two distinct phases based on the pointers: (1) transferring data blocks after the second pointer in chronological order, and (2) transferring data blocks before the first pointer in anti-chronological order. This segmentation allows different transfer strategies to be applied to different portions of the data set, resolving the contradiction between simplicity and timeliness.
2Productivity
If all data blocks are transferred within a predetermined period, then transfer efficiency is improved, but data congestion and device overload occur
Solution Approach 1:
The transfer device implements periodic action by using a predetermined transfer period that resets after completion. Data blocks are transferred in structured phases within each period: first chronological transfer after the second pointer, then anti-chronological transfer before the first pointer. This periodic structured approach maintains high efficiency while preventing continuous overload through natural period boundaries.
Solution Approach 2:
The transfer device performs preliminary action by setting the first and second pointers before the transfer period begins. This preliminary setup defines the scope of data to be transferred and establishes the transfer boundaries in advance, allowing the system to prepare for efficient bulk transfer while maintaining reliability through pre-planned transfer limits.
3Reliability
If data transfer is limited to a predetermined transfer period, then device overload is prevented, but transferring large amounts of data becomes difficult
Solution Approach 1:
The system dynamically adapts to large data volumes by adjusting the pointer positions and transfer phases within the predetermined period. When large amounts of data need transfer, the dual-pointer mechanism allows flexible segmentation into chronological and anti-chronological phases, maximizing the utilization of the transfer period while maintaining reliability through structured phase completion.
Solution Approach 2:
Large data transfer is segmented into two manageable phases: chronological transfer for recent data and anti-chronological transfer for older data. This segmentation makes large volume transfer feasible within the predetermined period by breaking it into structured, controllable steps that prevent overload while maintaining overall productivity.
4Speed
If data blocks are transferred without a structured order, then transfer speed is maximized, but database fragmentation increases
Solution Approach 1:
The transfer device dynamically maintains database stability through structured ordering. It applies chronological order for newer data blocks and anti-chronological order for older data blocks, ensuring that data is transferred in a sequence that minimizes fragmentation. This dynamic ordering approach preserves database composition stability while maintaining high transfer speeds through efficient phase-based processing.
Solution Approach 2:
The structured order is established as a preliminary action through the pointer configuration before transfer begins. By pre-defining the chronological and anti-chronological sequences, the system ensures that data blocks are transferred in an order that prevents fragmentation, while the phase-based execution maintains high transfer speed through organized batch processing.
Data Source
AI summary
A method for transferring data blocks from a field device to a server, each data block including data describing an operation of the field device during a block time period is provided. The method includes setting a first and a second pointer delimiting a completed time period; and, until a predetermined transfer period elapses: transferring the data blocks having a block time period that is later than the second pointer to the server in a chronological order; and if all data blocks having a block time period that is later than the second pointer have been transferred to the server, transferring the data blocks having a block time period that is earlier than the first pointer to the server in an anti-chronological order. Data blocks can efficiently and reliably be transferred to the server.