CN100505811C - Multiple binary tree cycle timer scheduling method - Google Patents
Multiple binary tree cycle timer scheduling method Download PDFInfo
- Publication number
- CN100505811C CN100505811C CNB2003101071063A CN200310107106A CN100505811C CN 100505811 C CN100505811 C CN 100505811C CN B2003101071063 A CNB2003101071063 A CN B2003101071063A CN 200310107106 A CN200310107106 A CN 200310107106A CN 100505811 C CN100505811 C CN 100505811C
- Authority
- CN
- China
- Prior art keywords
- timer
- tree
- node
- binary tree
- new
- 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
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention is a multiple binary-tree circulating timer planning method, organizing timers in many lists, where each list is a binary tree, each node on it corresponds to each timer in the system; the circulating scanning system corresponds to a multiple binary-tree structure with times; when a new timer is to be inserted in the system, firstly calculate the binary tree where the new timer should be inserted; then begin with a root node of the binary tree, along its right subtree, compare the timing value of the root node with that of the new timer timing the node, accordingly determine the insertion position of the new timer; compared with existing techniques, it carries forward the advantage of fast scanning of a difference timer planning method and at the same time, absorbs the character of fast inserting of a classification timer planning method. It can makes high-efficiency new timer inserting even though there are a large number of timers in the system, and it is a good universal timer planning method.
Description
Technical field
The present invention relates to the scheduling method for timer of computer software technical field, especially a kind of in communication access server field, the dispatching method of the many timers when being used to handle multi-user's access service.
Background technology
Timer and to the processing of timed events is a common technology in the develop computer software, and particularly in system support software, the utilization rate of this type of technology is the highest.Under a lot of situations, often have several ten thousand even a hundreds of thousands timer in the system, how to dispatch timer efficiently, thereby be the key that improves support programs performance raising whole software systematic function.
In the prior art, scheduling method for timer commonly used mainly contains following several:
1. poll timer dispatching method
Poll timer dispatching method is generally used for only existing in the system under the situation of a small amount of timer, as shown in Figure 1, the little square frame of among the figure each is represented a timer, this method is with all timer queue scannings one time in each timing cycle, then, subtracted one the remaining time of each timer, look at whether timer expiry is arranged, and trigger wherein overtime timer.Obviously, this method is under the very short condition of timing cycle, and the timer quantity that can scan is very limited.
2. differential timing device scheduling method
Differential timing device scheduling method is that timer is lined up a long-chain according to constantly sequencing then, each timer only write down oneself then constantly with last timer time difference of time then, as Fig. 2 institute.Show and utilize this method to judge whether timer expiry, first timer that only needs to judge begin chain gets final product, therefore, almost do not scan expense, still, if will insert a timer, just need the whole chained list of traversal, if run under large numbers of situations of timer in the chained list, insertion process can be very slow, especially under the very frequent situation of insert action.Therefore, this scheme only is suitable for the timer enormous amount, uses but insert and delete under the not frequent situation of action.
3. classification timer dispatching method
Classification timer dispatching method is that timer is classified according to length of timer, chained list of each class timer structure, as shown in Figure 3.Wherein, timer is constructed a, b, three chained lists of c respectively according to timing length 20t, 30t, 40t, when having judged whether timer expiry, only needed first timer in each timing cycle interscan timer chain meter to get final product.Owing to have only a kind of timing time delay in each chained list, therefore, new timer also can directly insert the afterbody of its affiliated timer class chain.This method had both been utilized the advantage of differential timing device dispatching method, simultaneously again at the particularity of system, had overcome differential timing device dispatching method and had inserted inefficient shortcoming.But also can learn by above description, when timer duration kind seldom the time, very high, too much but it can not deal with the timer duration kind, the perhaps variable situation of this method efficient.
4. by the dispatching method of 2 power power classification timer
China Intellectual Property Office's publication number is 1366416 patent " a kind of scheduling method for timer ", is exactly this scheduling method for timer.It is a kind of improvement project of classification scheduling method for timer, and it presses duration 1,2,2 with timer
2..., 2
kBe divided into the K+1 class, identical to the operation of every class timer chain with the classification scheduling method for timer.Be the timer of 2 power power for duration, directly be inserted into corresponding timer class chain; If length of timer is not 2 power power, just this timer is split into a plurality of 2 power power and, then, subitem that earlier will high order power inserts corresponding timer class chain, after waiting this subitem overtime, again the subitem of the high order power in the remaining subitem is inserted the respective class chain, the rest may be inferred, when all subitems all were inserted into and are overtime, this timer was also just overtime.As shown in Figure 4, k=7 has 8 chained lists, and the duration classification is 2
0, 2
1, 2
2, 2
3, 2
4, 2
5, 2
6With 2
7For example, be 23 timer for duration, be split as 23=2
4+ 2
2+ 2
1+ 2
0, at first this timer is inserted into 2
4The afterbody of chain behind 16 timing cycles, inserts 2 with this timer again once more
2The afterbody of chain waits after 4 timing cycles again, once more this timer is inserted 2
1The afterbody of chain after continuing to wait 2 timing cycles, inserts 2 with this timer at last
0The afterbody of chain, wait a timing cycle after, this timer expiry triggers.This scheduling method for timer has effectively solved in the classification timer dispatching method can not be fit to the difficult problem of random length timer, but has also introduced some other problems:
1) if the k value is bigger, then too much at the chain of each timing cycle interscan, thus cause operating efficiency to reduce.
2) on the other hand, after each class timer chain begin chain duration is subtracted into 0, also will all do once each timer on the chain and compare, judge whether the timer expiry of its representative, if not overtime, reset corresponding timer at other chain again, efficient is lower.
3) be not the timer of 2 power power to each, also will split into 2 power power item sum, this also needs certain overhead.
Therefore, this method is suitable for the timer that duration is 2 power power, and timing cycle can not lack, otherwise the scanning expense is too big.
Existing from above several timer dispatching method as can be seen, timer dispatching mainly solves following several problem:
1. timing cycle is generally very short, therefore require the scanning of each timing cycle to want fast, otherwise overhead is too big;
2. the insertion efficient of new timer wants high, but can not influence scanning, otherwise also can reduce dispatching efficiency;
3. dispatching method will have versatility, is fit to the timer of various durations.
Above in the described existing scheduling method for timer, polling method scanning is all unhappy with insertion, calculus of finite differences scanning is fast inserts slowly, it is slow and not general that classification is inserted short scan, it is slow that 2 power time method is inserted short scan, therefore, providing a kind of scheduling method for timer that can comprehensively solve above-mentioned three aspect problems, is present this area letter problem to be solved.
Summary of the invention
Purpose of the present invention is just in order to solve the problem that exists in the existing various scheduling method for timer, and provide a kind of scheduling method for timer, this method adopts many binary trees cycle timer dispatching method, timer is organized in a plurality of chained lists, and each chained list is a binary tree, thereby about the effective ways of three problems of timer dispatching, make timer dispatching efficient, reliable and have a versatility above can effectively solving.
The invention provides a kind of many binary trees cycle timer dispatching method, it is characterized in that the method includes the steps of:
The composition of many y-bends number timer construction:
Timer in the system is organized into N chained list, and the structure of each chained list is a binary tree;
Each timer in the corresponding system of each node on the binary tree;
The timing length that timer on the left subtree of each node is set equates with the timing length of father node;
The timing length of the timing length of the timer on the right subtree of each node greater than father node is set.
Timer combination carrying out scan round to whole many binary tree structures:
Circulating scanning system is corresponding to multiple binary-tree structure with times;
Only scan a tree, scanning next time is one tree down at every turn;
The timing value of the tree root of these many binary tree structures done subtract 1 operation, if be 0 after the timing value of the tree root of these many binary trees subtracts 1, then the timer expiry on the tree root of these many binary trees and its left subtree from these many these timers of binary tree deletion, and triggers these timers;
In many binary trees timer construction, insert new timer:
When having new timer W to insert in the system,,, calculate the binary tree L that the timer W that makes new advances should insert according to formula L=(P+ (T1 Mod N)) Mod N according to the total N of the timing length T1 of this timer, current scanning position P, binary tree;
According to formula T2=T1/N+1, the timer that must make new advances is the timing value T2 of node regularly;
From the root node H of the binary tree L that should insert new timer, along its right subtree, the timing value of the root node H of binary tree L and the new timer timing value T2 of node regularly relatively determines the insertion position of new timer.
The present invention is when having inherited differential timing device dispatching method and having scanned fast advantage, also draw the classification scheduling method for timer and inserted fast characteristics, it is the best scheduling method for timer of scan efficiency, and can be implemented in when having a large amount of timers to exist in the system, efficient new timer, the scheduling method for timer of inserting with good versatility.
Description of drawings
Fig. 1 is the block diagram of poll timer dispatching method of the prior art;
Fig. 2 is the block diagram of differential timing device scheduling method of the prior art;
Fig. 3 is the block diagram of classification timer dispatching method of the prior art;
Fig. 4 is the block diagram by 2 power power classification scheduling method for timer of the prior art;
Fig. 5 is the block diagram of many binary trees cycle timer dispatching method of the present invention;
Fig. 6 is an overview flow chart of the present invention;
Fig. 7 is a scanning flow chart of the present invention;
Fig. 8 is the operational flowchart of the new timer of insertion of the present invention.
Embodiment
The scheduling method for timer that the present invention proposes is a kind of many binary trees cycle timer dispatching method, and timer is organized in a plurality of chained lists, and the structure of each chained list is a binary tree, and each node of binary tree is represented a timer.Then, adopt periodic scan method that a plurality of chained lists are scanned, concrete scan method is at each timing cycle, only scans a chained list, and next timing cycle just scans next chained list, and identical with calculus of finite differences, only begin chain is subtracted 1 operation.Being organized into the purpose of multichain, is to improve insertion speed.As shown in Figure 5, have 64 binary trees in the legend, each timing cycle only scans one tree, since the 0th binary tree, scan the 1st, 2 successively ..., up to the 63rd tree, get back to the 0th tree then again, restart the next round circulation.
As shown in Figure 6, the specific implementation flow process of many binary trees cycle timer dispatching method is divided into three parts: promptly the tissue of many binary trees timer construction, insert flow process and scanning flow process, these three flow processs may further comprise the steps respectively:
1) tissue of many binary trees timer construction
Timer in the system is organized in N the chained list, and the structure of each chained list is a binary tree, and the numbering of each binary tree is respectively 0,1 ..., N-1.Each node on the binary tree is a timer, and the timing length of the timer on the left subtree of each node equates that with the timing length of father node the timing length of the timer on the right subtree of each node is greater than the timing length of father node.
2) scanning flow process
The first step is determined scanning position.At each timing cycle, system only scans a binary tree P, and the initial value of establishing P is 0.Adopt periodic scan method, scan tree P after, the value of modification P makes current scan pointer change, that is: P=(P+1) Mod N, wherein Mod: modular arithmetic.The span of P is 0,1 ..., N-1.
Second step, scan operation.During scanning, only check the root node timer on the binary tree P, and the timing value of depositing in this node is subtracted 1; After the root node timing value of P subtracted 1, if become 0, just from the deletion of P tree this its tree root and left subtree thereof, this moment, the right subtree of P tree became a new binary tree, and deleted timer node is an overtime timer, triggers these timers.
More than the concrete steps of scanning flow process are referring to shown in Figure 7.
As shown in Figure 7, the concrete steps of scanning flow process are as follows: establish current scanning binary tree be numbered P, wherein P can be 0 ..., N-1, wherein N is the number of the binary tree in many binary trees timer construction proposed by the invention, and to establish the current timing value of P tree tree root be t, step 701; This timing value is done to subtract 1 operation, i.e. t=t-1, step 702; Whether judge the t value greater than 0, step 703; As not, then the tree root of P tree and the timer expiry of the node on its left subtree trigger these timers, step 704; Set tree root and its left subtree that cuts off P, step 705 from P; The right subtree that is the tree root of P tree becomes new P tree, step 706; Change current scan pointer, even P=(P+1) Mod is N, wherein Mod is a modulo operation, step 707.
3) committed step of insertion flow process
The first step, determine binary tree and timing value thereof that new timer need insert: when new timer W inserts, total N according to the timing length T1 of W, current scanning position P, binary tree, according to formula L=(P+ (T1 Mod N)) Mod N, calculate the tree L that W should insert, and according to formula T2=T1/N+ 1, calculate in the L tree, W is the timing value T2 of node regularly.
In second step, determine the insertion position in the binary tree that new timer locatees in above-mentioned steps:,,, determine the insertion position of W in L according to the method for timing value relatively along the right subtree of L from the root node H of above-mentioned L tree.
As shown in Figure 8, be insertion flow process of the present invention, this flow process may further comprise the steps:
If the duration of new timer W is T1, P (0 ..., N-1) be the binary tree numbering of current scanning, (this moment system in total N binary tree), step 801; According to the total N of the timing length T1 of W, current scanning position P, binary tree,, calculate the tree L that W should insert according to formula L=(P+ (T1 Mod N)) Mod N, and according to formula T2=T1/N+1, calculate in the L tree, W is the timing value T2 of node regularly, step 802; If H is the tree root of binary tree L, T2 then deducts the timing value of tree root H for the timing value T2 of the timing node of the new timer W that will insert, i.e. the timing value of T2=T2-H, step 803; Whether the value of judging the T2 during previous step suddenly is greater than 0, and tree root H has right subtree, step 804; As satisfy this condition, and if then H has right subtree, the timing value of T2=T2-H, the root node of the right subtree of H=H, step 805; And return the condition judgment that step 804 pair new H value and T2 value are carried out this step again, if tree root H does not have right subtree, judge that then whether the T2 value is greater than 0, step 806 as not, shows that then timing value among the H is greater than T2, W is inserted as the root node of the left subtree of H, the former left subtree of H becomes the left subtree of W, and the timing value of this new node is 0, step 807; Otherwise, W is inserted as the root node of the right subtree of H, timing value is T2, step 808; Finish the insertion flow process thus.
In inserting flow process, need choose a suitable N value, the method scanning that the present invention is proposed is fast, inserts the efficient height of new timer.Setting up departments can have S timer at most in the system, and the mean value of the timer on each binary tree is S/N, and when inserting so, on average number of comparisons is (S/N)/2.If a lot of the timers that equate are arranged again on each binary tree, then these timers are concentrated on the left subtree, and then inserting number of times relatively can be still less.In a word, adopt this scheduling method for timer, aspect two of timers of insertion, very high efficient is arranged all, and this method is suitable for any timer dispatching demand, have versatility in scanning.
The selection of N value can be determined according to the size of the total S of timer in the system, Installed System Memory and timing cycle etc.The N value is big more, insert fast more, but committed memory is big more.The N value is more little, inserts slow more.When N equals 1, just become approximate differential timing device dispatching method.In theory, the value of N can be between 1 to S, but considers the situation of memory source, and the number Q of system's maximum timer that can trigger simultaneously, and it is comparatively suitable that N gets the S/Q value.
Below by description to a specific embodiment, further specify technical scheme of the present invention, and data by experiment, beneficial effect of the present invention is described:
In the WAND plate of ZTE ZXDSL8220 ADSL local side apparatus a built-in BNAS is arranged, its design object is that multipotency inserts 2048 of users simultaneously.The designed software system requirements, for the user of each access, BNAS can the perception user be disconnection with BNAS or be connected in 10 seconds.In order to reach this design object, the method for at first expecting is to adopt the timer technology.And since each insert user all be one independently individual, time of rolling off the production line not is what fix on it, at this situation, adopt the timer control technology be the simplest, also be the easiest control technology.But, when design, can not adopt the timer control technology to realize to whole connecting system again, adopt the timer control technology to realize and must insert the user to each.And in the connecting system, under full user's situation, if adopt the timer technology, system has 2048 timers at least, for the some other access control that realizes each is inserted the user, under worst case, can there be 5*2048 timer in system at most simultaneously.In addition, increase the number that inserts the user if desired again, so, the timer in the system also can significantly increase.So, must find a kind of management algorithm efficiently, otherwise, do not reach the design object of system.Among the design, just adopt the scheduling method for timer described in the patent of front, well reached design object.Be to be example below, to some technical Analysis of this dispatching method with the online detection timer among this BNAS.
Total N the binary tree in the system of setting up departments, S online detection timer, timing cycle is m, online sense cycle is T.Wherein:
S＝2048
N＝64
The m=100 millisecond
T=10 second
Then:
T＝100*m
SUM timer on average arranged on every tree, wherein, SUM=S/N=32.
In addition, in period T, each timer must trigger once, and therefore, at each timing cycle, the number of the average timer that triggers is Q=M/T*m=2048/100.So, the mean depth of the right subtree of every tree is 2.
In sum, adopt this patent method, for 2048 online detection timers, the number of comparisons of scanning timer is 1, inserts the number of comparisons average out to 2 of timer.
Be below to above-mentioned example in a sense cycle when filling 2048 situations that insert users and carry out timer dispatching, if adopt the various scheduling method for timer of prior art and the comparing data that many binary trees cycle timer dispatching method of the present invention is done:
1. if adopt the poll scheduling method for timer
1 number of being done at 10 seconds interscan timers that subtracts is 2048*100, and inserting the number of comparisons that new timer does is 2048, and number of operations is a=2048*101=206848 altogether.
2. if adopt differential timing device dispatching method
10 seconds interscan timers done to subtract 1 number be 100, inserting the number of comparisons that new timer does is 2048*2020, number of operations is b=2048*2027+100=4192356 altogether.
3. if adopt the classification scheduling method for timer
At least need 100 class chains, therefore, 1 number of being done at 10 seconds interscan timers that subtracts is 100*100, and inserting the number of comparisons that new timer does is 2048, and number of operations is c=100*100+2048=12048 altogether.
4. if adopt dispatching method by 2 power power classification timer
At least need 7 class chains, therefore, 1 number of being done at 10 seconds interscan timers that subtracts is 100*7, inserting the number of comparisons that new timer does is 3*2048, judge whether overtime number of comparisons is 3*2048 to timer, the shifting function number of times that splits timer is 2048*8, and number of operations is d=100*7+2048*14=29372 altogether.
5. if the many binary trees cycle timer dispatching method that adopts the present invention to propose
10 seconds interscan timers done to subtract 1 number be 100, inserting the number of comparisons that new timer does is 2*2048, the operation times that calculates the insertion position is 2048, number of operations is e=100+2048*3=6244 altogether.
By top data, can directly draw to draw a conclusion: the order that number of operations successively decreases is followed successively by e＜c＜d＜a＜b, many binary trees cycle timer dispatching method proposed by the invention most effective.
In addition, to have N timer, maximum duration is that the general purpose timer system of T is an example, and top 5 kinds of timer dispatching methods are done a comparative analysis:
1. poll scheduling method for timer
Scanning is relatively more inferior to be N, and inserting comparand is 1, and total number of operations is A=N+1.
2. differential timing device dispatching method
The scanning number of comparisons is 1, inserts relatively time average out to N/2, and total number of operations is B=1+N/2.
3. classification scheduling method for timer
The scanning number of comparisons is T, and inserting number of comparisons is 1, and total number of operations is C=T+ 1.
4. by the dispatching method of 2 power power classification timer
The scanning number of comparisons is
, insert the number of comparisons average out to
, the fractionation operation times is
, total number of operations is
。
5. many binary trees cycle timer dispatching method provided by the invention
The scanning number of comparisons is 1, establishes total total S tree, inserts number of comparisons average out to (N/S)/2, and inserting calculation times is 1, and total number of operations is E=(N/S)/2+2.
Can reach a conclusion by above data:, the best scheduling method for timer of scan efficiency is differential timing device dispatching method and many binary trees cycle timer dispatching method.Inserting the best scheduling method for timer of efficient is classification scheduling method for timer and poll scheduling method for timer.Because the clock cycle of timer is generally very short, the operation of inserting timer relatively seldom, therefore, as a general purpose timer dispatching method, at first Sao Miao efficient must be very high, next is only the efficient of insertion.From this on the one hand, the method for the invention is in the best scheduling method for timer of scan efficiency, inserts the best and scheduling method for timer can be general of efficient.
Above content only is preferred embodiment of the present invention, and its purpose is not the restriction that is used for system and method proposed by the invention, and protection scope of the present invention is as the criterion with claim.Under the situation that does not break away from the spirit and scope of the present invention; those skilled in the art all should drop within protection scope of the present invention its all conspicuous modification or variation about form and details of carrying out under the situation that does not depart from scope and spirit of the present invention.
Claims (3)
1. the dispatching method of binary tree cycle timer more than a kind is characterized in that the method includes the steps of:
The composition of many y-bends number timer construction:
Timer in the system is organized into N chained list, and the structure of each chained list is a binary tree;
Each timer in the corresponding system of each node on the binary tree;
The timing length that timer on the left subtree of each node is set equates with the timing length of father node;
The timing length of the timing length of the timer on the right subtree of each node greater than father node is set;
Timer combination carrying out scan round to whole many binary tree structures:
In the circulating scanning system corresponding to multiple binary-tree structure with times;
The timing value of the tree root of these many binary tree structures done subtract 1 operation, if be 0 after the timing value of this tree root subtracts 1, then the timer expiry on the tree root of these many binary trees and its left subtree is deleted these timers from setting these many binary trees, and is triggered these timers;
In many binary trees timer construction, insert new timer:
When having new timer W to insert in the system,,, calculate the binary tree L that the timer W that makes new advances should insert according to formula L=(P+ (T1 Mod N)) Mod N according to the total N of the timing length T1 of this timer, current scanning position P, binary tree;
According to formula T2=T1/N+1, the timer that must make new advances is the timing value T2 of node regularly;
From the root node H of the binary tree L that should insert new timer, along its right subtree, the timing value of the root node H of binary tree L and the new timer timing value T2 of node regularly relatively determines the insertion position of new timer.
2. many binary trees cycle timer dispatching method as claimed in claim 1, it is characterized in that, the timing value of the described relatively root node H of binary tree L and new timer be the timing value T2 of node regularly, determine the step of the insertion position of new timer, also comprise: if the timing value of binary tree H is greater than T2, then new timer W is inserted the root node of left subtree of the tree root H of binary tree L, the former left subtree of the tree root H of binary tree L is become the left subtree of new timer W, and the timing value of new node is 0; If the value of T2 greater than the timing value among the binary tree H, then is inserted as the root node of the right subtree of binary tree H with new timer W, and the timing value of establishing timer on this node is T2.
3. many binary trees cycle timer dispatching method as claimed in claim 1 is characterized in that the total N of described binary tree is directly proportional with the sum of timer in the system, and the number of the timer that can trigger simultaneously with the system maximum is inversely proportional to.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2003101071063A CN100505811C (en) | 2003-11-25 | 2003-11-25 | Multiple binary tree cycle timer scheduling method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2003101071063A CN100505811C (en) | 2003-11-25 | 2003-11-25 | Multiple binary tree cycle timer scheduling method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1545308A CN1545308A (en) | 2004-11-10 |
| CN100505811C true CN100505811C (en) | 2009-06-24 |
Family
ID=34334332
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2003101071063A Expired - Fee Related CN100505811C (en) | 2003-11-25 | 2003-11-25 | Multiple binary tree cycle timer scheduling method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100505811C (en) |
Families Citing this family (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7552226B2 (en) | 2004-04-08 | 2009-06-23 | International Business Machines Corporation | Detecting a timeout of elements in an element processing system |
| CN1304949C (en) * | 2005-01-12 | 2007-03-14 | 宁波大学 | Timer dispatching method for real-time multi-task operating system |
| JP4507991B2 (en) * | 2005-06-09 | 2010-07-21 | ソニー株式会社 | Information processing apparatus, information processing method, and program |
| CN100358295C (en) * | 2005-07-06 | 2007-12-26 | 华为技术有限公司 | Timer scheduling method |
| CN101853047B (en) * | 2010-05-18 | 2012-02-29 | 瑞斯康达科技发展股份有限公司 | Timer realization method and device |
| CN105653367A (en) * | 2015-12-24 | 2016-06-08 | 北京奇虎科技有限公司 | Method and device for traversing timer |
| CN106406997B (en) * | 2016-09-20 | 2020-03-06 | 新华三技术有限公司 | Timer scheduling method and device |
-
2003
- 2003-11-25 CN CNB2003101071063A patent/CN100505811C/en not_active Expired - Fee Related
Also Published As
| Publication number | Publication date |
|---|---|
| CN1545308A (en) | 2004-11-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105094936B (en) | Background application program cleaning method and device applied to mobile terminal | |
| CN109462769B (en) | Live broadcast room pendant display method and device, terminal and computer readable medium | |
| CN100505811C (en) | Multiple binary tree cycle timer scheduling method | |
| Wagar | Hyperquicksort: A fast sorting algorithm for hypercubes | |
| CN101571861B (en) | Method and device for converting data table | |
| CN103065093B (en) | Method for marking malicious software behavior characteristics | |
| CA2315456A1 (en) | Schematic organization tool | |
| CN107241614A (en) | A kind of live broadcast system | |
| CN102999527B (en) | Multidate information method for pushing and system in SNS network | |
| CN110119307B (en) | Data processing request processing method and device, storage medium and electronic device | |
| CN105095399A (en) | Method and apparatus for pushing search result | |
| JP2010514033A5 (en) | ||
| CN100358295C (en) | Timer scheduling method | |
| CN105100370A (en) | Display device and display method | |
| CN107147947B (en) | Key frame recognition methods and device | |
| CN114490026A (en) | Message consumption optimization method and terminal | |
| CN103685492A (en) | Dispatching method, dispatching device and application of Hadoop trunking system | |
| CN110928900B (en) | Multi-table data query method, device, terminal and computer storage medium | |
| CN101127773A (en) | A mail subscription method and server | |
| CN101753607B (en) | Working device and method for server | |
| CN106156169B (en) | Discrete data processing method and device | |
| CN1318941C (en) | Port polling selection method | |
| CN104301134A (en) | Management method and system based on massive timers in software design | |
| CN111842167B (en) | Method and device for sorting articles | |
| CN112364226A (en) | Interactive information acquisition method and system based on dynamic content analysis |
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 |
Granted publication date: 20090624 Termination date: 20171125 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |