CN101561767B - Method and device for executing tasks based on operating system - Google Patents
Method and device for executing tasks based on operating system Download PDFInfo
- Publication number
- CN101561767B CN101561767B CN 200810036120 CN200810036120A CN101561767B CN 101561767 B CN101561767 B CN 101561767B CN 200810036120 CN200810036120 CN 200810036120 CN 200810036120 A CN200810036120 A CN 200810036120A CN 101561767 B CN101561767 B CN 101561767B
- Authority
- CN
- China
- Prior art keywords
- task
- waiting
- queue
- reference position
- tasks
- 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.)
- Expired - Fee Related
Links
Images
Abstract
The invention aims at providing a method and a device for executing tasks based on an operating system. Positions of tasks in a task queue are adjusted according to the execution states of the tasks in the task queue so as to lead uncompleted tasks to be preferentially detected and processed in a next detection period. If the current detection has no task needing to be processed, the next detection period begins after waiting preset time. The method for executing tasks provides a chance to be executed again for the known tasks needing to be executed within a shorter time on the one hand and provides different system detection frequencies on the other hand so as to save the occupation to system resources.
Description
Technical field
The present invention relates to a kind of task executing method and device thereof, relate in particular to task executing method and device thereof in real time operating system based on operating system.
Background technology
Along with computer system progressively is penetrated into the every nook and cranny of social life, also increasing gradually as operating system shared proportion in industry of computer system kernel with the basis.Operating system not only is used for whole resources that managing computer system comprises hardware and software, also needs control program to carry out, and provides support for various tasks, so that all resources of computer system play a role to greatest extent.As a huge management control system, one of major function of operating system is managed the execution of a plurality of different tasks exactly.
In the prior art, a plurality of tasks of operating system are detected by periodic scan according to the order of setting in the program code successively.If detect the current task for processing that needs, then this task handled.As far as a particular task, if when program does not detect this task in order, then this task executions just must be waited for.Specifically, a plurality of tasks are put into task queue according to a definite sequence, the periodic scan of waiting system.System comprises some tasks in to formation in a sense cycle task groups scans to confirm whether have the current time to need task for processing in this task groups.If in this task groups the task for processing of needs is arranged, then it is handled.If do not need task for processing, handled perhaps that all need task for processing in the current task group, then wait for next sense cycle, again other task in the formation is scanned.
Based on the task executing method of prior art, the invariant position of task in task queue, and can only the scanning of latent period property detect.In other words, the task that probability of happening is high, temporal correlation is strong is scanned detected probability and accidental task is basic identical, fails the task of in a sense cycle, accomplishing, and must wait for that also at least one sense cycle just possibly be performed once more.This task executing method possibly cause hot job in time not handle, and has also wasted the resource of system simultaneously.Another kind of solution commonly used is to utilize the strong task of interrupt mechanism processing time correlativity, but the interrupt resources of system is relatively limited, often can't satisfy the needs of system design.
Summary of the invention
The objective of the invention is to overcome the deficiency of prior art, a kind of more Efficient and Flexible task execution mechanism is provided.
Based on this purpose; The invention provides a kind of task executing method and device based on operating system; Concrete, the present invention comes dynamically to adjust its position in task queue according to the task executions state, needs the time of the task waiting detection of execution with shortening.Preferably; When the current time in the detected task groups in the sense cycle needs task for processing to fail all in this sense cycle, to accomplish; The present invention places task queue foremost uncompleted task; And in next sense cycle from the detecting foremost of task queue, and carry out detected waiting task, thereby guarantee the chance that uncompleted task can be carried out once more in last sense cycle in the shortest time.Preferably;, the current time in the detected task groups in the sense cycle (needs to understand when needing task for processing in this sense cycle, all to accomplish; This moment, this sense cycle did not finish probably as yet); The present invention does not wait for that this sense cycle finishes, but gets into next sense cycle immediately, and the waiting task in this task queue is detected.In addition,, then wait for the time of a predetermined length, get into next sense cycle again, be used for the resource overhead that task queue detects with reasonable control if do not need task for processing in the current sense cycle.
According to an aspect of the present invention; A kind of task executing method based on operating system is provided; Wherein, may further comprise the steps: a) whether detection comprises one or more waiting tasks since first quantity task of the detection reference position of a task queue; B) if comprise one or more waiting tasks in said first quantity task; Then second quantity waiting task in said one or more waiting tasks is handled; Obtaining second quantity treated task, and adjust its position in said task queue according to said each treated task executions state; C) repeating said step b) all handles until said one or more waiting tasks.
According to another aspect of the present invention; A kind of task execution device based on operating system also is provided; It is characterized in that, comprising: pick-up unit is used for detecting since first quantity task of the detection reference position of a task queue whether comprise one or more waiting tasks; Adjusting gear; If comprise one or more waiting tasks in said first quantity task; Then said adjusting gear is used for second quantity waiting task of said one or more waiting tasks is handled; Obtaining second quantity treated task, and adjust its position in said task queue according to said each treated task executions state; Control device is used to judge whether that said one or more waiting task all handles, if untreated waiting task is arranged, then controls said adjusting gear said untreated waiting task is operated.
Compared with prior art, the present invention can the task for known needs execution provide the chance that is performed once more in the shorter time.On the other hand; If have waiting task to handle in the cycle in current detection; Then after the processing of accomplishing current detection detected waiting task in the cycle, need not to wait for continue to detect whether also have other waiting task in the task queue at once.This manner of execution provides the higher detection frequency more for a long time in system task, in system task lower detection frequency is provided more after a little while, has realized " frequency conversion operation " in a sense, has improved the efficient of operating system.
Description of drawings
Through reading the detailed description of doing with reference to following accompanying drawing that non-limiting example is done, it is more obvious that other features, objects and advantages of the present invention will become:
Fig. 1 is the synoptic diagram of the task queue of an embodiment according to the present invention;
Fig. 2 is the process flow diagram based on the task executing method of operating system according to an embodiment of the present invention;
Fig. 3 is the process flow diagram based on the task executing method of operating system according to a preferred embodiment of the present invention; Fig. 4 is the synoptic diagram according to the task queue of one embodiment of the present invention;
Fig. 5 is the task execution device block diagram based on operating system according to an embodiment of the present invention;
Wherein, same or analogous Reference numeral is represented same or analogous steps characteristic or device/module.
Embodiment
Understand the part notion that at first occurs in the herein interpreted for convenient:
-task queue: among this paper, the formation that will be used for the task (comprising that the current detection cycle needs task for processing and current detection cycle not to need task for processing) that storage system maybe needs carries out is called task queue.
-the first quantity task: in a sense cycle, being detected by scanning of task, according to the difference of embodiment, this first quantity task possibly be the part or all of task in the task queue.
-waiting task: need specifically to detect from first quantity task definite through scanning in current detection task for processing in the cycle.
-treated task: a waiting task promptly becomes a treated task after treatment in current detection in the cycle, note that treated task possibly finish dealing with the completion of also possibly being untreated;
-the second quantity task: operating system is the waiting task of interior executed in parallel at one time; For instance; For only supporting single-threaded uniprocessor dispatching system; Owing to can only have a thread to be in executing state on each processor, therefore can only support execution one by one to waiting task, then the number of this second quantity task of this kind situation correspondence is 1.For the system of scheduling of multiprocessor thread, can be integer smaller or equal to above-mentioned first quantity according to the number of this second quantity task of difference of system thread scheduling mechanism.
-executing state: carry out corresponding various task status with task.Execution among this paper is meant process the taking processor of task; Be the thread of the task entering running status that is scheduled, and the adjustment itself of task relevant information operations such as () status information that ordering detection for example etc. causes are read, priority is adjusted is not regarded as task executions.Executing state comprises following three kinds: do not carry out, promptly in waiting for implementation; Accomplish,, wait for next time and carrying out promptly through carrying out but task is not done; Accomplish, promptly through carrying out and being done.Thus, the state that it will be understood by those skilled in the art that a treated task possibly accomplished for accomplishing perhaps.
In addition, it should be noted that the position of the task of will adjusting among this paper in formation, task carried out the various operations that task is carried out such as (no matter whether accomplishing execution) be referred to as " processing ".Consider such a case, suppose to work as previous task, still owing to reasons such as network timeout or this user device system overload temporarily can't be accomplished transmission for sending message information to another subscriber equipment.Should be appreciated that this task passes through " processings " this moment, but do not accomplish " execution ", and its executing state is " completion ".
-detect reference position: the reference position that refers to current detection first quantity task that needs detect in the cycle.Shown in Figure 1 is the synoptic diagram according to the task queue of an embodiment of the present invention.Suppose that system can detect 64 (promptly first quantity is 64) tasks in a sense cycle, detecting reference position is primary importance shown in Fig. 1.Then system detects 64 tasks that begin from the task of being positioned at primary importance in the formation shown in Figure 1 in current sense cycle, confirms wherein whether to comprise waiting task.Suppose that the detection reference position of next sense cycle is current detection reference position (primary importance) position of first quantity task afterwards, then the detection reference position of next sense cycle is the second place shown in Fig. 1.
Among this paper, as do not have other special instruction, above-mentioned notion all can be explained by foregoing.
Below in conjunction with process flow diagram method of the present invention is partly described.
Fig. 2 is the process flow diagram based on the task executing method of operating system according to an embodiment of the present invention.Followingly task executing method provided by the invention is described, suppose that primary importance shown in Fig. 1 is the current detection reference position, and first quantity is 8 with reference to Fig. 1.It will be appreciated by those skilled in the art that said method can be applied to include but not limited to personal computer (PC), the webserver, intelligent mobile terminal, STB or the like among any equipment based on operating system, below is example with PC.
In step S10, the operating system among the PC (hereinafter to be referred as system) detects 8 tasks that begin from the reference position of detection shown in Fig. 1, thereby knows whether the waiting task that needs processing is wherein arranged.Each task in the real time operating system can corresponding specific zone bit, and according to the difference setting of operating system, whether system can walk abreast or sequentially come these 8 tasks through the special sign position is that waiting task detects.
Concrete; System reserves certain storage space and stores whether be used to identify each task be the identification information of waiting task; Said identification information comprises a plurality of zone bits; And whether corresponding specific task to be detected of each zone bit wherein, its value of 1 or 0 be then to should task being waiting task.System comes at any time the perhaps value of the corresponding zone bit of regular update according to definition status, priority or other relevant informations of each task.For instance; Task for one-period property; It whenever promptly need be carried out once at a distance from a predetermined period, and for this reason, system will judge that whether over and done with this task carried out from last time an above-mentioned predetermined period through the surveillance clock; If judged result is " being ", then revise this task corresponding marker bit.
According to above-mentioned explanation, the system of one of ordinary skill in the art will readily recognize that can know in these 8 tasks whether the task for processing of needs is arranged through the corresponding zone bit that reads in the above-mentioned identification information.The ground that is without loss of generality supposes that zone bit is that 1 its corresponding task of expression is a waiting task, and zone bit is 0 expression corresponding task for being not (the current detection cycle) waiting task.Be appreciated that if the identification information that system reads is 0,000 1010, can know that then the 5th and the 7th task (being task A shown in Fig. 1 and task B) that begins from initial detection position is detected waiting task.Optional, read one by one through zone bit and can confirm that equally whether its corresponding task is waiting task, no longer gives an example here above-mentioned 8 tasks.For detected waiting task; System can set corresponding position and identify in its relevant information; " waiting task in this sense cycle " this identity with clear and definite this task certainly, is this purpose; System also can put into newly-built formation or array with the pointer of each above-mentioned waiting task, repeats no more here.Suppose, as shown in Figure 1, in the present embodiment through detecting, confirm that task A and task B are waiting task from detecting in 8 tasks that reference position begins.Detect in first quantity task and have waiting task, so this method gets into step S11.
In step S11, waiting task A and the waiting task B that confirms among the step S10 handled.For ease of understanding, at first cite a plain example, wherein, second quantity is 1, also promptly, at one time, operating system is only handled individual task.In view of waiting task has two, system handles task A earlier.Suppose that task A is: receive a data block from port one, the possibility of result after then it being handled is to have accomplished the reception (accomplishing) to this data block or temporarily can't carry out this data block is received (not accomplishing).It should be noted that after this no matter whether task A can be done through above-mentioned processing, it all will be regarded as treated task at the state of current detection in the cycle.
After task A carried out above-mentioned processing; System also upgrades the executing state of task A; Concrete, its executing state being updated to " not accomplishing " from " not carrying out " perhaps " accomplishing ", this renewal process can realize through being provided with the corresponding relevant information of task A; This belongs to the mature technology that those skilled in the art understand, and repeats no more here.
If system has accomplished the operation that receives this data block from port one in this sense cycle, the executing state after then task A upgrades is " accomplishing ".Operating system comes the position of task A in this task queue adjusted according to executing state and the pre-defined rule after upgrading, and for example, is placed on A ' position as shown in Figure 1 in the task queue.Preferably, when the position of treated task is adjusted, can uncompleted each treated task be placed in task queue before completed each treated task.Preferred, can completed treated task be placed the tail of the queue of task queue according to the task executions state with the head of the queue of uncompleted each treated task as for task queue.Be appreciated that; Through above preferred implementation; Can be with in next sense cycle, needing the forward position that task for processing concentrates on formation badly; Processing mode of the prior art relatively can be saved the detection time that needs Processing tasks, has also reduced the wait as long for probability that incident causes.
Task A after treatment, system judges whether that in step S12 detected before this all waiting tasks all are processed (executing state after no matter it is handled is why).If untreated waiting task is still arranged then return step S11 and proceed to handle.In this example, system knows that through judgement waiting task B handles as yet, then returns step S11.Said judgement can be based on multiple existing techniques in realizing.For example, in step S10, the numerical value (being 2 in this example) of the quantity of waiting task is put into a memory block, every completion just subtracts one with the numerical value in this memory block to a task handling, is 0 to accomplish the processing to all waiting tasks until this numerical value.Prior art has multiple ripe support scheme to said judgement, here specifically citation no longer one by one.
Suppose that task B is: send one group of data to port 2, but owing to reasons such as network congestion or port 2 temporary closes, in step S11, fail to accomplish execution to task B.According to the elaboration of front, system can be regarded as treated task with task B, and its executing state is not updated to " accomplishing " from " carrying out ", and task B is put into the position of task queue B ' according to the executing state after this renewal.Wherein the particular location of B ' is confirmed by the preset rules of system, for example, hope is detected the forward position that task for processing places formation as early as possible once more, need not frequent task to be detected and places the back position of leaning on of task queue.
Task B after treatment, system judges whether that through step S12 all waiting tasks (A, B) all are processed, if all accomplish, then finish the operation in current detection cycle once more.Preferably, this method gets into step S10 immediately, begins a new sense cycle.A lot of existing operating systems can be supported the parallel processing to a plurality of tasks.Therefore, it will be understood by those skilled in the art that what mention among this paper can be a plurality of by the task number of executed in parallel (i.e. " second quantity ") at one time.For example, can handle waiting task A in this example and waiting task B simultaneously based on the windows XP task scheduling system of double-core or multinuclear, in the case, the value of second quantity is 2.Consideration takies and the requirement of multiple factor such as speed system resource, can the adjusting of this second quantity through the software program setting, and not only by the Hardware configuration decision of system.
The value of carrying out second quantity task and second quantity simultaneously is greater than under 1 the situation, and after each that can be in handling second quantity task, the executing state after upgrading according to this task is immediately adjusted the position of this task in task queue.Also can handle and upgrade its executing state separately earlier to second quantity task; By the time after all tasks in second quantity task all being accomplished the operation of handling with the executing state renewal, come its position to adjust respectively according to the executing state after each the renewal in this second quantity task again.Be to be understood that; Owing to have a plurality of tasks in the task queue; And core concept of the present invention is according to each its position in task queue of task executions state adjustment; Therefore, the ordinal relation in the present embodiment between related each step only to specific embodiment, does not constitute the qualification to protection domain of the present invention.
More than, be that the supposition of waiting task is introduced this method based on task A among Fig. 1 and task B.And if comprise all non-waiting task of above-mentioned 8 tasks of task A, B, then optimum system choosing ground was waited for after the time of certain-length, repeated execution of steps S10.
Below, will and combine Fig. 1 that an optimization modification of above-mentioned embodiment is done concise and to the point description with reference to Fig. 3.Fig. 3 is the process flow diagram based on the task executing method of operating system according to a preferred embodiment of the present invention.
Total task number of supposing to exist in the task queue also promptly, can't intactly scan whole task queue in each sense cycle greater than first quantity.So, in step S12 through judge learn first quantity task handling has been all over after, this method also possibly detect and handle all the other tasks in the task queue.Wherein a kind of optional mode; Be exactly after each sense cycle; Detect reference position according to certain Policy Updates; And first quantity task that in next sense cycle, the detection reference position after upgrade is begun detects, and carries out follow-up each procedure of corresponding each item then.After the detection and processing of the first quantity task of accomplishing the current detection cycle, definition detects reference position again, begins the next cycle of treatment that detects again.Cooperate relevant detection reference position update rule, use the task executing method mechanism of this this kind circular treatment can adjust in the formation each task to be detected with the probability of carrying out, help the reasonable distribution of system process time quota.
For instance, suppose that still task queue is as shown in Figure 1, the detection reference position in current detection cycle is a primary importance.This method is carried out to step S12, after the processing of each waiting task in first quantity task that primary importance is begun has been accomplished in judgement, in step S13, upgrades detecting reference position.The renewal of said detection position can be passed through accomplished in many ways, for instance, can task queue be stored with the form of array, wherein an element in the corresponding array of each task.The pointer of corresponding each task is stored in array successively, and specifies the corresponding element that detects reference position in the independent pointed array.In each sense cycle; First quantity positions of elements behind current this pointer corresponding element of the pointed that this is independent (the detection reference position in current detection cycle), and with this position as the detection reference position (being the second place among Fig. 1) after upgrading.It will be understood by those skilled in the art that the not unique correspondence of detection reference position after the renewal, can adjust flexibly upgrading the rule that detects reference position according to the designing requirement of system.Preferably and since according to the present invention current detection in the cycle uncompleted treated task will concentrate on task queue than front end, therefore can be with detecting the head of the queue that reference position be updated to task queue.
After accomplishing the renewal that detects reference position through step S13, execution in step S10 detects processing to the task that the second place begins.
Preferably, if do not have waiting task in first quantity task that current detection detected in the cycle, then system to detect reference position and upgrade and wait for time cycle of a predetermined length after again the task in the task queue is detected.Still be described below with reference to Fig. 3.
Suppose that the primary importance among Fig. 1 is the detection reference position.In step S10, detect first quantity task that begins from the task of being arranged in primary importance and whether comprise waiting task.
If wherein comprise waiting task, then get into step S11 and come waiting task is done further processing, repeat no more here.
If wherein do not comprise waiting task, then get into step S14, wait for the time cycle of a predetermined length.Concrete; Can be the number of system clock cycle (system clock) accordingly with it with the length transition of the time cycle of need waiting for; And this numerical value is kept in the memory block; Each new clock period subtracts 1 with this numerical value later, when this numerical value is reduced to 0, begins next sense cycle.Certainly, also can utilize the timer of system to keep or jump out above-mentioned waiting status.In view of the technological means well-known to those skilled in the art that is set to, no longer add among this paper to describe to time cycle of predetermined length.
Preferably; In step S14, can also upgrade detecting reference position; With the detection reference position of the residing position of first quantity task after the task on the current detection reference position as next sense cycle; That is, the position of task is used as the detection reference position in the next sense cycle on the second place among Fig. 1.
What it should be noted that foregoing describes like the position of first quantity task " this current detection reference position after " is the relative position relation of adjusting each task in the position said formation before of each task according to executing state.Imagine a kind of extreme case; The task number that comprises in the task queue is considerably beyond first quantity; Each all is waiting task for first quantity task of detect confirming to begin from the task of being arranged in primary importance through step S10, and wherein each task executions state all becomes " executed " after being processed.Therefore, the position of above-mentioned first quantity task is all adjusted according to pre-defined rule, is without loss of generality, and supposes that they are placed in the tail end of task queue.In other words, in the task queue shown in Figure 1 before primary importance to the second place task of a position all be adjusted to the tail end of task queue, and from the task of being positioned at the second place originally begin some in the back position of task by reach successively.
After the adjustment of completing place, the task of being arranged in the second place originally will be positioned at the primary importance of Fig. 1, so the detection reference position after the renewal is arranged in the primary importance of formation, promptly originally be positioned at the new position of the task of the second place.Preferably; If the current detection reference position has been positioned at the position, back of task queue; System can't find the position (because of it does not exist) of first quantity task after the current detection reference position, then can be with the head of the queue of task queue as new detection reference position.
It will be understood by those skilled in the art that in the above described manner and upgrade, can avoid having handled in the cycle in current detection in a large number of task is carried out duplicate detection detecting reference position.After the time cycle of waiting for a predetermined length, repeating step S10.
Be appreciated that through among the step S11 to position adjust of treated task in task queue can with current detection in the cycle executing state in the high task-set of the task of " accomplish " and occurrence frequency at the specific part of task queue.Through concentrating this specific part is detected afterwards, and detected waiting task is handled, can improve the execution efficient of system.If do not detect waiting task at this specific part, need to carry out the probability of task for processing in the cycle in current detection then less relatively in existence in the then whole task queue.At this moment, the time cycle of waiting for a predetermined length can be reduced detection taking system resource.
Below in conjunction with Fig. 3 and combine Fig. 4 that another preferred embodiment of the present invention is further described, wherein, Fig. 4 is the synoptic diagram according to the task queue of one embodiment of the present invention, to the description of said another preferred embodiment hypothesis based on following indefiniteness:
1) operating system of subscriber equipment is embedded system;
2) corresponding and continuous other subscriber equipment (promptly with between the current user equipment being connected the subscriber equipment that can exchange information, IP address that each subscriber equipment is corresponding unique) of this subscriber equipment of each task by effective communication link;
3) can comprise one or more incidents in a task, and this incident can be for sending data or receiving data by its other corresponding subscriber equipment to its other corresponding subscriber equipment;
4) under original state, all tasks in the task queue all are waiting task;
5) comprise 26 tasks of a-z as shown in Figure 4 in the task queue successively;
6) in a sense cycle, 4 tasks are detected (value of first quantity is 4);
7) operating system is single-threaded (promptly the value of second quantity is 1);
8) only comprise an incident in each task.
In step S10; At first task a, b, c and the d that is in the 1-4 of queue position detected; And a that sets the tasks, b, c be the waiting task in current detection cycle, then in step S11, earlier task a handled and accomplish execution, and therefore the executing state with task a is updated to " accomplishing "; And task a placed the end of task queue, promptly after the task z.Then task b is repeated aforesaid operations, the executing state with task b is updated to " accomplishing " equally, is placed on the end of task queue, promptly after the task a.
Then; Task c is repeated aforesaid operations, suppose task c for to its relative user equipment I transmission 500k data, and owing to the reason of network congestion; After the data transmission of accomplishing 50k, temporarily can't continue to carry out, then the executing state with task c is updated to " accomplishing ".And be placed on task queue foremost, promptly be positioned at before the d.Therefore, when the current detection end cycle, task queue four tasks foremost are followed successively by cdef, and four tasks of least significant end are as yzab (task b is last task of task queue).Because there is executing state in current detection in the cycle be the waiting task of " accomplishing ", therefore upgrading the detection reference position is the head of the queue of task queue.After accomplishing aforesaid operations, get into next sense cycle (, next sense cycle being defined as second sense cycle) at once for ease of describing.
In second sense cycle; To detecting 4 tasks of reference position (residing position task c this moment) beginning: task cdef detects; Wherein all tasks are the waiting task in current detection cycle, and then repeating step S11 and S12 handle it one by one.Suppose task c because network congestion still can't be carried out subsequent treatment, then this task is continued to place task queue foremost, task d and e are processed and accomplish execution, then are placed on tail of the queue, promptly after the task b.Suppose that task f sends Query Information to port II, and, then task f is placed head of the queue because network congestion can't be accomplished execution.Therefore, when second sense cycle finished, task queue four tasks foremost were followed successively by fcgh, and six tasks of least significant end are followed successively by yzabde (task b is last task of task queue).
In the 3rd sense cycle, fcgh detects to task.By that analogy, after a plurality of sense cycle, suppose that network recovery is unimpeded, then task f gets and accomplishes, and after completion, is placed in the afterbody of task queue; If port I still closes, then task c still is in the forward position of task queue, can obtain more machines meeting.
It will be appreciated by those skilled in the art that in the process of Network Transmission the breakpoint transmission of data block is sent and received and can not once accomplish is the multiple incident in the transmission course, also need be divided into a plurality of file fragmentations for the big data block of needs transmission and operate.Therefore, one is sent or corresponding other subscriber equipment that carries out data interaction with this subscriber equipment of reception incident, and one with this subscriber equipment carry out other subscriber equipment of data interaction often corresponding a plurality of transmissions or reception incident.Since between individual event and other user device IP address for concerning one to one; It will be apparent to those skilled in the art that; Through after a plurality of sense cycle, be adjusted to the forward position in the task queue at this subscriber equipment place with the mutual more pairing task of other subscriber equipment of this subscriber equipment.If detecting reference position is the head of the queue of task queue; Then can obtain the chance of processing more how to be detected, need not wait for that the scanning to all user device IP address can preferentially realize its data transmission with the mutual more corresponding task of other subscriber equipment of this subscriber equipment.And and the pairing task of other subscriber equipment of temporary transient no datat piece transmission between this subscriber equipment be placed in the end of task queue, promptly reduced priority.
Understand easily; Transmission network like network based on the point-to-point transmission agreement in; This subscriber equipment possibly link to each other with a plurality of other subscriber equipmenies, but maybe be only carries out data interaction (for example, send or receiver, video voice data) with several other subscriber equipmenies wherein in a certain particular moment.Through the position of adjustment task in formation; Can improve the pairing task of other subscriber equipment probability of handling to be detected that has data interaction with this subscriber equipment; Thereby the minimizing temporary file takies buffer memory, saves the time of detecting and waiting for, improves transmission of data blocks efficient simultaneously.
Below in conjunction with block diagram device part of the present invention is described.
Fig. 5 is the task execution device block diagram based on operating system according to an embodiment of the present invention.Followingly task execution device 1 provided by the invention is described with reference to Fig. 1.This task execution device 1 comprises pick-up unit 10, adjusting gear 11, control device 12 and waits for updating device 13.Suppose that primary importance shown in Fig. 1 is the current detection reference position, and first quantity is 8.It will be appreciated by those skilled in the art that said apparatus can be applied to include but not limited to personal computer (PC), the webserver, intelligent mobile terminal, STB or the like among any equipment based on operating system, below is example with PC.
Pick-up unit 10 among the PC detects 8 tasks that begin from the reference position of detection shown in Fig. 1, thereby knows whether the waiting task that needs processing is wherein arranged.Each task in the real time operating system can corresponding specific zone bit, and according to the difference setting of operating system, whether system can walk abreast or sequentially come these 8 tasks through the special sign position is that waiting task detects.
Concrete; System reserves certain storage space and stores whether be used to identify each task be the identification information of waiting task; Said identification information comprises a plurality of zone bits; And whether corresponding specific task to be detected of each zone bit wherein, its value of 1 or 0 be then to should task being waiting task.System comes at any time the perhaps value of the corresponding zone bit of regular update according to definition status, priority or other relevant informations of each task.For instance; Task for one-period property; It whenever promptly need be carried out once at a distance from a predetermined period, and for this reason, system will judge that whether over and done with this task carried out from last time an above-mentioned predetermined period through the surveillance clock; If judged result is " being ", then revise this task corresponding marker bit.
According to above-mentioned explanation, one of ordinary skill in the art will readily recognize that pick-up unit 10 can know in these 8 tasks whether the task for processing of needs is arranged through the corresponding zone bit that reads in the above-mentioned identification information.The ground that is without loss of generality supposes that zone bit is that 1 its corresponding task of expression is a waiting task, and zone bit is 0 expression corresponding task for being not (the current detection cycle) waiting task.Be appreciated that if the identification information that pick-up unit 10 reads is 0,000 1010, can know that then the 5th and the 7th task (being task A shown in Fig. 1 and task B) that begins from initial detection position is detected waiting task.Optional, read one by one through zone bit and can confirm that equally whether its corresponding task is waiting task, no longer gives an example here above-mentioned 8 tasks.For detected waiting task; Pick-up unit 10 can be set corresponding position and identify in its relevant information; " waiting task in this sense cycle " this identity with clear and definite this task certainly, is this purpose; Pick-up unit 10 also can be put into newly-built formation or array with the pointer of each above-mentioned waiting task, repeats no more here.Suppose, as shown in Figure 1, in the present embodiment through detecting, confirm that task A and task B are waiting task from detecting in 8 tasks that reference position begins.Pick-up unit 10 detects in first quantity task and has waiting task, and will to detect task A and task B be that the information of waiting task sends adjusting gear 11 to.
11 pairs of pick-up units of adjusting gear, 10 detected waiting task A and waiting task B handle.For ease of understanding, at first cite a plain example, wherein, second quantity is 1, also promptly, at one time, operating system is only handled individual task.In view of waiting task has two, adjusting gear 11 is handled task A earlier.Suppose that task A is: receive a data block from port one, the possibility of result after then it being handled is to have accomplished the reception (accomplishing) to this data block or temporarily can't carry out this data block is received (not accomplishing).It should be noted that after this no matter whether task A can be done through above-mentioned processing, it all will be regarded as treated task at the state of current detection in the cycle.
After task A carried out above-mentioned processing; Adjusting gear 11 also upgrades the executing state of task A; Concrete, its executing state being updated to " not accomplishing " from " not carrying out " perhaps " accomplishing ", this renewal process can realize through being provided with the corresponding relevant information of task A; This belongs to the mature technology that those skilled in the art understand, and repeats no more here.
If system has accomplished the operation that receives this data block from port one in this sense cycle, the executing state after then task A upgrades is " accomplishing ".Adjusting gear 11 comes the position of task A in this task queue adjusted according to executing state and the pre-defined rule after upgrading, and for example, is placed on A ' position as shown in Figure 1 in the task queue.Preferably, when the position of treated task is adjusted, can uncompleted each treated task be placed in task queue before completed each treated task.Preferred, can completed treated task be placed the tail of the queue of task queue according to the task executions state with the head of the queue of uncompleted each treated task as for task queue.Be appreciated that; Through above preferred implementation; Can be with in next sense cycle, needing the forward position that task for processing concentrates on formation badly; Processing mode of the prior art relatively can be saved the detection time that needs Processing tasks, has also reduced the wait as long for probability that incident causes.So far, adjusting gear 11 completion are to the processing of task A.
After adjusting gear 11 was accomplished the processing to task A, control device 12 judged whether that detected before this all waiting tasks all are processed (executing state after no matter it is handled why).If untreated waiting task still arranged then proceed to handle by adjusting gear 11.In this example, control device 12 knows that through judgement waiting task B handles as yet, is proceeded to handle by adjusting gear 11.Said judgement can be based on multiple existing techniques in realizing.For example, pick-up unit 10 is put into a memory block with the numerical value (being 2 in this example) of the quantity of waiting task, and every completion just subtracts one with the numerical value in this memory block to a task handling, is the processing of 0 completion to all waiting tasks until this numerical value.Prior art has multiple ripe support scheme to said judgement, here specifically citation no longer one by one.
Suppose that task B is: send one group of data to port 2, but, fail to accomplish execution to task B at current detection cycle middle regulator 11 owing to reasons such as network congestion or port 2 temporary closes.According to the elaboration of front, adjusting gear 11 can be regarded as treated task with task B, and its executing state is not updated to " accomplishing " from " carrying out ", and task B is put into the position of task queue B ' according to the executing state after this renewal.Wherein the particular location of B ' is confirmed by the preset rules of system, for example, hope is detected the forward position that task for processing places formation as early as possible once more, need not frequent task to be detected and places the back position of leaning on of task queue.
Task B after treatment, control device 12 judges whether that through step S12 all waiting tasks (A, B) all are processed, if all accomplish, then finish the operation in current detection cycle once more.Preferably, monitoring device 10 carries out detecting operation next time immediately, begins a new sense cycle.A lot of existing operating systems can be supported the parallel processing to a plurality of tasks.Therefore, it will be understood by those skilled in the art that what mention among this paper can be a plurality of by the task number of adjusting gear 11 executed in parallel (i.e. " second quantity ") at one time.For example, can handle waiting task A in this example and waiting task B simultaneously based on the windows XP task scheduling system of double-core or multinuclear, in the case, the value of second quantity is 2.Consideration takies and the requirement of multiple factor such as speed system resource, can the adjusting of this second quantity through the software program setting, and not only by the Hardware configuration decision of system.
Adjusting gear 11 is carried out the value of second quantity task and second quantity simultaneously greater than under 1 the situation; Adjusting gear 11 can be in handling second quantity task each after, the executing state after upgrading according to this task is immediately adjusted the position of this task in task queue.Also can handle and upgrade its executing state separately earlier to second quantity task; By the time after all tasks in second quantity task all being accomplished the operation of handling with the executing state renewal, come its position to adjust respectively according to the executing state after each the renewal in this second quantity task again.Be to be understood that; Owing to have a plurality of tasks in the task queue; And core concept of the present invention is according to each its position in task queue of task executions state adjustment; Therefore, the ordinal relation in the present embodiment between related each step only to specific embodiment, does not constitute the qualification to protection domain of the present invention.
More than, be that the supposition of waiting task is introduced this method based on task A among Fig. 1 and task B.And if comprise all non-waiting task of above-mentioned 8 tasks of task A, B, then pick-up unit 10 detects after preferably waiting for time of certain-length next time.
Below, refer again to Fig. 5 and combine Fig. 1 that a modification of above-mentioned embodiment is done concise and to the point description.Wherein control device 12 also comprises control updating device 120.
Total task number of supposing to exist in the task queue also promptly, can't intactly scan whole task queue in each sense cycle greater than first quantity.So, in control device 12 through judge learn first quantity task handling has been all over after, task execution device 1 also possibly detect and handle all the other tasks in the task queue.Wherein a kind of optional mode; Be exactly after each sense cycle; Pick-up unit 10 detects reference position according to certain Policy Updates; And first quantity task that in next sense cycle, the detection reference position after upgrade is begun detects, and carries out follow-up each procedure of corresponding each item then.After the detection and processing of the first quantity task of accomplishing the current detection cycle, control updating device 120 defines again and detects reference position, begins the next cycle of treatment that detects again.Cooperate relevant detection reference position update rule, use the task executing method mechanism of this this kind circular treatment can adjust in the formation each task to be detected with the probability of carrying out, help the reasonable distribution of system process time quota.
For instance, suppose that still task queue is as shown in Figure 1, the detection reference position in current detection cycle is a primary importance.After the processing of each waiting task in first quantity task that primary importance is begun had been accomplished in control device 12 judgements, 120 pairs of control updating devices detected reference position and upgrade.The renewal of said detection position can be passed through accomplished in many ways, for instance, can task queue be stored with the form of array, wherein an element in the corresponding array of each task.The pointer of corresponding each task is stored in array successively, and specifies the corresponding element that detects reference position in the independent pointed array.In each sense cycle; First quantity positions of elements behind current this pointer corresponding element of the pointed that this is independent (the detection reference position in current detection cycle), and with this position as the detection reference position (being the second place among Fig. 1) after upgrading.It will be understood by those skilled in the art that the not unique correspondence of detection reference position after the renewal, can adjust flexibly upgrading the rule that detects reference position according to the designing requirement of system.Preferably and since according to the present invention current detection in the cycle uncompleted treated task will concentrate on task queue than front end, therefore can be with detecting the head of the queue that reference position be updated to task queue.So far, control updating device 120 is accomplished detecting the renewal of reference position.
After control updating device 120 was accomplished the renewal that detects reference position, the task that 10 pairs of second places of pick-up unit begin detected processing.
Preferably; If do not have waiting task in current detection first quantity task that pick-up unit 10 detects in the cycle; Then control 120 pairs of detections of updating device reference position and upgrade, pick-up unit 10 detects the task in the task queue again after the time cycle of waiting for a predetermined length.Below in conjunction with Fig. 5 and with reference to Fig. 1 the preferred embodiment is described further.
Suppose that the primary importance among Fig. 1 is the detection reference position.Pick-up unit 10 detects first quantity task that begins from the task of being arranged in primary importance and whether comprises waiting task.
If pick-up unit 10 detects waiting task, then 11 pairs of waiting tasks of adjusting gear are done further processing, repeat no more here.
If wherein do not comprise waiting task, then wait for the time cycle of a predetermined length of updating device 13 control waits.Concrete; Can be the number of system clock cycle (system clock) accordingly with it with the length transition of the time cycle of need waiting for; And this numerical value is kept in the memory block; Each new clock period subtracts 1 with this numerical value later, when this numerical value is reduced to 0, begins next sense cycle.Certainly, also can utilize the timer of system to keep or jump out above-mentioned waiting status.In view of the technological means well-known to those skilled in the art that is set to, no longer add among this paper to describe to time cycle of predetermined length.
Preferably; Wait for that updating device 13 can also upgrade detecting reference position; With the detection reference position of the residing position of first quantity task after the task on the current detection reference position as next sense cycle; That is, the position of task is used as the detection reference position in the next sense cycle on the second place among Fig. 1.
What it should be noted that foregoing describes like the position of first quantity task " this current detection reference position after " is the relative position relation of adjusting each task in the position said formation before of each task according to executing state.Imagine a kind of extreme case; The task number that comprises in the task queue is considerably beyond first quantity; Each all is a waiting task to detect first quantity task confirming to begin from the task of being arranged in primary importance through pick-up unit 10, and wherein each task executions state all becomes " executed " after by adjusting gear 11 processing.
Therefore, the position of above-mentioned first quantity task is all adjusted by adjusting gear 11 according to pre-defined rule, is without loss of generality, and supposes that they are placed in the tail end of task queue.In other words, in the task queue shown in Figure 1 before primary importance to the second place task of a position all be adjusted to the tail end of task queue, and from the task of being positioned at the second place originally begin some in the back position of task by reach successively.
After the adjustment of completing place, the task of being arranged in the second place originally will be positioned at the primary importance of Fig. 1, so the detection reference position after the renewal is arranged in the primary importance of formation, promptly originally be positioned at the new position of the task of the second place.Preferably; If the current detection reference position has been positioned at the position, back of task queue; Wait for that updating device 13 can't find the position (because of it does not exist) of first quantity task after the current detection reference position, then can be with the head of the queue of task queue as new detection reference position.
It will be understood by those skilled in the art that in the above described manner and upgrade, can avoid having handled in the cycle in current detection in a large number of task is carried out duplicate detection detecting reference position.After the time cycle of waiting for a predetermined length, repeating step S10.
Be appreciated that through position adjust of 11 pairs of treated tasks of adjusting gear in task queue can with current detection in the cycle executing state in the high task-set of the task of " accomplish " and occurrence frequency at the specific part of task queue.Concentrate through pick-up unit 10 afterwards this specific part is detected, and detected waiting task is handled, can improve the execution efficient of system.If do not detect waiting task at this specific part, need to carry out the probability of task for processing in the cycle in current detection then less relatively in existence in the then whole task queue.At this moment, the time cycle of waiting for a predetermined length can be reduced detection taking system resource.
Below in conjunction with Fig. 5 and with reference to Fig. 4 another preferred embodiment of the present invention is further described; Wherein, Fig. 5 is the task execution device block diagram according to one embodiment of the present invention; Fig. 4 is the synoptic diagram of the task queue of an embodiment according to the present invention, and the following description of above-mentioned another preferred embodiment is based on the hypothesis of following indefiniteness:
1) operating system of subscriber equipment is embedded system;
2) corresponding and continuous other subscriber equipment (promptly with between the current user equipment being connected the subscriber equipment that can exchange information, IP address that each subscriber equipment is corresponding unique) of this subscriber equipment of each task by effective communication link;
3) can comprise one or more incidents in a task, and this incident can be for sending data or receiving data by its other corresponding subscriber equipment to its other corresponding subscriber equipment;
4) under original state, all tasks in the task queue all are waiting task;
5) comprise 26 tasks of a-z as shown in Figure 4 in the task queue successively;
6) in a sense cycle, 4 tasks are detected (value of first quantity is 4);
7) operating system is single-threaded (promptly the value of second quantity is 1);
8) only comprise an incident in each task.
At first, task a, b, c and d that 10 pairs of pick-up units are in the 1-4 of queue position detect, and a that sets the tasks, b, c are the waiting task in current detection cycle.Then, execution is handled and accomplished to adjusting gear 11 to task a earlier, and therefore the executing state with task a is updated to " accomplishing ", and task a is placed the end of task queue, promptly after the task z.Know that through control device being still waiting Processing tasks is not processed then, then 11 couples of task b of adjusting gear repeat aforesaid operations, and the executing state with task b is updated to " accomplishing " equally, is placed on the end of task queue, promptly after the task a.
Then; The 1 couple of task c of task execution device repeats aforesaid operations, suppose task c for to its relative user equipment I transmission 500k data, and owing to the reason of network congestion; After the data transmission of accomplishing 50k, temporarily can't continue to carry out, then the executing state with task c is updated to " accomplishing ".And be placed on task queue foremost, promptly be positioned at before the d.Therefore, when the current detection end cycle, task queue four tasks foremost are followed successively by cdef, and four tasks of least significant end are as yzab (task b is last task of task queue).Because there is executing state in current detection in the cycle be the waiting task of " accomplishing ", therefore upgrading the detection reference position is the head of the queue of task queue.After accomplishing aforesaid operations, get into next sense cycle (, next sense cycle being defined as second sense cycle) at once for ease of describing.
In second sense cycle; 10 pairs of pick-up units detect 4 tasks of reference position (residing position task c this moment) beginning: task cdef detects; Wherein all tasks are the waiting task in current detection cycle, and then adjusting gear 11 and control device 12 are handled it one by one.Suppose task c because network congestion still can't be carried out subsequent treatment, then this task is continued to place task queue foremost, task d and e are processed and accomplish execution, then are placed on tail of the queue, promptly after the task b.Suppose that task f sends Query Information to port II, and, then task f is placed head of the queue because network congestion can't be accomplished execution.Therefore, when second sense cycle finished, task queue four tasks foremost were followed successively by fcgh, and six tasks of least significant end are followed successively by yzabde (task b is last task of task queue).
In the 3rd sense cycle, 10 couples of task fcgh of pick-up unit detect.By that analogy, after a plurality of sense cycle, suppose that network recovery is unimpeded, then task f gets and accomplishes, and after completion, is placed in the afterbody of task queue; If port I still closes, then task c still is in the forward position of task queue, can obtain more machines meeting.
It will be appreciated by those skilled in the art that in the process of Network Transmission the breakpoint transmission of data block is sent and received and can not once accomplish is the multiple incident in the transmission course, also need be divided into a plurality of file fragmentations for the big data block of needs transmission and operate.Therefore, one is sent or corresponding other subscriber equipment that carries out data interaction with this subscriber equipment of reception incident, and one with this subscriber equipment carry out other subscriber equipment of data interaction often corresponding a plurality of transmissions or reception incident.Since between individual event and other user device IP address for concerning one to one; It will be apparent to those skilled in the art that; Through after a plurality of sense cycle, be adjusted to the forward position in the task queue at this subscriber equipment place with the mutual more pairing task of other subscriber equipment of this subscriber equipment.If detecting reference position is the head of the queue of task queue; Then can obtain the chance of processing more how to be detected, need not wait for that the scanning to all user device IP address can preferentially realize its data transmission with the mutual more corresponding task of other subscriber equipment of this subscriber equipment.And and the pairing task of other subscriber equipment of temporary transient no datat piece transmission between this subscriber equipment be placed in the end of task queue, promptly reduced priority.
Understand easily; Transmission network like network based on the point-to-point transmission agreement in; This subscriber equipment possibly link to each other with a plurality of other subscriber equipmenies, but maybe be only carries out data interaction (for example, send or receiver, video voice data) with several other subscriber equipmenies wherein in a certain particular moment.Through the position of adjustment task in formation; Can improve the pairing task of other subscriber equipment probability of handling to be detected that has data interaction with this subscriber equipment; Thereby the minimizing temporary file takies buffer memory, saves the time of detecting and waiting for, improves transmission of data blocks efficient simultaneously.
More than specific embodiment of the present invention is described.It will be appreciated that the present invention is not limited to above-mentioned specific implementations, those skilled in the art can make various distortion or modification within the scope of the appended claims.
Claims (12)
1. task executing method based on operating system wherein, may further comprise the steps:
A. detect since first quantity task of the detection reference position of a task queue and whether comprise one or more waiting tasks;
If comprise one or more waiting tasks in b. said first quantity task; Then second quantity waiting task in said one or more waiting tasks is handled; To obtain second a quantity treated task; And adjust its position in said task queue according to said each treated task executions state; So that hope to be detected the forward position that task for processing is positioned at said task queue as early as possible once more, need not frequent task to be detected and be positioned at the back position of leaning on of said task queue;
C. judge whether that said one or more waiting task all handles,, then repeat said step b if untreated waiting task is arranged.
2. method according to claim 1 is characterized in that, said step c also comprises:
-all handle when said one or more waiting tasks, upgrade said detection reference position and repeat said step a.
3. method according to claim 2 is characterized in that, also comprises after the said step a:
If do not comprise one or more waiting tasks in first quantity task that the detection reference position of-said task queue begins; After then waiting for the time cycle of a predetermined length; With the position of first quantity task after the said detection reference position as new detection reference position, repeating said steps a.
4. according to each described method among the claim 1-3, it is characterized in that said step b also comprises:
-according to said each treated task executions state uncompleted each treated task is placed the head of the queue of said task queue, completed each treated task is placed the end of said task queue.
5. according to each described method among the claim 1-3, it is characterized in that said detection reference position is fixed and is set to the head of the queue of said task queue.
6. according to each described method among the claim 1-3, it is characterized in that said operating system is embedded system.
7. the task execution device based on operating system is characterized in that, comprising:
Pick-up unit is used for detecting since first quantity task of the detection reference position of a task queue whether comprise one or more waiting tasks;
Adjusting gear; If comprise one or more waiting tasks in said first quantity task; Then said adjusting gear is used for second quantity waiting task of said one or more waiting tasks is handled; To obtain second a quantity treated task; And adjust its position in said task queue according to said each treated task executions state, so that hope to be detected the forward position that task for processing is positioned at said task queue as early as possible once more, what need not that frequent task to be detected is positioned at said task queue leans on the position, back;
Control device is used to judge whether that said one or more waiting task all handles, if untreated waiting task is arranged, then controls said adjusting gear said untreated waiting task is operated.
8. task execution device according to claim 7 is characterized in that, said control device also comprises the control updating device:
Said control updating device is used for when said one or more waiting tasks have all been handled, upgrade said detection reference position, and the control detection device being operated.
9. task execution device according to claim 8 is characterized in that, also comprises the wait updating device:
When said wait updating device is used for first quantity task that the detection reference position in said task queue begins and does not comprise one or more waiting task; After waiting for the time cycle of a predetermined length; As new detection reference position, and the control detection device is operated with the position of first quantity task after the said detection reference position.
10. according to each described task execution device among the claim 7-9; It is characterized in that; Said adjusting gear also is used for according to said each treated task executions state completed each treated task being placed the end of said task queue, and uncompleted each treated task is placed the head of the queue of said task queue.
11., it is characterized in that said detection reference position is fixed and is set to the head of the queue of said task queue according to each described task execution device among the claim 7-9.
12., it is characterized in that said operating system is embedded system according to each described task execution device among the claim 7-9.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 200810036120 CN101561767B (en) | 2008-04-16 | 2008-04-16 | Method and device for executing tasks based on operating system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 200810036120 CN101561767B (en) | 2008-04-16 | 2008-04-16 | Method and device for executing tasks based on operating system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101561767A CN101561767A (en) | 2009-10-21 |
| CN101561767B true CN101561767B (en) | 2012-06-06 |
Family
ID=41220579
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 200810036120 Expired - Fee Related CN101561767B (en) | 2008-04-16 | 2008-04-16 | Method and device for executing tasks based on operating system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101561767B (en) |
Families Citing this family (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102279730B (en) * | 2010-06-10 | 2014-02-05 | 阿里巴巴集团控股有限公司 | Parallel data processing method, device and system |
| CN103034475B (en) * | 2011-10-08 | 2015-11-25 | 中国移动通信集团四川有限公司 | Distributed Parallel Computing method, Apparatus and system |
| CN108021439B (en) * | 2016-10-31 | 2022-07-15 | 阿里巴巴集团控股有限公司 | Task polling method, task arrangement method and related device |
| CN107104822B (en) * | 2017-03-29 | 2020-09-08 | 恒生电子股份有限公司 | Server disaster recovery processing method and device, storage medium and electronic equipment |
| CN107370639A (en) * | 2017-08-14 | 2017-11-21 | 苏州众天力信息科技有限公司 | A kind of more scenery control methods of gateway based on trapezoidal temporal algorithm |
| CN108009022A (en) * | 2017-11-06 | 2018-05-08 | 联动优势科技有限公司 | A kind of message treatment method and server |
| CN113806042B (en) * | 2021-08-25 | 2023-06-16 | 北京市遥感信息研究所 | Task scheduling method of multi-core real-time embedded system |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1519735A (en) * | 2003-01-24 | 2004-08-11 | 深圳市中兴通讯股份有限公司 | Process scheduling method in embedded type real time operating system |
| CN1801101A (en) * | 2006-01-17 | 2006-07-12 | 浙江大学 | Thread implementation and thread state switching method in Java operation system |
-
2008
- 2008-04-16 CN CN 200810036120 patent/CN101561767B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1519735A (en) * | 2003-01-24 | 2004-08-11 | 深圳市中兴通讯股份有限公司 | Process scheduling method in embedded type real time operating system |
| CN1801101A (en) * | 2006-01-17 | 2006-07-12 | 浙江大学 | Thread implementation and thread state switching method in Java operation system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101561767A (en) | 2009-10-21 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101561767B (en) | Method and device for executing tasks based on operating system | |
| CN103346974B (en) | Controlling method of service process and network device | |
| CN101211277B (en) | Method of selecting one of execution schedules of guest OS and virtual machine monitor employing the method | |
| CN103532823A (en) | Message processing method, device and system for Internet of Things | |
| WO2020052322A1 (en) | Data processing method, device and computing node | |
| CN101135981A (en) | Method and device for realizing batch report generation | |
| CN100547983C (en) | Utilize orderly locking mechanisms to safeguard the order of the project such as grouping | |
| CN105657000A (en) | Message transmission method and device | |
| CN103346980A (en) | Method and device for service dispatching and network equipment | |
| CN111722944B (en) | NIO-based AIRT-ROS communication method and system | |
| CN105871568B (en) | Software upgrading method and system | |
| CN105468682B (en) | A kind of event scheduling system | |
| US8037160B2 (en) | Method and device arrangement for managing a user application/device management server/client device environment | |
| CN102760073A (en) | Method, system and device for scheduling task | |
| CN108509257B (en) | Message processing method and device based on multithreading | |
| CN112000019A (en) | Method, device and equipment for sharing equipment instruction control | |
| CN101635639B (en) | Network connection tracing method and system thereof | |
| US11275621B2 (en) | Device and method for selecting tasks and/or processor cores to execute processing jobs that run a machine | |
| CN101502149B (en) | A network managing system for completing customized operation automatically and a method thereof | |
| CN100527693C (en) | Data transfer to nodes of a communication network using self-replicating code | |
| US20170142227A1 (en) | Data processing apparatus and data processing method | |
| CN101320443A (en) | Electronic work order processing method and device | |
| CN112714181A (en) | Data transmission method and device | |
| CN102339027A (en) | Network asynchronous callback-based distributed upper computer control method and device for programmable logic controller (PLC) equipment | |
| CN111309467A (en) | Task distribution method and device, electronic equipment and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20120606 Termination date: 20200416 |