CN110928652A - Real-time task delay management method for operating system, storage medium and server - Google Patents
Real-time task delay management method for operating system, storage medium and server Download PDFInfo
- Publication number
- CN110928652A CN110928652A CN201910992603.7A CN201910992603A CN110928652A CN 110928652 A CN110928652 A CN 110928652A CN 201910992603 A CN201910992603 A CN 201910992603A CN 110928652 A CN110928652 A CN 110928652A
- Authority
- CN
- China
- Prior art keywords
- task
- delay
- key value
- current
- time
- 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.)
- Pending
Links
Images
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/48—Program initiating; Program switching, e.g. by interrupt
- G06F9/4806—Task transfer initiation or dispatching
- G06F9/4812—Task transfer initiation or dispatching by interrupt, e.g. masked
- G06F9/4831—Task transfer initiation or dispatching by interrupt, e.g. masked with variable priority
- G06F9/4837—Task transfer initiation or dispatching by interrupt, e.g. masked with variable priority time dependent
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Debugging And Monitoring (AREA)
Abstract
The invention provides a real-time task delay management method for an operating system, a storage medium and a server. The task delay real-time management method comprises the following steps: and arranging the delay tasks in sequence from small to large according to the delay time to form an increment linked list, wherein the key value of the current first task indicates the waiting time of the first task, and the key values of other tasks indicate the waiting time relative to the previous task. And timing by decreasing the key value of the current first task in the increment linked list according to the clock beat, taking the task adjacent to the current first task as the current first task when the key value of the current first task becomes zero, and timing by decreasing the key value of the current first task, thereby executing the delay management of each task in the increment linked list. According to the task delay real-time management method, the key value is designed according to the relative time of each delay task relative to the previous task, the occupation of system resources can be reduced, and the task delay management efficiency is improved.
Description
Technical Field
The invention relates to the technical field of operating systems, in particular to a task delay real-time management method of an operating system, a storage medium and a server.
Background
Task latency is a common operation in embedded real-time operating systems, and may occur when a task actively yields a CPU, waits for an event to occur, and the like. Each task needing to be delayed has a specific delay request, and an operating system must maintain a set of application delay tasks to manage the delay state and the delay time of the tasks.
The design of the data structure has a great influence on the efficiency of the task delay management of the operating system. The current task delay management method is to record the delay time of a task in a task control block, then traverse all tasks in a task control block linked list during system heartbeat processing, and perform delay state processing on the tasks.
It is urgently needed to design an efficient delay task management method, so that the delay management efficiency of an operating system is improved, and the running speed is increased.
Disclosure of Invention
The invention aims to overcome the defects of the prior art and provides a task delay real-time management method, a storage medium and a server of an operating system, so that the task delay management efficiency is improved, and the performance of the operating system is improved.
One aspect of the present application provides a method for real-time task delay management of an operating system, including: arranging all delay tasks in sequence from small to large according to delay time to form an increment linked list, wherein the key value of the current first task indicates the waiting time of the current first task, and the key values of other tasks indicate the waiting time relative to the previous task; and timing by decreasing the key value of the current first task in the increment linked list according to the clock beat, taking the task adjacent to the current first task as the current first task when the key value of the current first task becomes zero, and timing by decreasing the key value of the current first task, thereby executing the delay management of each task in the increment linked list.
In one embodiment, the clocking according to the clock tick by decrementing the key value of the current first task in the increment chain table and after the key value of the current first task becomes zero includes: and deleting the current first task from the increment chain table and putting the current first task into a ready table to be executed by an operating system.
In one embodiment, the method for real-time management of task latency of an operating system further includes: acquiring a to-be-inserted delay management task; starting from a current first task in the increment linked list, sequentially decreasing the delay time of the delay management task to be inserted according to key values of a plurality of tasks starting from the current first task in the increment linked list, inserting the delay management task to be inserted after the last of the plurality of tasks when the decreased accumulated difference value is smaller than the key value of the task next to the last of the plurality of tasks for the first time, and taking the accumulated difference value as the key value of the delay management task to be inserted; and respectively subtracting the difference value from the key value of each task after the delay management task to be inserted, and using the difference value as the key value of each task after the delay management task to be inserted is added to the increment linked list.
In one embodiment, the method for real-time management of task latency of an operating system further comprises: acquiring a to-be-inserted delay management task; and starting from the current first task in the increment linked list, sequentially decreasing the delay time of the delay management task to be inserted according to the key values of a plurality of tasks starting from the current first task in the increment linked list, and inserting the delay management task to be inserted after the last one of the plurality of tasks when the cumulative difference after decreasing is equal to 0 for the first time, wherein the key value of the delay management task to be inserted is 0.
In one embodiment, the method for real-time management of task latency of an operating system further includes: acquiring a to-be-inserted delay management task; sequentially accumulating the current first task key value and the task key values behind the current first task key value in the increment chain table, and inserting the to-be-inserted delay management tasks into the increment chain table before the last one of the tasks accumulated with each other after the accumulation result is greater than the key value of the to-be-inserted delay management task for the first time; calculating the difference value after the delay management task to be inserted and each task before the last task in the tasks accumulated with each other; and taking the difference value as a key value of the to-be-inserted delay management task, and respectively subtracting the difference value from the key value of the task positioned after the to-be-inserted delay management task to be used as the key value of each task after the to-be-inserted delay management task is added to the increment linked list.
In one embodiment, in the event that the current first task decrements to zero, all tasks having key values that are zero immediately adjacent to the current first task and adjacent to each other are removed from the delta linked list for execution by the operating system.
In one embodiment, the method for real-time management of task latency of an operating system further includes: acquiring a task to be eliminated; deleting the task to be eliminated from the increment linked list; and adding the key value of each task after the task to be eliminated to the key value of the task to be eliminated as a new key value.
Another aspect of the present application provides a storage medium storing an executable program, which executes the method for delayed real-time management of tasks of an operating system as described above when the executable program is called.
Yet another aspect of the present application provides a server comprising a memory storing an executable program and a processor for invoking the executable program to perform the operating system task latency real-time management method as described above.
According to the real-time task delay management method, the storage medium and the server of the operating system, the operating system only needs to time the current first task through the increment chain table obtained by the relative delay of the delay task relative to the previous task, the delay management mode that the operating system needs to traverse all delay tasks is changed, the consumption in the running process is reduced, and the performance of the operating system is improved.
It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the invention, as claimed.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate exemplary embodiments of the invention and together with the description, serve to explain the principles of the invention.
Fig. 1 is a flowchart of an os task latency real-time management system according to an embodiment of the present invention.
Fig. 2 is a schematic diagram of an increasing linked list according to an embodiment of the present invention.
Fig. 3a is a flowchart of inserting a delayed task according to an embodiment of the present invention.
Fig. 3b is a schematic diagram of a method for inserting an increasing linked list into a delayed task according to an embodiment of the present invention.
Fig. 4 is a flowchart of a method for inserting an incremental table into a delayed task according to another embodiment of the present invention.
Detailed Description
Reference will now be made in detail to various exemplary embodiments of the invention, the detailed description should not be construed as limiting the invention but as a more detailed description of certain aspects, features and embodiments of the invention.
It will be apparent to those skilled in the art that various modifications and variations can be made in the specific embodiments of the present disclosure without departing from the scope or spirit of the disclosure. Other embodiments will be apparent to those skilled in the art from consideration of the specification. The specification and examples are exemplary only.
In embedded operating systems, task latency management is often involved. In the current task delay management, the absolute time of task delay is used, and the delay is processed by traversing all tasks of a task control block linked list. Because the method needs to traverse all the tasks in the task list, the processing speed is reduced, and more system resources are occupied. The application designs an increment linked list, and the efficiency of task delay management can be improved by using relative time instead of absolute time.
One aspect of the application provides a method for real-time management of task delay of an operating system. Referring to fig. 1, the method for real-time management of task delay of an operating system includes the following steps:
s1 arranges the delay tasks in order from small to large according to the delay time to form an increment chain table, where the key value of the current first task indicates the waiting time, and the key values of the other tasks indicate the waiting time relative to the previous task (the key value is the difference between the absolute delay time of the next delay task and the absolute delay time of the immediately preceding delay task). If the absolute delay time lengths of a plurality of tasks are the same, the tasks with the same delay time length are arranged adjacently, and at the moment, except for the first delay task, other key values are all zero.
S2, according to the clock beat, counting time by decreasing the key value of the current first task in the increment chain table, and when the key value of the current first task becomes zero, taking the task adjacent to the current first task as the current first task, and counting time by decreasing the key value, thereby executing the delay management of each task in the increment chain table.
For example, if the key value of the current first task becomes zero, it may be deleted from the delta linked list and the task executed by the operating system. And taking the delay task adjacent to the delay task as the current first task to perform clock beat processing, and when the key value of the task is zero, deleting the task from the increment linked list. The processing of each subsequent delay task is analogized, and is not described herein.
According to the real-time management method for the task delay of the operating system, the current tasks are sequentially arranged according to the delay time, the waiting time of the next task relative to the previous task is taken as the key value, all delay tasks do not need to be traversed in real-time delay processing, the resources of the operating system are saved, and the processing speed is improved.
Fig. 2 illustrates an increasing linked list management mode with A, B, C, D four latency tasks, where task A, B, C, D requests a latency of 5, 20, 50, 100 time units, respectively, and such requests are assumed to be made at approximately the same time (i.e., within one time unit). As can be seen from the increasing linked list shown in fig. 2, the key values of the four tasks are 5, 15, 30, and 50, i.e., the relative time of the previous delayed task is all the same.
In one embodiment, the method includes the following steps of timing by decreasing the key value of the current first task in the increment chain table according to the clock beat, and after the key value of the current first task becomes zero: the current first task is removed from the increment chain table and put into the ready list for execution by the operating system. The clock beat timing is carried out on each delay task in sequence according to the sequence of the delay tasks from small to large, and when the key value of each delay task becomes zero, the task is put into a ready list, so that the current increasing chain table only consists of the delay tasks with the residual key values not being zero, and the composition of the increasing chain table is further simplified.
When the operating system manages the delay tasks, temporary delay requests can be received, and the temporary delay tasks need to be added into an increasing linked list for centralized management. In this case, as shown in fig. 3a, the method for real-time management of task latency of an operating system further includes:
s31 obtains the to-be-inserted delay management task.
S32 sequentially decrements the delay time of the to-be-inserted delay management task according to the key values of the tasks starting from the current first task in the increment chain table, and inserts the to-be-inserted delay management task after the last of the tasks when the decremented accumulated difference is first smaller than the key value of the task adjacent to the last of the tasks (the accumulated difference needs to be larger than zero), and uses the accumulated difference as the key value of the to-be-inserted delay management task. That is, the absolute time length of the task to be inserted is used for sequentially subtracting the key value of each task in the increasing linked list until the absolute time length is smaller than the last key value in the decreased increasing linked list, and the absolute time length is inserted before the task. And
s33 subtracts the key value of the task to be inserted from the key value of each task after the delay management task to be inserted, and uses the subtracted value as the key value of each task after the delay management task to be inserted is added to the increment chain table.
According to the method and the device, the difference value calculation is carried out on the delay tasks to be inserted, the tasks to be inserted can be quickly placed at proper positions in the current increasing chain table, and therefore dynamic and effective management on the temporarily inserted delay tasks is achieved.
Fig. 3b illustrates a process of inserting a delay management task into the chain increasing list shown in fig. 2, where the delay time of the task to be inserted is 30, and the insertion process is determined by calculating an accumulated difference obtained by sequentially subtracting the delay time from the key values of the tasks in the chain increasing list. Specifically, the key values of the four delayed tasks are 5, 15, 20 and 50 in sequence, 30-5 is 25, 25-15 is 10, and since 10 is smaller than 20, the task to be inserted is inserted before the C task with the key value of 20, and 10 is subtracted from the key values of the C task with the key value of 20 and the D task with the key value of 50, so that the key values of the C task and the D task are 10 and 40, respectively. Therefore, the rearranged key values after the delay tasks to be inserted are inserted into the increased linked list are 5, 15, 10, 10 and 40.
In the above embodiment, when the cumulative difference is calculated between the task to be inserted and each task key value in the increment chain table, the cumulative difference may be zero. This case indicates that the absolute delay time of the to-be-inserted delay task is equal to the absolute delay time of the last of the tasks that are different, the to-be-inserted delay management task may be inserted after the last of the tasks that are different from the to-be-inserted delay management task, and the key value of the to-be-inserted delay management task is 0. Because the key value of the to-be-inserted delay management task is zero, the key values of the tasks positioned after the to-be-inserted delay management task in the chain increasing table are unchanged.
Different from the above embodiment, the delay management task to be inserted may also be obtained by accumulating the key values of the tasks in the increment chain table. Specifically, as shown in fig. 4, the method for real-time managing task latency of an operating system may further include:
s41 obtains the to-be-inserted delay management task.
S42 sequentially accumulates the current first task key value and the subsequent delay task key values in the increment chain table, and inserts the delay management task to be inserted before the last of the tasks accumulated each other after the accumulated result is first greater than the key value of the delay management task to be inserted.
S43 calculates a difference between the delay time period to be inserted into the delay managing task and each of the delay tasks before the last one among the tasks accumulated with each other.
S44 takes the difference value as a key value of the delay management task to be inserted. And
s45 subtracts the key value of the to-be-inserted delay management task from the key value of the task after the to-be-inserted delay management task, and uses the subtracted value as the key value of each task after the to-be-inserted delay management task added to the increment chain table.
According to the task delay real-time management method, the position calculation process of the delay task to be inserted can be simplified through the mode of adding the key values in the chain increasing table, and the management efficiency of the delay task is improved.
For example, at a certain time of delayed task management, in the case that the current first task is decreased to zero, all tasks with zero key values sequentially adjacent to the current first task are removed from the increment chain table. That is, at any time, the first task key in the increment chain table is not zero, so as to be executed by the operating system. For example, these tasks with a key value of zero may be placed into a ready table for execution by the operating system. According to the task time delay real-time management method, the current first task is timed according to the clock beat, and after the clock beat is zero, all tasks with the key values which are adjacent to the current first task and are sequentially adjacent are cleaned in a centralized mode, so that the condition that no redundant information exists in an increasing chain table can be ensured, the effective management of the time delay task can be realized, and the performance of an operating system is improved.
In the process of delaying task management, the deletion operation of the tasks in the adding chain table may be involved. At this time, the real-time management method for task delay of the operating system may further include: acquiring a task to be eliminated;
deleting the task to be eliminated from the increment linked list; and
and adding the key value of each task after the task to be eliminated to the key value of the task to be eliminated as a new key value.
According to the task delay real-time management method, the delay tasks are deleted, and effective operation of the chain increasing list can be guaranteed.
In order to implement the increment chain table and execute task insertion and delay time processing operations on the delay increment chain table, a chain table node definition item may be added in a task control block, and the program representation may be as follows:
and defining a task delay increment chain table struct tcb deltaList.
The above embodiments may be combined with each other with corresponding technical effects.
Another aspect of the present application provides a storage medium storing an executable program, which executes the method for delayed real-time management of tasks of an operating system as described above when the executable program is called.
Yet another aspect of the present application provides a server comprising a memory storing an executable program and a processor for invoking the executable program to perform the operating system task latency real-time management method as described above.
According to the real-time task delay management method, the storage medium and the server of the operating system, the operating system only needs to time the current first task through the increment chain table obtained by the relative delay of the delay task relative to the previous task, the delay management mode that the operating system needs to traverse all delay tasks is changed, the consumption in the running process is reduced, and the performance of the operating system is improved.
The embodiments of the invention described above may be implemented in various hardware, software code, or combinations of both. For example, an embodiment of the present invention may also be program code for executing the above method in a Digital Signal Processor (DSP). The invention may also relate to a variety of functions performed by a computer processor, digital signal processor, microprocessor, or Field Programmable Gate Array (FPGA). The processor described above may be configured according to the present invention to perform certain tasks by executing machine-readable software code or firmware code that defines certain methods disclosed herein. Software code or firmware code may be developed in different programming languages and in different formats or forms. Software code may also be compiled for different target platforms. However, the different code styles, types, and languages of software code and other types of configuration code that perform tasks in accordance with the present invention do not depart from the spirit and scope of the present invention.
The foregoing is merely an illustrative embodiment of the present invention, and any equivalent changes and modifications made by those skilled in the art without departing from the spirit and principle of the present invention should fall within the protection scope of the present invention.
Claims (10)
1. A real-time management method for task delay of an operating system is characterized by comprising the following steps:
arranging all delay tasks in sequence from small to large according to delay time to form an increment linked list, wherein the key value of the current first task indicates the waiting time of the current first task, and the key values of other tasks indicate the waiting time relative to the previous task;
and timing by decreasing the key value of the current first task in the increment linked list according to the clock beat, taking the task adjacent to the current first task as the current first task when the key value of the current first task becomes zero, and timing by decreasing the key value of the current first task, thereby executing the delay management of each task in the increment linked list.
2. The os task latency real-time management method according to claim 1, wherein the timing is performed by decrementing a key value of a current first task in an increment chain table according to a clock tick, and after the key value of the current first task becomes zero, the method further comprises:
and deleting the current first task from the increment chain table and putting the current first task into a ready table to be executed by an operating system.
3. The os task latency real-time management method according to claim 1, further comprising:
acquiring a to-be-inserted delay management task;
starting from a current first task in the increment linked list, sequentially decreasing the delay time of the delay management task to be inserted according to key values of a plurality of tasks starting from the current first task in the increment linked list, inserting the delay management task to be inserted after the last of the plurality of tasks when the decreased accumulated difference value is smaller than the key value of the task next to the last of the plurality of tasks for the first time, and taking the accumulated difference value as the key value of the delay management task to be inserted; and
and respectively subtracting the difference value from the key value of each task after the delay management task to be inserted, and taking the difference value as the key value of each task after the delay management task to be inserted is added to the increment linked list.
4. The os task latency real-time management method according to claim 1, further comprising:
acquiring a to-be-inserted delay management task;
and starting from the current first task in the increment linked list, sequentially decreasing the delay time of the delay management task to be inserted according to the key values of a plurality of tasks starting from the current first task in the increment linked list, and inserting the delay management task to be inserted after the last one of the plurality of tasks when the cumulative difference after decreasing is equal to 0 for the first time, wherein the key value of the delay management task to be inserted is 0.
5. The os task latency real-time management method according to claim 1, further comprising:
acquiring a to-be-inserted delay management task;
sequentially accumulating the current first task key value and the task key values behind the current first task key value in the increment chain table, and inserting the to-be-inserted delay management tasks into the increment chain table before the last one of the tasks accumulated with each other after the accumulation result is greater than the key value of the to-be-inserted delay management task for the first time;
calculating the difference value after the delay management task to be inserted and each task before the last task in the tasks accumulated with each other;
taking the difference value as a key value of the to-be-inserted delay management task, an
And respectively subtracting the difference value from the key value of the task after the delay management task to be inserted, and taking the difference value as the key value of each task after the delay management task to be inserted is added to the increment linked list.
6. The os task delay real-time management method according to any one of claims 1 to 5, wherein: and under the condition that the current first task is decreased to zero, removing a plurality of tasks with all sequentially adjacent key values which are zero and are immediately after the current task from the increment chain table so as to be executed by an operating system.
7. The os task latency real-time management method according to claim 6, further comprising:
obtaining a task to be eliminated;
deleting the task to be eliminated from the increment linked list; and
and adding the key value of each task after the task to be eliminated to the key value of the task to be eliminated as a new key value.
8. The os task latency real-time management method according to any one of claims 1 to 5, further comprising:
acquiring a task to be eliminated;
deleting the task to be eliminated from the increment linked list; and
and adding the key value of each task after the task to be eliminated to the key value of the task to be eliminated as a new key value.
9. A storage medium storing an executable program which, when invoked, performs the operating system task latency real-time management method of any one of claims 1 to 8.
10. A server comprising a memory storing an executable program and a processor for invoking the executable program to perform an operating system task latency real-time management method according to any one of claims 1 to 8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910992603.7A CN110928652A (en) | 2019-10-18 | 2019-10-18 | Real-time task delay management method for operating system, storage medium and server |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910992603.7A CN110928652A (en) | 2019-10-18 | 2019-10-18 | Real-time task delay management method for operating system, storage medium and server |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110928652A true CN110928652A (en) | 2020-03-27 |
Family
ID=69849060
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910992603.7A Pending CN110928652A (en) | 2019-10-18 | 2019-10-18 | Real-time task delay management method for operating system, storage medium and server |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110928652A (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1936765A (en) * | 2005-09-30 | 2007-03-28 | 康佳集团股份有限公司 | Scheduling method of timer chain meter |
| CN101183316A (en) * | 2007-11-28 | 2008-05-21 | 北京中星微电子有限公司 | Tasks delayed time processing method and system in real-time operating system |
| CN101840353A (en) * | 2010-05-14 | 2010-09-22 | 陈冬岩 | Dynamic timing method for real-time embedded operating system |
| CN106528286A (en) * | 2016-11-22 | 2017-03-22 | 北京智芯微电子科技有限公司 | Method and device for realizing timer |
| US20170308398A1 (en) * | 2016-04-21 | 2017-10-26 | Samsung Electronics Co., Ltd. | Mechanism for ssds to efficiently manage background activity with notify |
| CN108572872A (en) * | 2018-03-09 | 2018-09-25 | 北京航空航天大学 | A kind of method for managing resource based on FPGA Reconfiguration Technologies |
-
2019
- 2019-10-18 CN CN201910992603.7A patent/CN110928652A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1936765A (en) * | 2005-09-30 | 2007-03-28 | 康佳集团股份有限公司 | Scheduling method of timer chain meter |
| CN101183316A (en) * | 2007-11-28 | 2008-05-21 | 北京中星微电子有限公司 | Tasks delayed time processing method and system in real-time operating system |
| CN101840353A (en) * | 2010-05-14 | 2010-09-22 | 陈冬岩 | Dynamic timing method for real-time embedded operating system |
| US20170308398A1 (en) * | 2016-04-21 | 2017-10-26 | Samsung Electronics Co., Ltd. | Mechanism for ssds to efficiently manage background activity with notify |
| CN106528286A (en) * | 2016-11-22 | 2017-03-22 | 北京智芯微电子科技有限公司 | Method and device for realizing timer |
| CN108572872A (en) * | 2018-03-09 | 2018-09-25 | 北京航空航天大学 | A kind of method for managing resource based on FPGA Reconfiguration Technologies |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN100412865C (en) | Read-copy update system and method | |
| CN107315761B (en) | Data updating method, data query method and device | |
| CN108140028B (en) | Method and architecture for providing database access control in a network with a distributed database system | |
| US8615771B2 (en) | Effective management of blocked-tasks in preemptible read-copy update | |
| US7302686B2 (en) | Task management system | |
| CN108121782B (en) | Distribution method of query request, database middleware system and electronic equipment | |
| US7716249B2 (en) | Transaction and task scheduler | |
| JP5398375B2 (en) | Optimizing grace period detection for preemptable reads, copies, and updates on uniprocessor systems | |
| US9389925B2 (en) | Achieving low grace period latencies despite energy efficiency | |
| US8924655B2 (en) | In-kernel SRCU implementation with reduced OS jitter | |
| CN110895484A (en) | Task scheduling method and device | |
| CN106503001B (en) | Data updating method and device in distributed cluster environment | |
| CN107710203B (en) | Transaction database layer above distributed key/value store | |
| CN106325984B (en) | Big data task scheduling device | |
| US20220100561A1 (en) | Timer-based task processing method and apparatus and electronic device | |
| US5758137A (en) | Method and system for processing timer requests within a computer | |
| CN110895483A (en) | Task recovery method and device | |
| US20150026694A1 (en) | Method of processing information, storage medium, and information processing apparatus | |
| US10599472B2 (en) | Information processing apparatus, stage-out processing method and recording medium recording job management program | |
| JP6772883B2 (en) | Reading program, reading method and information processing device | |
| CN110928652A (en) | Real-time task delay management method for operating system, storage medium and server | |
| CN108121514B (en) | Meta information updating method and device, computing equipment and computer storage medium | |
| CN113901141B (en) | Distributed data synchronization method and system | |
| JP3627619B2 (en) | Two-phase commit avoidance method and program recording medium | |
| Lam et al. | Transaction scheduling in distributed real-time systems |
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 | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20200327 |
|
| WD01 | Invention patent application deemed withdrawn after publication |