WO2011131010A1 - Procédé et appareil de temporisation - Google Patents

Procédé et appareil de temporisation Download PDF

Info

Publication number
WO2011131010A1
WO2011131010A1 PCT/CN2010/079619 CN2010079619W WO2011131010A1 WO 2011131010 A1 WO2011131010 A1 WO 2011131010A1 CN 2010079619 W CN2010079619 W CN 2010079619W WO 2011131010 A1 WO2011131010 A1 WO 2011131010A1
Authority
WO
WIPO (PCT)
Prior art keywords
timer
allocated
time
identifier
array
Prior art date
Application number
PCT/CN2010/079619
Other languages
English (en)
Chinese (zh)
Inventor
高峰
冷卫杰
徐运
管慧娟
陈杰
Original Assignee
中兴通讯股份有限公司
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by 中兴通讯股份有限公司 filed Critical 中兴通讯股份有限公司
Publication of WO2011131010A1 publication Critical patent/WO2011131010A1/fr

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46—Multiprogramming arrangements
    • G06F9/48—Program initiating; Program switching, e.g. by interrupt
    • G06F9/4806—Task transfer initiation or dispatching
    • G06F9/4812—Task transfer initiation or dispatching by interrupt, e.g. masked
    • G06F9/4825—Interrupt from clock, e.g. time of day

Definitions

  • the present invention relates to the field of embedded software development, and more particularly to timing methods and apparatus in the field. Background technique
  • timers in each operating system depend on the signal triggering and processing of the system, and can be used in each process for the timers that depend on the system.
  • the number of timers is fixed, so the timer is limited by the number of timers in the process, in addition to being limited by the signal.
  • three types of timers are used, namely alarm ( ), POSIX: XSI interval timer setitimer ( ), POSIX: TMR interval timer timer - create ( ), these timers are built on Linux.
  • the operating system's signal is triggered, processed, and has a number of timers and signal limits. Summary of the invention
  • the present invention provides a timing method for solving the problem in the prior art that there is a limitation that the timer is limited by the operating system of the operating system and the number of timers in each process.
  • a timing method comprising:
  • the method further includes: restoring the allocated timer to an idle state, and releasing resources occupied by the allocated timer.
  • the process of using the allocated timer to perform timing includes: acquiring a preset timing time of the allocated timer, and determining a first member currently pointed by the cursor in the clock tick array, the member representative Set the length of time value;
  • N is equal to the ratio of the preset timing time to the total duration of the clock tick array
  • the cursor is moved for timing, and when the cursor moves to the second member for the N+1th time, the time of the allocated timer reaches the preset timing time.
  • the method further includes:
  • the identifier of at least one timer under the member is connected in a bidirectional linked list manner
  • the identifier of each timer corresponds to a pre-variable wPreNode and a post-variable wNextNode, where the wPreNode is used to identify an identifier of a previous timer of the timer that points to the identifier, wNextNode is used to identify the identifier of the next timer of the timer that identifies the identifier.
  • the method further includes:
  • the identifier of the added timer is placed in the header of the doubly linked list, and the two-way linked variable is used to link the two-way with the identifier of the added timer.
  • the identifier of the timer corresponding to the original header of the linked list.
  • the process of allocating a timer includes: Querying the location information of the idle timer in the shared memory of the timer in the idle node table, the timer shared memory stores the allocated timer and the idle timer in an array manner, and each timer is located therein a member of the storage array;
  • the determined idle timer is taken as the timer to be allocated.
  • the method further includes:
  • the idle node table has a header variable wFreeHead pointing to the free node table header and a tail variable wFreeTail pointing to the idle node table header, and the values of the members pointed to by the wFreeHead and the wFreeTail are both When greater than the maximum value of the storage array, set the wFreeHead and the wFreeTail to return and point to the first member of the storage array; after allocating the timer, set the wFreeHead to move backward in the storage array
  • the wFreeTail After releasing the resources occupied by an allocated timer, the wFreeTail is set to be shifted back by one in the storage array.
  • the method further includes: when the timeout period of the allocated timer does not reach the corresponding preset timing time, receiving a timer cancellation request, notifying the allocated timer to stop timing.
  • a timing device comprising:
  • a receiving module configured to receive a timer call request sent by the requesting party
  • An allocating module configured to allocate a timer to the requesting party, and perform timing by using an allocated timer
  • a sending module configured to send a timer arrival message to the requesting party when a time of the allocated timer reaches a corresponding preset time.
  • the device further includes: a release module, configured to send the request to the requesting party After the timer expires the message, the allocated timer is restored to the idle state, and the resources occupied by the allocated timer are released.
  • a release module configured to send the request to the requesting party After the timer expires the message, the allocated timer is restored to the idle state, and the resources occupied by the allocated timer are released.
  • the distribution module includes:
  • Obtaining a submodule configured to acquire a preset timing time of the allocated timer, and determine a first member currently pointed by the cursor in the clock tick array, wherein the member represents a set time length value;
  • An estimation submodule configured to estimate a second member pointed by the cursor when the timed time of the allocated timer reaches the preset timing time, and mount the allocated timer to the Under the second member;
  • a prediction submodule configured to predict, according to the preset timing time, a number N of times the cursor traverses the clock tick array, where N is an integer of ⁇ 0, and N is equal to the preset timing time and the clock The ratio of the total duration of the ticking array is rounded down;
  • a timing sub-module configured to move the cursor to perform timing, and when the cursor moves to the second member for the N+1th time, the time of the allocated timer reaches the preset timing time.
  • the allocating module further includes: a serial sub-module, configured to: when a member of the clock tick array is mounted with at least one timer, use a doubly linked list to connect the identifiers of the at least one timer under the member in series; In the doubly linked list, the identifier of each timer corresponds to a pre-variable wPreNode and a post-variable wNextNode, where the wPreNode is used to identify the identifier of the previous timer of the timer that identifies the identifier, the wNextNode The identifier of the latter timer used for the timer that points to the identification flag.
  • a serial sub-module configured to: when a member of the clock tick array is mounted with at least one timer, use a doubly linked list to connect the identifiers of the at least one timer under the member in series; In the doubly linked list, the identifier of each timer corresponds to a pre-variable wPreNode and a
  • the distribution module includes:
  • a query submodule configured to query, in the idle node table, location information of the idle timer in the timer shared memory, where the timer shared memory stores the allocated timer and the idle timer in an array manner, and each Timers are a member of the storage array in which they reside; Determining a submodule, configured to determine a corresponding idle timer in the timer shared memory according to the queried location information;
  • an allocation submodule configured to allocate the determined idle timer to the requesting party.
  • an idle timer can be allocated according to a timer call request of the software module, instead of using a timer provided by the operating system; when the time of the assigned timer reaches the corresponding pre- When the time is set, the timer arrival message is sent to the software module, which can avoid the triggering and processing of the operating system's own timer, the limitation of the signal of the system, and the number of timers in the process. Moreover, the signal triggering and processing of the software module itself is not affected, and the process that the software module is processing is not affected, and the problem that the signal is suddenly suspended during the execution of the process is avoided.
  • FIG. 1 is a flowchart of a timing method according to an embodiment of the present invention.
  • FIG. 2 is a flow chart of timing calculation using an allocated timer according to an embodiment of the present invention
  • FIG. 3 is a schematic structural diagram of a clock tick array according to an embodiment of the present invention
  • FIG. 4 is a schematic diagram of timing of a timer using a clock tick array according to an embodiment of the present invention
  • FIG. 5 is a schematic structural diagram of a doubly linked list according to an embodiment of the present invention
  • FIG. 6 is a schematic structural diagram of a timer shared memory according to an embodiment of the present invention.
  • FIG. 7 is a schematic structural diagram of an idle node table according to an embodiment of the present invention.
  • FIG. 8 is a flowchart of processing of a timer and a time after arrival according to an embodiment of the present invention.
  • FIG. 9 is a flowchart of managing an idle timer by using an idle node table according to an embodiment of the present invention
  • FIG. 10 is a flowchart of a process after a timer reaches a preset timing time or is canceled according to an embodiment of the present invention
  • FIG. 11 is a schematic structural diagram of a first timing device according to an embodiment of the present invention.
  • FIG. 12 is a schematic structural diagram of a second timing device according to an embodiment of the present invention.
  • FIG. 13 is a schematic structural diagram of a first distribution module according to an embodiment of the present invention
  • FIG. 14 is a schematic structural diagram of a second distribution module according to an embodiment of the present invention
  • FIG. 15 is a schematic structural diagram of a third distribution module according to an embodiment of the present invention.
  • FIG. 16 is a schematic structural diagram of a fourth distribution module according to an embodiment of the present invention.
  • FIG. 17 is a schematic structural diagram of a query submodule according to an embodiment of the present invention.
  • FIG. 18 is a schematic structural diagram of a third timing device according to an embodiment of the present invention. detailed description
  • the timer depends on the operating system, the signal limitation of the operating system, and the limitation of the number of timers in each process.
  • the embodiment of the present invention provides a timing method. The specific processing flow is shown in Figure 1, including:
  • Step 101 Receive a timer call request sent by a software module.
  • Step 102 Allocate an idle timer to the software module, and use the allocated timer to perform timing;
  • Step 103 Send a timer arrival message to the software module when the time of the allocated timer reaches the corresponding preset timing time.
  • the allocated timer stops counting, and the allocated timer is restored to the idle state, and the occupied resources are released, so that the released resources are used to allocate timing to other software modules. Device.
  • step 102 is used to perform timing by using an allocated timer.
  • timing methods for example, using a linked list to perform timing, or an array method for timing. , where any two members of the linked list or array can represent the set length of time value.
  • the clock tick array is taken as an example for description.
  • the specific processing flow for timing with the assigned timer is as shown in FIG. 2, including:
  • Step 201 Obtain a preset timing time of the allocated timer, and determine a first member currently pointed by the cursor in the clock tick array;
  • Step 202 Estimate the time of arrival of the allocated timer according to the preset timing time. Setting the time member to the second member pointed to by the cursor, and mounting the assigned timer to the second member;
  • Step 203 Predict a number N of times that the cursor traverses the clock tick array according to the preset timing time, where N is equal to a ratio of the preset timing time to the total duration of the clock tick array is rounded down; Step 204, moving the cursor to perform timing, when When the cursor moves to the second member at the N+1th time, the time of the assigned timer reaches the preset timing time.
  • the size of the clock tick array TIMER-MAX-TMCB-NUM is configurable. Of course, TIMER-MAX-TMCB-NUM can only take an integer of 0. For example, TIMER-MAX-TMCB-NUM can take values. It is 30,000.
  • each member of the clock tick array represents a pre-set time period, and the position numbers of each member are 0 - ( TIMER - MAX - TMCB - NUM - 1 ) in sequence, and there is one in the clock tick array.
  • the cursor wScanPos points to a member of the array, which represents the current time. The specific structure is shown in Figure 3.
  • the cursor points to the next member of the member.
  • Each step of the cursor is implemented by a delay function, such as using the usleepO function time in the Linux operating system.
  • the assigned timer is mounted to the clock tick array member corresponding to its arrival time. When the cursor moves to point to the member, it represents the timer expires.
  • the set time period USP_OSS_TIMER-SLEEP (hereinafter referred to as TIMER-SLEEP) represented by each member may be the same or different, depending on the actual situation, for example, In the clock tick array, each member represents 10ms, and can also be set to the first member for 10ms, the second member for 5ms, the third member for 7ms, and so on. Now, a specific embodiment is described.
  • TIMER-MAX-TMCB-NUM takes 30000, each member in the clock tick array represents 10ms, and a software module is assigned a timer with a preset timing of 30ms.
  • the timer will time out.
  • a message is sent to the software module to which the timer is assigned, to inform the assigned timer that it has arrived, such as As shown in Figure 4, the current position of the cursor points to member 7, the preset timing time of the timer is 30ms, each member represents 10ms, the cursor needs to move and points to the member 9 when it arrives, therefore, the preset timing time is 30ms.
  • the timer is mounted under member 9.
  • the cursor points to member 7, the 10ms period represented by member 7 is not included in the timing, and 10ms of member 7 should be counted first. For timing times greater than 10 X 30000ms, the cursor will return to the beginning of the clock tick array and loop back and forth.
  • the member pointed to by the cursor in the clock tick array also needs Determines the number of times the assigned timer cycles through the clock tick array. For example, the total duration of the clock tick array is 10 X 30000ms, the software module is assigned a timer A, the timing is 10 X 60000ms, and the cursor is currently pointing to member 200. Then the calculation process of the A position is as follows:
  • multiple timers may be mounted under the member pointed to by the cursor. In this case, only the timers that are mounted under the member pointed to by the cursor are notified to the software modules that use these timers. Notice.
  • a preferred embodiment is to use two-way.
  • Linked list mode connects at least one timer under the member in series
  • the identifier of each timer corresponds to a pre-variable wPreNode and a post-variable wNextNode, where wPreNode is used to identify the identifier of the previous timer of the timer that points to the identifier, and wNextNode is used to point to the identifier.
  • the identifier of the latter timer of the timer is as shown in FIG. 5.
  • the timer 1 and the timer 2 are mounted under the member 9, and the identifiers of the two are linked into a doubly linked list through the wPreNode and the wNextNode.
  • a preferred processing mode is: when a timer is added to a member that has at least one timer, the identifier of the added timer is placed in the header of the doubly linked list, and the identifier of the added timer is used.
  • the variable links the timer corresponding to the original header of the doubly linked list.
  • the identifier of the added timer may also be placed at the end of the doubly linked list or other locations. According to the specific circumstances.
  • the step 102 further includes querying the position of the idle timer in the timer shared memory before the implementation, and the timer shared memory is stored in an array manner.
  • the assigned timer and the idle timer, each timer is a member of the storage array in which it is located, and its sequence number is 0, 1, 2
  • a preferred implementation method is to use the idle node table to record the position of the idle timer in the shared memory of the timer in the idle node table.
  • the specific processing procedure is as follows: Query the idle node table in the idle node table.
  • the timer information in the shared memory of the timer determines a corresponding idle timer in the timer shared memory according to the queried location information, and allocates the determined idle timer to the software module.
  • the idle node table has a header variable wFreeHead pointing to the idle node table header and a tail variable wFreeTail at the end of the idle node table, in the application process, in the software
  • the module allocates an idle timer, set wFreeHead to shift back one bit in the storage array; after releasing the resources occupied by the allocated timer, set wFreeTail to shift back one bit in the storage array.
  • the idle timer recorded in the idle node table is all timers in the timer shared memory.
  • wFreeHead and wFreeTail When the value of the member pointed to by wFreeHead and wFreeTail is greater than the maximum value TIMER_MAX_TIMERS-1 of the storage array, wFreeHead and wFreeTail return and point to the first member 0 of the storage array, ie wFreeHead and wFreeTail loop on the idle node table. mobile.
  • the number of timers is also configurable (indicated by TIMER-MAX-TIMERS). In general, 100 timers are sufficient, since the timer is statically allocated memory, considering that some The device has a small memory. You can configure the number of timers to a smaller number of timers. This saves memory space.
  • the timer cancellation request is received, and the allocated timer is notified to stop timing. That is, the timer can be counted when the timer has not expired, and the flexibility is high.
  • the timing method provided by the embodiment of the present invention is to allocate an idle timer according to a timer call request of the software module, instead of using a timer provided by the operating system to perform timing, thereby avoiding the operating system own timer is dependent on
  • the signal triggering and processing of this system is limited by the signal of the system and by the number of timers in the process.
  • the clock ticking array is scanned, and whether the timer expires or not, and the specific processing flow of the related processing after the time is as shown in FIG. 8 , including: step 801, delay TIMER — SLEEP time ;
  • Step 802 Determine whether a timer is mounted under the member of the clock tick array indicated by the cursor wScanPos, if yes, go to step 803, if no, return to step 801;
  • Step 803 Search for a timer in the doubly linked list under the member. Step 804, determining whether dwCountTimer is 0, if yes, executing step 805, if not, executing step 809;
  • Step 805 When the timing is up, send a message to the software module that uses the timer, and notify that the timing is up;
  • Step 806 Release the timer, and adjust the doubly linked list under the member.
  • Step 807 adding the timer to the idle node table
  • Step 808 it is determined whether the end of the chain of the doubly linked list is reached, if yes, go to step 801, if no, go to step 803;
  • Step 809 dwCountTimer is decremented by 1, and the process ends.
  • the idle timer is managed by the idle node table, and the specific processing flow is as shown in FIG. 9:
  • Step 901 Query an idle node table, and confirm that an idle timer exists.
  • Step 902 determine whether wFreeHead is equal to wFreeTail, if not, go to step 903, and if yes, go to step 908;
  • Step 903 Allocating a timer indicated by wFreeHead in the idle node table to a software module requesting a timer;
  • Step 904 Identify the allocated timer as used
  • Step 905 wFreeHead moves backward by one
  • Step 906 Mount the allocated timer under the member of the corresponding clock tick group according to the predetermined timing time
  • Step 907 Adjust the doubly linked list under the member, and add the allocated timer to the header.
  • Step 908 Notify the software module of the requesting timer that there is no idle timer.
  • Step 1001 Set a timer that reaches a preset timing time or is cancelled to be idle;
  • Step 1002 Modify the idle node table, point wFreeTail to the timer, and move back one bit in the idle node table;
  • Step 1003 Adjust the doubly linked list where the timer is located, and serialize the timer before and after the timer.
  • an embodiment of the present invention further provides a timing device.
  • the specific structure is as shown in FIG.
  • the receiving module 1101 is configured to receive a timer call request sent by the software module.
  • the allocating module 1102 is configured to allocate an idle timer to the software module, and use the allocated timer to perform timing;
  • the sending module 1103 is configured to send a timer arrival message to the software module when the time of the allocated timer reaches the corresponding preset time.
  • the timing device may further include: a release module 1201, configured to: after sending the timer arrival message to the software module, restore the allocated timer to an idle state, and release the The resources occupied by the assigned timer.
  • a release module 1201 configured to: after sending the timer arrival message to the software module, restore the allocated timer to an idle state, and release the The resources occupied by the assigned timer.
  • the allocating module 1102 may include: an obtaining submodule 1301, configured to acquire a preset timing time of the allocated timer, and determine a first point currently pointed by the cursor in the clock tick array. Member
  • the estimation sub-module 1302 is configured to estimate a second member pointed by the cursor when the time of the allocated timer reaches the preset timing time, and mount the allocated timer to the second member; the prediction submodule 1303 For predicting the number N of times the cursor traverses the clock tick array according to the preset timing time, where N is an integer of ⁇ 0, and N is equal to the ratio of the preset timing time to the total duration of the clock tick array;
  • the timing sub-module 1304 is configured to move the cursor to perform timing. When the cursor moves to the second member in the N+1th time, the time of the allocated timer reaches the preset timing time.
  • the distribution module 1102 may further include:
  • the serial sub-module 1401 is configured to: when at least one timer is mounted under one member of the clock tick array, use a doubly linked list to connect the identifiers of the at least one timer under the member; in the doubly linked list, each timer The identifier corresponds to a pre-variable wPreNode and a post-variable wNextNode, where wPreNode is used for the identifier of the previous timer of the timer pointing to the identifier, and wNextNode is used for the next timer of the timer pointing to the identifier Logo.
  • the allocating module 1102 may further include: an adding submodule 1501, configured to add an identifier of the timer when a timer is added to a member that has at least one timer mounted Putting it into the header of the doubly linked list, the back variable of the identifier of the added timer is used to link the identifier of the timer corresponding to the original header of the doubly linked list.
  • an adding submodule 1501 configured to add an identifier of the timer when a timer is added to a member that has at least one timer mounted Putting it into the header of the doubly linked list, the back variable of the identifier of the added timer is used to link the identifier of the timer corresponding to the original header of the doubly linked list.
  • the allocating module 1102 may include: a query submodule 1601, configured to query, in the idle node table, location information of an idle timer in a timer shared memory, and timer sharing.
  • the memory stores the allocated timer and the idle timer in an array manner, and each timer is a member of the storage array in which it is located;
  • a determining submodule 1602 configured to determine, according to the queried location information, a corresponding idle timer in the timer shared memory
  • the allocation sub-module 1603 is configured to allocate the determined idle timer to the software module.
  • the query sub-module 1601 may further include: a setting unit 1701, configured to: when the free node table has a header variable wFreeHead pointing to the idle node table header and pointing to the idle node table The tail variable wFreeTail of the footer, and when the values of the members pointed to by wFreeHead and the wFreeTail are greater than the maximum value of the storage array, set wFreeHead and the wFreeTail to return and point to the first member of the storage array;
  • a first back-moving unit 1702 configured to allocate a free timer to the software module, and set wFreeHead to move back one bit in the storage array;
  • a second back-moving unit 1703 configured to release a resource occupied by an allocated timer, Set wFreeTail to move back one bit in the storage array.
  • the timing device may further include:
  • the canceling module 1801 is configured to: when the time of the allocated timer does not reach the corresponding preset timing time, receive a timer cancel request, and notify the allocated timer to stop timing.
  • the idle timer is allocated according to the timer call request of the software module, instead of using the timer provided by the operating system, and the time of the assigned timer reaches the corresponding preset timing.
  • sending a timer arrival message to the software module can avoid the triggering and processing of the operating system's own timer depending on the system, the limitation of the signal of the system, and the limitation of the number of timers in the process, and It does not affect the signal triggering and processing of the software module itself, nor does it affect the process that the software module is processing, and avoids the problem that the signal is aborted during the execution of the process.
  • the timer cancel request is received, and the allocated timer is notified to stop timing. That is, the timer can be counted when the timer has not expired, and the flexibility is high.

Landscapes

  • Engineering & Computer Science (AREA)
  • Software Systems (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Executing Machine-Instructions (AREA)
  • Synchronisation In Digital Transmission Systems (AREA)

Abstract

La présente invention concerne un procédé et un appareil de temporisation permettant, qu'il s'agisse du procédé ou de l'appareil, de recevoir d'une demande d'appel de temporisation envoyée par un interlocuteur demandeur, d'affecter en conséquence une fonction de temporisation à l'interlocuteur demandeur, et d'effectuer la temporisation en utilisant la fonction de temporisation affectée. Dès lors, une fois que la durée de temporisation de la fonction de temporisation a atteint une durée de temporisation définie correspondante, on procède à l'envoi à l'interlocuteur demandeur d'un message "durée de temporisation atteinte". L'invention constituera une solution dans les cas où, en l'état de la technique, la fonction de temporisation est limitée par les signaux du système d'exploitation implanté, et où le nombre de fonctions de temporisation dans chaque fil d'exécution est limité.
PCT/CN2010/079619 2010-04-21 2010-12-09 Procédé et appareil de temporisation WO2011131010A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201010154109.2A CN101833450B (zh) 2010-04-21 2010-04-21 定时方法和装置
CN201010154109.2 2010-04-21

Publications (1)

Publication Number Publication Date
WO2011131010A1 true WO2011131010A1 (fr) 2011-10-27

Family

ID=42717531

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2010/079619 WO2011131010A1 (fr) 2010-04-21 2010-12-09 Procédé et appareil de temporisation

Country Status (2)

Country Link
CN (1) CN101833450B (fr)
WO (1) WO2011131010A1 (fr)

Families Citing this family (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101833450B (zh) * 2010-04-21 2015-01-28 中兴通讯股份有限公司 定时方法和装置
CN102662428B (zh) * 2012-03-01 2015-02-04 中国科学院计算技术研究所 一种离散事件网络模拟环境的时钟同步方法
CN103425058B (zh) * 2012-05-15 2016-08-03 安凯(广州)微电子技术有限公司 一种计时方法、中央处理器及电子设备
CN103034493B (zh) * 2012-12-10 2015-11-18 上海斐讯数据通信技术有限公司 一种定时器节点的管理方法和系统
CN109471663B (zh) * 2018-10-30 2022-04-05 珠海格力智能装备有限公司 单片机程序的执行方法及装置
CN110362554B (zh) * 2019-06-24 2024-05-03 平安科技（深圳）有限公司 定时器的设定方法、装置、设备及计算机可读存储介质

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1873615A (zh) * 2006-01-20 2006-12-06 华为技术有限公司 一种定时器任务服务方法
CN101132369A (zh) * 2007-08-15 2008-02-27 中兴通讯股份有限公司 网络处理器中定时器的实现方法
CN101833450A (zh) * 2010-04-21 2010-09-15 中兴通讯股份有限公司 定时方法和装置

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1275423C (zh) * 2002-02-28 2006-09-13 中兴通讯股份有限公司 嵌入式实时操作系统中定时器的计时方法
CN101272564B (zh) * 2008-04-17 2011-05-11 中兴通讯股份有限公司 一种软实时定时器调度的方法及软实时定时器模块

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1873615A (zh) * 2006-01-20 2006-12-06 华为技术有限公司 一种定时器任务服务方法
CN101132369A (zh) * 2007-08-15 2008-02-27 中兴通讯股份有限公司 网络处理器中定时器的实现方法
CN101833450A (zh) * 2010-04-21 2010-09-15 中兴通讯股份有限公司 定时方法和装置

Also Published As

Publication number Publication date
CN101833450B (zh) 2015-01-28
CN101833450A (zh) 2010-09-15

Similar Documents

Publication Publication Date Title
WO2011131010A1 (fr) Procédé et appareil de temporisation
CN107087033B (zh) 消息推送方法、装置、存储介质及计算机设备
US20060010446A1 (en) Method and system for concurrent execution of multiple kernels
CN102455940B (zh) 一种定时器和异步事件的处理方法及系统
US20170329632A1 (en) Device scheduling method, task manager and storage medium
JP6359098B2 (ja) 分散リアルタイムシステムにおいて周期的なタスクの間で適時にデータを引き渡す方法
US9258246B2 (en) Integrated circuit device and methods for performing cut-through forwarding
CN106462474A (zh) 使用故意延迟发送的网络超时
CN104854845B (zh) 使用高效的原子操作的方法和装置
TW200830792A (en) Adaptive polling for bursty wireless data traffic
TW201924446A (zh) 共用無線電仲裁
US9569264B2 (en) Multi-core system for processing data packets
WO2012174838A1 (fr) Procédé et système de transmission parallèle de messages d'éléments de réseau
Cena et al. Achieving round-robin access in controller area networks
US20020010732A1 (en) Parallel processes run scheduling method and device and computer readable medium having a parallel processes run scheduling program recorded thereon
JP2016528648A (ja) 電力消費の低減のためのネットワークアプリケーション並行スケジューリング
JP2007249357A (ja) 情報処理装置、分散処理システム及びタスク管理方法
WO2013068925A2 (fr) Procédé et appareil de commande de dispositifs sans fil
CN103399949B (zh) 一种数据库存储块状态控制方法和装置
JP2010176348A (ja) データ転送装置
JP2009251652A (ja) マルチコアシステム
CN105634983A (zh) 队列的调度方法及装置
CN115189977B (zh) 一种基于axi协议的广播传输方法、系统及介质
CN102478878A (zh) 定时方法
EP2475130B1 (fr) Procédé et serveur pour gérer un dispositif à distance dans un réseau

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 10850142

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 10850142

Country of ref document: EP

Kind code of ref document: A1