Execution method of time residual quantity order linked list timer
The invention provides an execution method of a time residual quantity order linked list timer in the field of the computer technology, and comprises a plurality of tasks of different timing durations. The execution method comprises the following execution steps when tasks are processed: (1) arrangi...
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Patent |
Sprache: | chi ; eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | |
---|---|
container_issue | |
container_start_page | |
container_title | |
container_volume | |
creator | QIAN YINSHENG |
description | The invention provides an execution method of a time residual quantity order linked list timer in the field of the computer technology, and comprises a plurality of tasks of different timing durations. The execution method comprises the following execution steps when tasks are processed: (1) arranging all tasks in a double linked list according to the ascending order of the timing durations; (2) ensuring that a time interval between the task under a current node and the task of a previous node is tn; (3) adopting a single counting thread to cause t1' to be equal to t1/a, subtracting 1 from t1' when one counting period is executed each time, deleting the task under the first node when t1' is equal to 0, reconditioning the linked list, and executing the task under the first node; (4) returning to the (3) to circulate the above steps; and (5) when a new timing task is added, inserting the new task into a correct position in the linked list according to the requirement of the (1), and returning to the (3) to circ |
format | Patent |
fullrecord | <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_CN106020978A</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>CN106020978A</sourcerecordid><originalsourceid>FETCH-epo_espacenet_CN106020978A3</originalsourceid><addsrcrecordid>eNrjZHByrUhNLi3JzM9TyE0tychPUchPUyjJzE1VKEotzkwpTcxRKCxNzCvJLKlUyC9KSS1SyMnMy05NAVLFJWCFRTwMrGmJOcWpvFCam0HRzTXE2UM3tSA_PrW4IDE5NS-1JN7Zz9DAzMDIwNLcwtGYGDUAXdkyTA</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>Execution method of time residual quantity order linked list timer</title><source>esp@cenet</source><creator>QIAN YINSHENG</creator><creatorcontrib>QIAN YINSHENG</creatorcontrib><description>The invention provides an execution method of a time residual quantity order linked list timer in the field of the computer technology, and comprises a plurality of tasks of different timing durations. The execution method comprises the following execution steps when tasks are processed: (1) arranging all tasks in a double linked list according to the ascending order of the timing durations; (2) ensuring that a time interval between the task under a current node and the task of a previous node is tn; (3) adopting a single counting thread to cause t1' to be equal to t1/a, subtracting 1 from t1' when one counting period is executed each time, deleting the task under the first node when t1' is equal to 0, reconditioning the linked list, and executing the task under the first node; (4) returning to the (3) to circulate the above steps; and (5) when a new timing task is added, inserting the new task into a correct position in the linked list according to the requirement of the (1), and returning to the (3) to circ</description><language>chi ; eng</language><subject>CALCULATING ; COMPUTING ; COUNTING ; ELECTRIC DIGITAL DATA PROCESSING ; PHYSICS</subject><creationdate>2016</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20161012&DB=EPODOC&CC=CN&NR=106020978A$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,780,885,25564,76547</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20161012&DB=EPODOC&CC=CN&NR=106020978A$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>QIAN YINSHENG</creatorcontrib><title>Execution method of time residual quantity order linked list timer</title><description>The invention provides an execution method of a time residual quantity order linked list timer in the field of the computer technology, and comprises a plurality of tasks of different timing durations. The execution method comprises the following execution steps when tasks are processed: (1) arranging all tasks in a double linked list according to the ascending order of the timing durations; (2) ensuring that a time interval between the task under a current node and the task of a previous node is tn; (3) adopting a single counting thread to cause t1' to be equal to t1/a, subtracting 1 from t1' when one counting period is executed each time, deleting the task under the first node when t1' is equal to 0, reconditioning the linked list, and executing the task under the first node; (4) returning to the (3) to circulate the above steps; and (5) when a new timing task is added, inserting the new task into a correct position in the linked list according to the requirement of the (1), and returning to the (3) to circ</description><subject>CALCULATING</subject><subject>COMPUTING</subject><subject>COUNTING</subject><subject>ELECTRIC DIGITAL DATA PROCESSING</subject><subject>PHYSICS</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2016</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZHByrUhNLi3JzM9TyE0tychPUchPUyjJzE1VKEotzkwpTcxRKCxNzCvJLKlUyC9KSS1SyMnMy05NAVLFJWCFRTwMrGmJOcWpvFCam0HRzTXE2UM3tSA_PrW4IDE5NS-1JN7Zz9DAzMDIwNLcwtGYGDUAXdkyTA</recordid><startdate>20161012</startdate><enddate>20161012</enddate><creator>QIAN YINSHENG</creator><scope>EVB</scope></search><sort><creationdate>20161012</creationdate><title>Execution method of time residual quantity order linked list timer</title><author>QIAN YINSHENG</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_CN106020978A3</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>chi ; eng</language><creationdate>2016</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>ELECTRIC DIGITAL DATA PROCESSING</topic><topic>PHYSICS</topic><toplevel>online_resources</toplevel><creatorcontrib>QIAN YINSHENG</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>QIAN YINSHENG</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>Execution method of time residual quantity order linked list timer</title><date>2016-10-12</date><risdate>2016</risdate><abstract>The invention provides an execution method of a time residual quantity order linked list timer in the field of the computer technology, and comprises a plurality of tasks of different timing durations. The execution method comprises the following execution steps when tasks are processed: (1) arranging all tasks in a double linked list according to the ascending order of the timing durations; (2) ensuring that a time interval between the task under a current node and the task of a previous node is tn; (3) adopting a single counting thread to cause t1' to be equal to t1/a, subtracting 1 from t1' when one counting period is executed each time, deleting the task under the first node when t1' is equal to 0, reconditioning the linked list, and executing the task under the first node; (4) returning to the (3) to circulate the above steps; and (5) when a new timing task is added, inserting the new task into a correct position in the linked list according to the requirement of the (1), and returning to the (3) to circ</abstract><oa>free_for_read</oa></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | |
ispartof | |
issn | |
language | chi ; eng |
recordid | cdi_epo_espacenet_CN106020978A |
source | esp@cenet |
subjects | CALCULATING COMPUTING COUNTING ELECTRIC DIGITAL DATA PROCESSING PHYSICS |
title | Execution method of time residual quantity order linked list timer |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-02T22%3A30%3A54IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-epo_EVB&rft_val_fmt=info:ofi/fmt:kev:mtx:patent&rft.genre=patent&rft.au=QIAN%20YINSHENG&rft.date=2016-10-12&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3ECN106020978A%3C/epo_EVB%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |