CN107329807A - Data delay treating method and apparatus, computer-readable recording medium - Google Patents
Data delay treating method and apparatus, computer-readable recording medium Download PDFInfo
- Publication number
- CN107329807A CN107329807A CN201710510902.3A CN201710510902A CN107329807A CN 107329807 A CN107329807 A CN 107329807A CN 201710510902 A CN201710510902 A CN 201710510902A CN 107329807 A CN107329807 A CN 107329807A
- Authority
- CN
- China
- Prior art keywords
- node
- task
- pointed
- pointer
- read
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/466—Transaction processing
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
- G06F11/0703—Error or fault processing not based on redundancy, i.e. by taking additional measures to deal with the error or fault not making use of redundancy in operation, in hardware, or in data representation
- G06F11/0706—Error or fault processing not based on redundancy, i.e. by taking additional measures to deal with the error or fault not making use of redundancy in operation, in hardware, or in data representation the processing taking place on a specific hardware platform or in a specific software environment
- G06F11/0727—Error or fault processing not based on redundancy, i.e. by taking additional measures to deal with the error or fault not making use of redundancy in operation, in hardware, or in data representation the processing taking place on a specific hardware platform or in a specific software environment in a storage system, e.g. in a DASD or network based storage system
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
- G06F11/0703—Error or fault processing not based on redundancy, i.e. by taking additional measures to deal with the error or fault not making use of redundancy in operation, in hardware, or in data representation
- G06F11/0751—Error or fault detection not based on redundancy
- G06F11/0754—Error or fault detection not based on redundancy by exceeding limits
- G06F11/0757—Error or fault detection not based on redundancy by exceeding limits by exceeding a time limit, i.e. time-out, e.g. watchdogs
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Quality & Reliability (AREA)
- Software Systems (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a kind of data delay treating method and apparatus, it is related to technical field of data processing.This method includes：I) set up and include N1The circular linked list of individual node, N1Interval T is handled according to tasksWith task delay duration TdTo determine, N1For the integer more than 1；Ii read pointer and write pointer, a upper node for the node that the node that write pointer is pointed to points to for read pointer) are set for circular linked list；Iii) received task is write in the node that write pointer is pointed to, the task in the node that read pointer is pointed to and execution is read；Iv write pointer and read pointer) are moved to next node；V) repeat step iii) and iv), until having handled all tasks.This method and device can improve the efficiency of data processing.
Description
Technical field
The present invention relates to technical field of data processing, more particularly to a kind of data delay treating method and apparatus, computer
Readable storage medium storing program for executing.
Background technology
In data processing field, the situation for needing that delay disposal is carried out to task is frequently run onto.For example, in ecommerce
In, need to wait some minutes after the order for receiving user, if same user has assigned other orders in this period,
These orders can be merged and sent with charge free, so as to reduce the waste of resource.
, it is necessary to record initiation time and the status information of each task in the technical scheme of prior art, set simultaneously
The initiation time of task and current time, are just compared by timer every fixed duration, and execution meets delay duration
Task.
The content of the invention
The inventors found that above-mentioned, there are the following problems in the prior art：When performing task every time, all need
The initiation time of all tasks is compared with current time, causes data-handling efficiency low.In regarding to the issue above
At least one problem, present inventors have proposed solution.
It is an object of the present invention to provide a kind of data delay treatment technology scheme.
According to one embodiment of present invention there is provided a kind of data delay processing method, including：I) set up and include N1It is individual
The circular linked list of node, N1Interval T is handled according to tasksWith task delay duration TdTo determine, N1For the integer more than 1；ii)
For the circular linked list, read pointer and write pointer are set, the node that the node that the write pointer is pointed to points to for the read pointer
A upper node；Iii) received task is write in the node that the write pointer is pointed to, reads what the read pointer was pointed to
Task and execution in node；Iv the write pointer and the read pointer) are moved to next node；V) repeat step
Iii) and iv), until having handled all tasks.
Alternatively,
Alternatively, it is that the task received sets flag according to task promoter；Record the task, the mark
The corresponding relation of site position where knowing position and the task；Judge whether appointing in the node pointed to the read pointer
Task of the business with like-identified position, if so, then performing the task merging with like-identified position.
Alternatively, needing TdExtend Δ T1In the case of, node and the next node pointed in the write pointer it
Between insert N2Individual node, N2According to TsWith Δ T1It is determined that, N2For positive integer；The write pointer is moved to next node direction
It is dynamic, the node of the insertion is pointed to successively, while task is respectively written into the node that the write pointer is pointed to according to reception order,
The read pointer is rested at the node currently pointed to until Δ T1Terminate.
Alternatively,
Alternatively, needing TdShorten Δ T2In the case of, the read pointer is moved to next node direction, read
The N for taking the read pointer to point to successively3After task and execution in individual node, N is deleted3The individual node, N3According to TsWith Δ T2
It is determined that；The write pointer is rested at the node currently pointed to until deletion action terminates.
Alternatively,
According to another embodiment of the invention there is provided a kind of data delay processing unit, including：Memory, for depositing
The pending task of storage, the storage organization of the memory is to include N1The circular linked list of individual node, N1Handled and be spaced according to task
TsWith task delay duration TdTo determine, N1For the integer more than 1；Processor, for into the memory write task and
Task is read from the memory and is performed, including performs following steps：I) read pointer is set for the circular linked list and write
Pointer, a upper node for the node that the node that the write pointer is pointed to points to for the read pointer；Ii) by received task
Write in the node that the write pointer is pointed to, read the task in the node that the read pointer is pointed to and execution；Iii) will be described
Write pointer and the read pointer are moved to next node；Iv) repeat step ii) and iii), until having handled all tasks.
Alternatively, the step ii of computing device) include according to task promoter being that the task received sets mark
Know position；Record the corresponding relation of the task, the flag and site position where the task；Judge whether and institute
Stating the task in the node of read pointer sensing has the task of like-identified position, if so, then by appointing with like-identified position
Business, which merges, to be performed.
Alternatively, needing TdExtend Δ T1In the case of, the memory is in the node that the write pointer is pointed to under
N is inserted between one node2Individual node, N2According to TsWith Δ T1It is determined that, N2For positive integer；The processor by the write pointer to
Next node direction movement, points to the node of the insertion, while being respectively written into task according to reception order successively
The node that the write pointer is pointed to, the read pointer is rested at the node currently pointed to until Δ T1Terminate.
Alternatively, needing TdShorten Δ T2In the case of, the processor is by the read pointer to next node side
To movement, the N that the read pointer is pointed to successively is read3Task and execution in individual node, N3According to TsWith Δ T2It is determined that, institute
State the N after memory deletion is performed3Before individual node, the write pointer is rested at the node currently pointed to.
According to still another embodiment of the invention there is provided a kind of data delay processing unit, including：Memory and coupling
To the processor of the memory, processor is configured as, based on the instruction being stored in storage arrangement, performing any of the above-described
Data delay processing method in individual embodiment.
According to still a further embodiment there is provided a kind of computer-readable recording medium, computer is stored thereon with
Program, the program realizes the data delay processing method in any of the above-described embodiment when being executed by processor.
According to still another embodiment of the invention there is provided a kind of data delay processing unit, including for performing above-mentioned
The module of data delay processing method described in one embodiment.
An advantage of the present invention is that setting up circular linked list according to time delay stores pending task, and it will write
Pointer is arranged on read pointer at a node, and time and current time are initiated without contrasting task, you can exactly according to prolonging
The slow time performs task, so as to improve the efficiency of data processing.
Brief description of the drawings
The accompanying drawing for constituting a part for specification describes embodiments of the invention, and is used to solve together with the description
Release the principle of the present invention.
Referring to the drawings, according to following detailed description, the present invention can be more clearly understood from, wherein：
Fig. 1 shows the flow chart of one embodiment of the data delay processing method of the present invention.
Fig. 2 shows the schematic diagram of one embodiment of the data delay processing method of the present invention.
Fig. 3 shows the schematic diagram of another embodiment of the data delay processing method of the present invention.
Fig. 4 shows the schematic diagram of another embodiment of the data delay processing method of the present invention.
Fig. 5 shows the flow chart of another embodiment of the data delay processing method of the present invention.
Fig. 6 shows the structure chart of one embodiment of the data delay processing unit of the present invention.
Fig. 7 shows the structure chart of another embodiment of the data delay processing unit of the present invention.
Embodiment
The various exemplary embodiments of the present invention are described in detail now with reference to accompanying drawing.It should be noted that：Unless had in addition
Body illustrates that the part and the positioned opposite of step, numerical expression and numerical value otherwise illustrated in these embodiments does not limit this
The scope of invention.
Simultaneously, it should be appreciated that for the ease of description, the size of the various pieces shown in accompanying drawing is not according to reality
Proportionate relationship draw.
The description only actually at least one exemplary embodiment is illustrative below, never as to the present invention
And its any limitation applied or used.
It may be not discussed in detail for technology, method and apparatus known to person of ordinary skill in the relevant, but suitable
In the case of, the technology, method and apparatus should be considered as authorizing a part for specification.
In shown here and discussion all examples, any occurrence should be construed as merely exemplary, without
It is as limitation.Therefore, the other examples of exemplary embodiment can have different values.
It should be noted that：Similar label and letter represents similar terms in following accompanying drawing, therefore, once a certain Xiang Yi
It is defined, then it need not be further discussed in subsequent accompanying drawing in individual accompanying drawing.
Fig. 1 shows the flow chart of one embodiment of the data delay processing method of the present invention.
As shown in figure 1, in step 110, setting up and including N1The circular linked list of individual node, N1Interval T is handled according to tasks
With task delay duration TdTo determine, N1For the integer more than 1.Node sum could be arranged toFor example need
By task delay perform 20 minutes, task processing at intervals of 2 minutes, then can set circular linked list node sum be 10
It is individual.
In the step 120, it is that circular linked list sets read pointer and write pointer, the node that write pointer is pointed to points to for read pointer
Node a upper node.
In one embodiment it would be required that task is performed again after postponing 10 minutes, task processing can be with intervals of 1 minute, then
Circular linked list as shown in Figure 2 is set up as task pool.In fig. 2, circular linked list has 10 nodes, the initial finger of read pointer
It is node 1 to node, the initial sensing node of write pointer is node 10.
In step 130, received task is write in the node that write pointer is pointed to, reads the node that read pointer is pointed to
In task and execution.
In step 140, write pointer and read pointer are moved to next node.
In step 150, judge whether the complete all tasks of executed.If it is, no longer writing and reading task (step
160)；Step 130 is performed if it is not, then returning.
In one embodiment, as shown in Fig. 2 first, write pointer received task will be write in node 10 first, be read
Pointer reads being stored in node 1 for task, now not yet writes task in node 1, therefore do not perform task；Then, write pointer
Next node 1 is pointed to, and received task is write into node 1, read pointer points to next node 2, now in node 2
Task is not yet write, therefore does not perform task；So go on, when write pointer points to node 9, received task is write
Enter node 9, now read pointer points to node 10, task and the execution of node 10 are write before reading.Now in node 10
The task write time be just 10 minutes, meet task delay perform requirement, then read pointer and write pointer continue to
Next node moves and repeats said process, until the processing of all tasks is completed.
In another embodiment, needing TdExtend Δ T1In the case of, write pointer point to node with it is next
N is inserted between node2Individual node, N2According to TsWith Δ T1It is determined that, N2For positive integer.Increased nodal point number can be metExtension 10 minutes are for example needed, task processing can then increase by 5 nodes at intervals of 2 minutes；It will write
Pointer is moved to next node direction, and the node of insertion is pointed to successively, is write while being respectively written into task according to reception order
The node that pointer is pointed to, read pointer is rested at the node currently pointed to until Δ T1Terminate.
For example, needing to postpone to perform for 10 minutes by task originally, now it is changed to delay and performs for 20 minutes, task execution interval is
1 minute, then 10 new nodes can be inserted in original circular list.As shown in figure 3, the node that write pointer is currently pointed to
For node 1, the node that read pointer is pointed to is node 2, first, and 10 new nodes are inserted between node 1 and node 2：Node
101-110；Then, write pointer is moved to node 101, and received task is write into node 101；Write pointer is continued to move to,
Until received task to be write to node 101-110 successively, read pointer always points to node 2 in this period；Work as read pointer
When pointing to node 110, read pointer reads the task in node 2 and execution, and now the write time of task is just in node 2
It is 20 minutes, meets defined task time delay；Then, the node movement separately down of write pointer and read pointer, goes forward side by side
Row read-write operation is handled until all task completions.
In yet another embodiment, needing TdShorten Δ T2In the case of, read pointer is moved to next node direction
It is dynamic, read the N that read pointer is pointed to successively3After task and execution in individual node, N is deleted3Individual node, N3According to TsWith Δ T2Really
It is fixed；Write pointer is rested at the node currently pointed to until deletion action terminates.The nodal point number of deletion could be arranged toSuch as task time delay is needed to shorten 4 minutes, and 2 knots are deleted in task processing at intervals of 2 minutes, then
Point.
For example, needing to postpone to perform for 10 minutes by task originally, now it is changed to delay and performs for 7 minutes, task execution interval is 1
Minute, then circular linked list can be deleted 3 nodes.As shown in figure 4, write pointer points to node 1, read pointer points to node 2；It is first
First, read pointer reads the task in node 2,3 and 4 and execution, and write pointer then rests on node 1 always；Then read pointer is moved
To node 5, node 2,3 and 4 is deleted；Perform node 5 in task, now in node 5 task write time, just prolong
Late 7 minutes.
In above-described embodiment, circular linked list is set up as task pool according to task time delay, write pointer is arranged at reading
On pointer at a node, read process is carried out to the task in circular linked list respectively.Control task exactly can be realized
Performed according to time delay, without expending substantial amounts of resource comparison current time and task execution time, so as to improve number
The accuracy postponed according to treatment effeciency and task.And the nodal point number of circular linked list can become according to the change of time delay
Change, improve the flexibility of data processing.
Fig. 5 shows the flow chart of another embodiment of the data delay processing method of the present invention.
As shown in figure 5, the step 130 in upper one embodiment comprises the following steps：
It is that received task sets flag according to task promoter in step 1301.For example, as shown in Fig. 2 writing
Pointer receives two tasks A and B when pointing to node 10, is set the flag of the two tasks respectively according to task promoter
For α and β.Write pointer is with { key：α, value：A } and { key：β, value：B } data structure two tasks are stored in node
10；Write pointer receives task C when pointing to node 1, and the flag of this task is set into α according to task promoter,
And with { key：α, value：C } data structure storage in node 1.
In step 1302, the corresponding relation of logger task, flag and site position where task.
For example, while task is write into circular linked list, can be on the memory beyond circular linked list with such as
{key：α, value：(A, 10), (C, 1) } and
{key：β, value：(B, 10) } data structure records task, flag and place node between correspondence pass
System, and according to the flag more new record of newly writing for task.
In step 1303, the task in the node pointed to read pointer that judges whether has appointing for like-identified position
Business.If it is, the task merging with like-identified position is performed into (step 1304)；Refer to if it is not, then only performing read pointer
To node in task (step 1305).
For example, when read pointer points to node 10, reading the task A and its flag α stored in node 10.In memory
Record in find flag also be α task C, by task A and C merge perform.
It is that task sets flag bit according to task promoter when writing task to circular linked list in above-described embodiment；
When reading task from circular linked list, the task merging searched with flag is performed.It can realize promoter's identical task is same
Shi Zhihang, so as to avoid the repeat consumption of resource, reduces cost and improves the efficiency of tasks carrying.
Fig. 6 shows the structure chart of one embodiment of the data delay processing unit of the present invention.
As shown in fig. 6, the device includes memory 61 and processor 62.
Memory 61 is used to store pending task.For example, the initial storage structure of memory is to include N1Individual node
Circular linked list, N1Interval T is handled according to tasksWith task delay duration TdTo determine, N1For the integer more than 1.
Processor 62 is used to write task into memory and read from memory task and to perform, including perform with
Lower step：I) read pointer and write pointer are set for circular linked list, the node that write pointer is pointed to is upper for the node of read pointer sensing
One node；Ii) received task is write in the node that write pointer is pointed to, the task in the node that read pointer is pointed to is read
And perform；Iii write pointer and read pointer) are moved to next node；Iv) repeat step ii) and iii), until having handled
All tasks.
In one embodiment, the step ii of computing device) include：According to task, promoter sets for received task
Put flag；The corresponding relation of logger task, flag and site position where task；Judge whether to point to read pointer
Node in task have like-identified position task, if so, then by with like-identified position task merging perform.Example
Such as, in e-commerce field, the device can be realized automatically wouldn't send with charge free after the order of user is received, but first wait 10
Minute；If the user has assigned other orders for needing to send with charge free in 10 minutes, these orders are merged into one piece of group
Send.
In another embodiment, needing TdExtend Δ T1In the case of, the node that memory 61 is pointed in write pointer
N is inserted between next node2Individual node, N2According to TsWith Δ T1It is determined that, N2For positive integer；Processor is by write pointer to next
Individual node direction movement, points to the node of insertion successively, while task is respectively written into write pointer sensing according to reception order
Node, read pointer is rested at the node currently pointed to until Δ T1Terminate.
In yet another embodiment, needing TdShorten Δ T2In the case of, processor 62 is by read pointer to next knot
The movement of point direction, reads the N that read pointer is pointed to successively3After task and execution in individual node, memory deletes N3Individual node, N3
According to TsWith Δ T2It is determined that, processor rests on write pointer at the node currently pointed to until deletion action terminates.For example, appointing
Business time delay shorten to 5 minutes by 10 minutes, then processor 62 will not only perform the task of 10 minutes of having been waiting for, and also
The having been waiting for more than 5 minutes of the task is disposably finished.
In above-described embodiment, determine the node number of circular linked list in memory according to task time delay, and to
The task of like-identified position merges processing just, and the accurate control of task execution time can be realized automatically, it is to avoid expend big
Measure resource to handle incoherent task, improve the efficiency of data processing；And during the change of task time delay, it is only necessary to increase
Or the node number of circular linked list in memory is reduced, improve the flexibility of data processing.
Fig. 7 shows the structure chart of another embodiment of the data delay processing unit of the present invention.
As shown in fig. 7, the device 70 of the embodiment includes：Memory 71 and the processor for being coupled to the memory 71
72, processor 72 is configured as based on the instruction being stored in memory 71, is performed in the present invention in any one embodiment
Data delay processing method.
Wherein, memory 71 is such as can include system storage, fixed non-volatile memory medium.System storage
Such as the operating system that is stored with, application program, Boot loader (Boot Loader), database and other programs.
Those skilled in the art should be understood that embodiments of the invention can be provided as method, system or computer journey
Sequence product.Therefore, in terms of the present invention can be using complete hardware embodiment, complete software embodiment or combination software and hardware
The form of embodiment.Moreover, the present invention can be used in one or more calculating for wherein including computer usable program code
Machine can use the meter implemented on non-transient storage medium (including but is not limited to magnetic disk storage, CD-ROM, optical memory etc.)
The form of calculation machine program product.
So far, it is described in detail according to data delay treating method and apparatus of the invention, computer-readable storage
Medium.In order to avoid the design of the masking present invention, some details known in the field are not described.Those skilled in the art's root
According to above description, completely it can be appreciated how implementing technical scheme disclosed herein.
The method and system of the present invention may be achieved in many ways.For example, can by software, hardware, firmware or
Software, hardware, firmware any combinations come realize the present invention method and system.The said sequence of the step of for methods described
Order described in detail above is not limited to merely to illustrate, the step of method of the invention, it is special unless otherwise
Do not mentionlet alone bright.In addition, in certain embodiments, the present invention can be also embodied as recording to program in the recording medium, these programs
Including the machine readable instructions for realizing the method according to the invention.Thus, the present invention also covering storage is used to perform basis
The recording medium of the program of the method for the present invention.
Although some specific embodiments of the present invention are described in detail by example, the skill of this area
Art personnel are it should be understood that above example is merely to illustrate, the scope being not intended to be limiting of the invention.The skill of this area
Art personnel to above example it should be understood that can modify without departing from the scope and spirit of the present invention.This hair
Bright scope is defined by the following claims.
Claims (14)
1. a kind of data delay processing method, including：
I) set up and include N1The circular linked list of individual node, N1Interval T is handled according to tasksWith task delay duration TdTo determine, N1
For the integer more than 1；
Ii read pointer and write pointer) are set for the circular linked list, the node that the write pointer is pointed to points to for the read pointer
Node a upper node；
Iii) received task is write in the node that the write pointer is pointed to, read in the node that the read pointer is pointed to
Task is simultaneously performed；
Iv the write pointer and the read pointer) are moved to next node；
V) repeat step iii) and iv), until having handled all tasks.
2. data delay processing method according to claim 1, wherein,
3. data delay processing method according to claim 1, wherein, step iii) include：
It is that the task received sets flag according to task promoter；
Record the corresponding relation of the task, the flag and site position where the task；
Judge whether that the task in the node pointed to the read pointer has the task of like-identified position, if so, then
Task merging with like-identified position is performed.
4. the data delay processing method according to claim any one of 1-3, in addition to：
Needing TdExtend Δ T1In the case of, insert N between the node and next node that the write pointer is pointed to2It is individual
Node, N2According to TsWith Δ T1It is determined that, N2For positive integer；
The write pointer is moved to next node direction, the node of the insertion is pointed to successively, while according to reception
Task is respectively written into the node that the write pointer is pointed to by order, by the read pointer rest at the node currently pointed to until
ΔT1Terminate.
5. data delay processing method according to claim 4, wherein,
6. the data delay processing method according to claim any one of 1-3, in addition to：
Needing TdShorten Δ T2In the case of, the read pointer is moved to next node direction, the read pointer is read
The N pointed to successively3After task and execution in individual node, N is deleted3The individual node, N3According to TsWith Δ T2It is determined that；
The write pointer is rested at the node currently pointed to until deletion action terminates.
7. data delay processing method according to claim 6, wherein,
8. a kind of data delay processing unit, including：
Memory, the pending task for storing, the storage organization of the memory is to include N1The circular linked list of individual node,
N1Interval T is handled according to tasksWith task delay duration TdTo determine, N1For the integer more than 1；
Processor, task is read for the write-in task into the memory and from the memory and is performed, including is held
Row following steps：
I) read pointer and write pointer are set for the circular linked list, the node that the write pointer is pointed to points to for the read pointer
A upper node for node；
Ii) received task is write in the node that the write pointer is pointed to, read in the node that the read pointer is pointed to
Task is simultaneously performed；
Iii the write pointer and the read pointer) are moved to next node；
Iv) repeat step ii) and iii), until having handled all tasks.
9. data delay processing unit according to claim 8, wherein, the step ii of the computing device) include：
It is that the task received sets flag according to task promoter；
Record the corresponding relation of the task, the flag and site position where the task；
Judge whether that the task in the node pointed to the read pointer has the task of like-identified position, if so, then
Task merging with like-identified position is performed.
10. data delay processing unit according to claim 8 or claim 9, wherein,
Needing TdExtend Δ T1In the case of, the node that the memory is pointed in the write pointer and next node it
Between insert N2Individual node, N2According to TsWith Δ T1It is determined that, N2For positive integer；
The processor moves the write pointer to next node direction, the node of the insertion is pointed to successively, together
When task is respectively written into the node that the write pointer is pointed to according to reception order, the read pointer is rested on what is currently pointed to
Until Δ T at node1Terminate.
11. data delay processing unit according to claim 8 or claim 9, wherein, needing TdShorten Δ T2In the case of,
The processor
The read pointer is moved to next node direction, the N that the read pointer is pointed to successively is read3Task in individual node
And perform, N3According to TsWith Δ T2It is determined that,
The N after performing is deleted in the memory3Before individual node, the write pointer is rested at the node currently pointed to.
12. a kind of data delay processing unit, including：
Memory；And
The processor of the memory is coupled to, the processor is configured as based on the finger being stored in the storage arrangement
Order, performs the data delay processing method as any one of claim 1-7.
13. a kind of computer-readable recording medium, is stored thereon with computer program, realized such as when the program is executed by processor
Data delay processing method any one of claim 1-7.
14. a kind of data delay processing unit, including for performing at the data delay as any one of claim 1-7
The module of reason method.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710510902.3A CN107329807B (en) | 2017-06-29 | 2017-06-29 | Data delay processing method and device, and computer readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710510902.3A CN107329807B (en) | 2017-06-29 | 2017-06-29 | Data delay processing method and device, and computer readable storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107329807A true CN107329807A (en) | 2017-11-07 |
| CN107329807B CN107329807B (en) | 2020-06-30 |
Family
ID=60197175
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710510902.3A Active CN107329807B (en) | 2017-06-29 | 2017-06-29 | Data delay processing method and device, and computer readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107329807B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109901917A (en) * | 2017-12-07 | 2019-06-18 | 龙芯中科技术有限公司 | Real time operating system dispatching method and device, computer readable storage medium |
| CN113852700A (en) * | 2021-09-26 | 2021-12-28 | 五八同城信息技术有限公司 | Virtual number processing method and device |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101630276A (en) * | 2009-08-18 | 2010-01-20 | 深圳市融创天下科技发展有限公司 | High-efficiency memory pool access method |
| CN104899154A (en) * | 2015-06-10 | 2015-09-09 | 山东大学 | Page management method based on embedded system mixed main memory |
| CN106330764A (en) * | 2016-08-15 | 2017-01-11 | 北京蓝海讯通科技股份有限公司 | Method for managing data buffering, application for managing data buffering and computing device |
-
2017
- 2017-06-29 CN CN201710510902.3A patent/CN107329807B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101630276A (en) * | 2009-08-18 | 2010-01-20 | 深圳市融创天下科技发展有限公司 | High-efficiency memory pool access method |
| CN104899154A (en) * | 2015-06-10 | 2015-09-09 | 山东大学 | Page management method based on embedded system mixed main memory |
| CN106330764A (en) * | 2016-08-15 | 2017-01-11 | 北京蓝海讯通科技股份有限公司 | Method for managing data buffering, application for managing data buffering and computing device |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109901917A (en) * | 2017-12-07 | 2019-06-18 | 龙芯中科技术有限公司 | Real time operating system dispatching method and device, computer readable storage medium |
| CN109901917B (en) * | 2017-12-07 | 2022-04-22 | 龙芯中科技术股份有限公司 | Real-time operating system scheduling method and device and computer readable storage medium |
| CN113852700A (en) * | 2021-09-26 | 2021-12-28 | 五八同城信息技术有限公司 | Virtual number processing method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107329807B (en) | 2020-06-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10664283B2 (en) | Computing system and controller thereof | |
| US8214831B2 (en) | Runtime dependence-aware scheduling using assist thread | |
| TWI442233B (en) | Parallelizing sequential frameworks using transactions, and computer storage medium for recording related instructions thereon | |
| JP7039631B2 (en) | Methods, devices, devices, and storage media for managing access requests | |
| CN101329638A (en) | Method and system for analyzing parallelism of program code | |
| CN105408859A (en) | Method and system for instruction scheduling | |
| JPH10254944A (en) | Device, method for power simulation and mechanically readable recording medium recording power simulation program | |
| CN101414252A (en) | Data processing apparatus | |
| CN102402401A (en) | Method for scheduling input output (IO) request queue of disk | |
| CN104049947B (en) | The register of vector register heap based on dynamic renaming reconfigures | |
| CN107329807A (en) | Data delay treating method and apparatus, computer-readable recording medium | |
| US7392516B2 (en) | Method and system for configuring a dependency graph for dynamic by-pass instruction scheduling | |
| TW201810033A (en) | Memory transaction-level modeling method and system | |
| JP2007532990A (en) | Method and structure for explicit software control of thread execution including helper subthreads | |
| US20090164729A1 (en) | Sync-id for multiple concurrent sync dependencies in an out-of-order store queue | |
| CN110825502B (en) | Neural network processor and task scheduling method for neural network processor | |
| Pazzaglia et al. | Characterizing the effect of deadline misses on time-triggered task chains | |
| CN107291350B (en) | Method for deleting and terminal device applied to the terminal device for supporting multi-point touch | |
| Lázaro-Muñoz et al. | A tasks reordering model to reduce transfers overhead on GPUs | |
| US6959377B2 (en) | Method and system for managing registers | |
| WO2020061765A1 (en) | Method and device for monitoring performance of processor | |
| CN104182490B (en) | A kind of method and device for managing data access | |
| CN103547990B (en) | Click disambiguation on touch-sensitive input unit | |
| US10209997B2 (en) | Computer architecture for speculative parallel execution | |
| JP6171816B2 (en) | Data management program, data management apparatus, and data management method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |