CN108366383A - Conflict scheduling method, apparatus and system - Google Patents
Conflict scheduling method, apparatus and system Download PDFInfo
- Publication number
- CN108366383A CN108366383A CN201711482644.9A CN201711482644A CN108366383A CN 108366383 A CN108366383 A CN 108366383A CN 201711482644 A CN201711482644 A CN 201711482644A CN 108366383 A CN108366383 A CN 108366383A
- Authority
- CN
- China
- Prior art keywords
- queue
- work
- elements
- conflict
- comparison
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 33
- 239000011159 matrix material Substances 0.000 claims description 24
- 238000010586 diagram Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W24/00—Supervisory, monitoring or testing arrangements
- H04W24/04—Arrangements for maintaining operational condition
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses conflict scheduling method, apparatus and systems, this method includes initialization step, comparison step, work step and judgment step, during executing the work of multiple elements parallel, coordinate the work for the element that may be clashed using the mode of central dispatching.It applies in the conflict scheduling of radio-frequency antenna, the radio-frequency antenna set that the radio-frequency antenna set read is read with waiting can be recorded, pass through certain algorithmic dispatching, be staggered the read access time of adjacent radio frequency antenna, thus be staggered from the time read operations of two adjacent radio frequency antennas, to achieve the purpose that macroscopically mutiple antennas while read.
Description
Technical Field
The present invention relates to the technical field of scheduling algorithms, and in particular, to a conflict scheduling method, apparatus, and system.
Background
In the process of executing a plurality of processes in parallel, a process conflict situation may occur, which requires an algorithm to schedule from.
For example, when the rf antennas are placed side by side, adjacent antennas may interfere with each other when reading at the same time, and the reading speed is reduced.
Disclosure of Invention
In order to overcome the defects of the prior art, the invention aims to provide a conflict scheduling method, a conflict scheduling device and a conflict scheduling system, and aims to solve the problem that a simple and effective scheduling algorithm is lacked when a conflict occurs in a parallel process in the prior art.
The purpose of the invention is realized by adopting the following technical scheme:
a method of conflict scheduling, comprising:
initializing, namely initializing a work queue A, a waiting queue B and a temporary comparison queue C, enabling the work queue A and the temporary comparison queue C to be empty, and sequentially putting elements waiting for executing work into the waiting queue B;
a comparison step, namely moving the first two elements in the waiting queue B into a temporary comparison queue C; comparing the elements in the temporary comparison queue C with the elements in the work queue A;
a working step, elements which do not conflict with the work queue A in the temporary comparison queue C are moved into the work queue A, and the elements which conflict with the work queue A in the temporary comparison queue C are put back into the waiting queue B; executing the work of the elements in the work queue A, and emptying the temporary comparison queue C;
judging whether the work of the elements in the work queue A is finished or not; if the operation is finished, the elements which finish the operation are moved from the operation queue A to the bottom of the waiting queue B, and the comparison step is carried out; if not, directly entering the comparison step.
On the basis of the above embodiment, it is preferable that:
before the comparing step, the method further comprises the following steps:
a conflict matrix obtaining step, namely obtaining a conflict matrix of elements according to a conflict relation in the execution work;
in the comparing step, the elements in the temporary comparison queue C are compared with the elements in the work queue A according to the conflict matrix.
On the basis of any of the above embodiments, preferably, the element is a radio frequency antenna number;
in the working step, the element works by sending a reading instruction corresponding to the radio frequency antenna number.
A conflict scheduler comprising:
an initialization module to perform:
initializing, namely initializing a work queue A, a waiting queue B and a temporary comparison queue C, enabling the work queue A and the temporary comparison queue C to be empty, and sequentially putting elements waiting for executing work into the waiting queue B;
a comparison module to perform:
a comparison step, namely moving the first two elements in the waiting queue B into a temporary comparison queue C; comparing the elements in the temporary comparison queue C with the elements in the work queue A;
a work module to perform:
a working step, elements which do not conflict with the work queue A in the temporary comparison queue C are moved into the work queue A, and the elements which conflict with the work queue A in the temporary comparison queue C are put back into the waiting queue B; executing the work of the elements in the work queue A, and emptying the temporary comparison queue C;
a judging module for executing:
judging whether the work of the elements in the work queue A is finished or not; if the operation is finished, the elements which finish the operation are moved from the operation queue A to the bottom of the waiting queue B, and the comparison step is carried out; if not, directly entering the comparison step.
On the basis of the above embodiment, it is preferable that the method further includes:
a collision matrix acquisition module for performing:
a conflict matrix obtaining step, namely obtaining a conflict matrix of elements according to a conflict relation in the execution work;
and the comparison module is used for comparing the elements in the temporary comparison queue C with the elements in the work queue A according to the conflict matrix.
On the basis of any of the above embodiments, preferably, the element is a radio frequency antenna number; the element operates to send a read command corresponding to the radio frequency antenna number.
A conflict scheduling system comprises the conflict scheduling device and the radio frequency antenna in the embodiment comprising the radio frequency antenna number; wherein,
the device sends a reading instruction corresponding to the radio frequency antenna number;
the radio frequency antenna reads the wireless signal after receiving the reading instruction corresponding to the radio frequency antenna number, and sends a completion instruction to the device after the reading is completed;
and the device judges whether the radio frequency antenna corresponding to the radio frequency antenna number in the work queue A finishes reading or not according to the return condition of the finishing instruction.
On the basis of the above embodiments, it is preferable that the number of the radio frequency antennas is greater than 4.
On the basis of any of the above embodiments, preferably, the radio frequency antenna and the device communicate with each other using a tcp protocol.
Compared with the prior art, the invention has the beneficial effects that:
the invention discloses a conflict scheduling method, a conflict scheduling device and a conflict scheduling system, which coordinate the work of elements which are possibly conflicted by using a central scheduling mode in the process of executing the work of a plurality of elements in parallel. The method is applied to conflict scheduling of the radio frequency antennas, a radio frequency antenna set which is being read and a radio frequency antenna set waiting to be read can be recorded, and the reading time of adjacent radio frequency antennas is staggered through scheduling of a certain algorithm, so that the reading operation of two adjacent radio frequency antennas is staggered in time, and the purpose of simultaneously reading a plurality of antennas in a macroscopic view is achieved.
Drawings
The invention is further illustrated with reference to the following figures and examples.
Fig. 1 is a flowchart illustrating a conflict scheduling method according to an embodiment of the present invention;
fig. 2 is a schematic structural diagram illustrating a conflict scheduling apparatus according to an embodiment of the present invention;
fig. 3 is a schematic structural diagram illustrating a conflict scheduling system according to an embodiment of the present invention.
Detailed Description
The present invention will be further described with reference to the accompanying drawings and the detailed description, and it should be noted that any combination of the embodiments or technical features described below can be used to form a new embodiment without conflict.
Detailed description of the preferred embodiment
As shown in fig. 1, an embodiment of the present invention provides a conflict scheduling method, including:
an initialization step S101, which is to initialize the work queue A, the waiting queue B and the temporary comparison queue C to make the work queue A and the temporary comparison queue C empty, and to put the elements waiting for executing work into the waiting queue B in sequence;
a comparison step S102, wherein the first two elements in the waiting queue B are moved into a temporary comparison queue C; comparing the elements in the temporary comparison queue C with the elements in the work queue A;
a working step S103, moving the elements which do not conflict with the work queue A in the temporary comparison queue C into the work queue A, and putting the elements which conflict with the work queue A in the temporary comparison queue C back to the waiting queue B; executing the work of the elements in the work queue A, and emptying the temporary comparison queue C;
a judging step S104, judging whether the work of the elements in the work queue A is finished; if the operation is finished, the elements which finish the operation are moved from the operation queue A to the bottom of the waiting queue B, and the comparison step S102 is carried out; if not, the process proceeds directly to the comparison step S102.
Preferably, before the comparing step S102, the embodiment of the present invention may further include: a conflict matrix obtaining step, namely obtaining a conflict matrix of elements according to a conflict relation in the execution work; in the comparing step, the elements in the temporary comparison queue C are compared with the elements in the work queue A according to the conflict matrix. This has the advantage that the collision relation between elements can be directly obtained from the collision matrix.
Preferably, the element may be a radio frequency antenna number; in the operating step, the element may operate by sending a reading instruction corresponding to the radio frequency antenna number.
In the embodiment of the invention, in the process of executing the work of a plurality of elements in parallel, the work of the elements which are possibly collided is coordinated by using a central scheduling mode. The method is applied to conflict scheduling of the radio frequency antennas, a radio frequency antenna set which is being read and a radio frequency antenna set waiting to be read can be recorded, and the reading time of adjacent radio frequency antennas is staggered through scheduling of a certain algorithm, so that the reading operation of two adjacent radio frequency antennas is staggered in time, and the purpose of simultaneously reading a plurality of antennas in a macroscopic view is achieved.
One application scenario of the present invention may be:
the antennas are No. 1, No. 2, No. 3, No. 4, No. 1, 2, 3 and No. 4 antennas which are arranged side by side, 1 can not work simultaneously with 2, 2 can not work simultaneously with 1 and 3, 3 can not work simultaneously with 2 and 4, 4 can not work simultaneously with 3, if the number of the antennas which can not work simultaneously is recorded as 0, the number of the antennas which can work simultaneously is recorded as 1, and a conflict matrix like the table I can be generated.
Watch 1
| Number 1 | Number 2 | No. 3 | Number 4 | |
| Number 1 | 1 | 0 | 1 | 1 |
| Number 2 | 0 | 1 | 0 | 1 |
| No. 3 | 1 | 0 | 1 | 0 |
| Number 4 | 1 | 1 | 0 | 1 |
3 queues are generated in the program:
the queue A is a work queue, when a program finds that data exists in the queue A, the program starts to work immediately, and the queue is empty during initialization;
the queue B is a queue to be worked, and all antenna lists to be worked are stored in the queue B during initialization;
queue C is a temporary compare queue.
Initialization is first performed as shown in table two:
watch two
| Queue A | And a queue B: | and C, queue C: |
| number 1 | ||
| Number 2 | ||
| No. 3 | ||
| Number 4 |
And (3) starting to work:
a first cycle, a first step: the first two elements in queue B are taken out and filled into queue C, with the results shown in Table three.
Watch III
| Queue A | And a queue B: | and C, queue C: |
| number 1 | Number 1 | |
| Number 2 | Number 2 | |
| No. 3 | ||
| Number 4 |
The first circulation and the second circulation are as follows: find the first element in C that exists and does not conflict with the existing elements in A, fill queue A, and remove the next element in queue B.
There are two cases for this step:
in the 1 st type, if the queue a is empty, the first queue in the queue C is directly taken out and put in, and meanwhile, the queue C is emptied and the working instruction of antenna No. 1 is sent, and the result is shown in table four:
watch four
| Queue A | And a queue B: | and C, queue C: |
| number 1 | ||
| Number 2 | ||
| No. 3 | ||
| Number 4 |
In the 2 nd type, if the queue A is not empty, then find the element x, x satisfies the following conditions, in the queue C, it is not in the queue A, it does not conflict with any element in the queue, whether the conflict can be known by checking the conflict matrix, if x satisfying these conditions can not be found, it can be skipped, and go to the next step.
The first circulation and the third step: and judging whether a reading result is returned or not, if so, judging whether the returned antenna is in the queue A or not, if so, removing the antenna from the queue A and putting the antenna into the bottom of the queue B, and assuming that no return exists at this moment.
The first circulation and the fourth step: and skipping to the first step and circulating.
The whole algorithm is continuously circulated in the above four steps, and the previous example can be continued in order to deduce the effectiveness of the algorithm.
Second circulation, first step: the first two elements in B are taken out and put into C, and the execution result is shown in the fifth table.
Watch five
| Queue A | And a queue B: | and C, queue C: |
| number 1 | Number 2 | |
| Number 2 | No. 3 | |
| No. 3 | ||
| Number 4 |
Second cycle, second step: as a result of the execution, only read instruction # 3 can be shifted in due to the conflict between # 2 and # 1, and the result is shown in Table six.
Watch six
| Queue A | And a queue B: | and C, queue C: |
| number 1 | Number 2 | |
| No. 3 | Number 4 | |
Second cycle, third step: and judging to return, and if the antenna No. 1 returns at the moment, moving the antenna No. 1 out of the queue A and returning the antenna No. 1 to the queue B, wherein the result is shown in a table seven.
Watch seven
| Queue A | And a queue B: | and C, queue C: |
| no. 3 | Number 2 | |
| Number 4 | ||
| Number 1 | ||
Second circulation, fourth step: returning to the first step and continuing the circulation.
The third circulation, the first step: two elements in queue B are taken out to fill queue C, and the result is shown in Table eight.
Table eight
Third cycle, second step: neither queue C, queue 2 nor queue 4, can move into queue A, and continue to the next step, with the results shown in Table nine.
Watch nine
| Queue A | And a queue B: | and C, queue C: |
| no. 3 | Number 2 | |
| Number 4 | ||
| Number 1 | ||
The third circulation, the third step: receiving the return of antenna number 3, move antenna number 3 in a to the end of B, and the result is shown in table ten.
Watch ten
| Queue A | And a queue B: | and C, queue C: |
| number 2 | ||
| Number 4 | ||
| Number 1 | ||
| No. 3 | ||
Fourth cycle, first step: the first two of B were shifted into C as shown in Table eleven.
Watch eleven
| Queue A | And a queue B: | and C, queue C: |
| number 2 | Number 2 | |
| Number 4 | Number 4 | |
| Number 1 | ||
| No. 3 | ||
Fourth cycle, second step: no. 2 in C is shifted into A and a read command is issued for No. 2, with the results shown in Table twelve.
Watch twelve
| Queue A | And a queue B: | and C, queue C: |
| number 2 | ||
| Number 4 | ||
| Number 1 | ||
| No. 3 | ||
Fourth cycle, third step: no returns were received, skipped, and the results are shown in table thirteen.
Watch thirteen
| Queue A | And a queue B: | and C, queue C: |
| number 2 | ||
| Number 4 | ||
| Number 1 | ||
| No. 3 | ||
A fifth cycle, a first step: the first two of B are brought out to C as shown in Table fourteen.
Table fourteen
| Queue A | And a queue B: | and C, queue C: |
| number 2 | Number 4 | |
| Number 4 | Number 1 | |
| Number 1 | ||
| No. 3 |
A fifth cycle, a second step: the 3 and 2 conflicts in C, the 4 No. conflict with 2 can take A and send the 4 read command, as shown in Table fifteen.
Fifteen items of table
| Queue A | And a queue B: | and C, queue C: |
| number 2 | Number 1 | |
| Number 4 | No. 3 | |
Fifth cycle, third step: a return of 2 is received and 2 is moved to B with the results shown in table sixteen.
Watch sixteen
| Queue A | And a queue B: | and C, queue C: |
| number 4 | Number 1 | |
| No. 3 | ||
| Number 2 | ||
As described above, after 5 cycles, all the antennas operate once, and no adjacent antennas operate simultaneously, and the smooth operation of all the antennas can be ensured by continuing the cycles.
In the first embodiment, a conflict scheduling method is provided, and correspondingly, a conflict scheduling apparatus is also provided. Since the apparatus embodiments are substantially similar to the method embodiments, they are described in a relatively simple manner, and reference may be made to some of the descriptions of the method embodiments for relevant points. The device embodiments described below are merely illustrative.
Detailed description of the invention
As shown in fig. 2, an embodiment of the present invention provides a conflict scheduling apparatus, including:
an initialization module 201 configured to perform:
initializing, namely initializing a work queue A, a waiting queue B and a temporary comparison queue C, enabling the work queue A and the temporary comparison queue C to be empty, and sequentially putting elements waiting for executing work into the waiting queue B;
a comparison module 202 configured to perform:
a comparison step, namely moving the first two elements in the waiting queue B into a temporary comparison queue C; comparing the elements in the temporary comparison queue C with the elements in the work queue A;
an operation module 203 for performing:
a working step, elements which do not conflict with the work queue A in the temporary comparison queue C are moved into the work queue A, and the elements which conflict with the work queue A in the temporary comparison queue C are put back into the waiting queue B; executing the work of the elements in the work queue A, and emptying the temporary comparison queue C;
a determining module 204, configured to perform:
judging whether the work of the elements in the work queue A is finished or not; if the operation is finished, the elements which finish the operation are moved from the operation queue A to the bottom of the waiting queue B, and the comparison step is carried out; if not, directly entering the comparison step.
Preferably, the apparatus may further include: a collision matrix acquisition module for performing: a conflict matrix obtaining step, namely obtaining a conflict matrix of elements according to a conflict relation in the execution work; and the comparison module is used for comparing the elements in the temporary comparison queue C with the elements in the work queue A according to the conflict matrix.
Preferably, the element may be a radio frequency antenna number; the element may operate by sending a read command corresponding to the rf antenna number.
In the embodiment of the invention, in the process of executing the work of a plurality of elements in parallel, the work of the elements which are possibly collided is coordinated by using a central scheduling mode. The method is applied to conflict scheduling of the radio frequency antennas, a radio frequency antenna set which is being read and a radio frequency antenna set waiting to be read can be recorded, and the reading time of adjacent radio frequency antennas is staggered through scheduling of a certain algorithm, so that the reading operation of two adjacent radio frequency antennas is staggered in time, and the purpose of simultaneously reading a plurality of antennas in a macroscopic view is achieved.
Detailed description of the preferred embodiment
As shown in fig. 3, an embodiment of the present invention provides a collision scheduling system, which includes a collision scheduling apparatus 301 and a radio frequency antenna 302 in a second embodiment, where the collision scheduling apparatus includes a radio frequency antenna number; wherein,
the device 301 sends a read command corresponding to the rf antenna number;
the radio frequency antenna 302 reads the wireless signal after receiving the reading instruction corresponding to the radio frequency antenna number, and sends a completion instruction to the device 301 after the reading is completed;
the device 301 determines whether the rf antenna 302 corresponding to the rf antenna number in the work queue a completes reading according to the return condition of the completion instruction.
The number of the radio frequency antennas 302 is not limited in the embodiment of the present invention, and preferably, the number of the radio frequency antennas may be greater than 4.
The communication method between the rf antenna 302 and the device 301 is not limited in the embodiment of the present invention, and preferably, the rf antenna 302 and the device 301 may communicate with each other using a tcp protocol.
In the embodiment of the invention, in the process of executing the work of a plurality of elements in parallel, the work of the elements which are possibly collided is coordinated by using a central scheduling mode. The method is applied to conflict scheduling of the radio frequency antennas, a radio frequency antenna set which is being read and a radio frequency antenna set waiting to be read can be recorded, and the reading time of adjacent radio frequency antennas is staggered through scheduling of a certain algorithm, so that the reading operation of two adjacent radio frequency antennas is staggered in time, and the purpose of simultaneously reading a plurality of antennas in a macroscopic view is achieved.
The present invention has been described in terms of its practical application, and it is to be understood that the above description and drawings are only illustrative of the presently preferred embodiments of the invention and are not to be considered as limiting, since all changes that come within the meaning and range of equivalency of the claims are to be embraced within their scope.
It should be noted that the embodiments and features of the embodiments may be combined with each other without conflict. Although the present invention has been described to a certain extent, it is apparent that appropriate changes in the respective conditions may be made without departing from the spirit and scope of the present invention. It is to be understood that the invention is not limited to the described embodiments, but is to be accorded the scope consistent with the claims, including equivalents of each element described. Various other modifications and changes may be made by those skilled in the art based on the above-described technical solutions and concepts, and all such modifications and changes should fall within the scope of the claims of the present invention.
Claims (9)
1. A method for conflict scheduling, comprising:
initializing, namely initializing a work queue A, a waiting queue B and a temporary comparison queue C, enabling the work queue A and the temporary comparison queue C to be empty, and sequentially putting elements waiting for executing work into the waiting queue B;
a comparison step, namely moving the first two elements in the waiting queue B into a temporary comparison queue C; comparing the elements in the temporary comparison queue C with the elements in the work queue A;
a working step, elements which do not conflict with the work queue A in the temporary comparison queue C are moved into the work queue A, and the elements which conflict with the work queue A in the temporary comparison queue C are put back into the waiting queue B; executing the work of the elements in the work queue A, and emptying the temporary comparison queue C;
judging whether the work of the elements in the work queue A is finished or not; if the operation is finished, the elements which finish the operation are moved from the operation queue A to the bottom of the waiting queue B, and the comparison step is carried out; if not, directly entering the comparison step.
2. The conflict scheduling method of claim 1, wherein:
before the comparing step, the method further comprises the following steps:
a conflict matrix obtaining step, namely obtaining a conflict matrix of elements according to a conflict relation in the execution work;
in the comparing step, the elements in the temporary comparison queue C are compared with the elements in the work queue A according to the conflict matrix.
3. The conflict scheduling method according to claim 1 or 2, wherein the element is a radio frequency antenna number;
in the working step, the element works by sending a reading instruction corresponding to the radio frequency antenna number.
4. A conflict scheduler, comprising:
an initialization module to perform:
initializing, namely initializing a work queue A, a waiting queue B and a temporary comparison queue C, enabling the work queue A and the temporary comparison queue C to be empty, and sequentially putting elements waiting for executing work into the waiting queue B;
a comparison module to perform:
a comparison step, namely moving the first two elements in the waiting queue B into a temporary comparison queue C; comparing the elements in the temporary comparison queue C with the elements in the work queue A;
a work module to perform:
a working step, elements which do not conflict with the work queue A in the temporary comparison queue C are moved into the work queue A, and the elements which conflict with the work queue A in the temporary comparison queue C are put back into the waiting queue B; executing the work of the elements in the work queue A, and emptying the temporary comparison queue C;
a judging module for executing:
judging whether the work of the elements in the work queue A is finished or not; if the operation is finished, the elements which finish the operation are moved from the operation queue A to the bottom of the waiting queue B, and the comparison step is carried out; if not, directly entering the comparison step.
5. The conflict scheduler of claim 4, further comprising:
a collision matrix acquisition module for performing:
a conflict matrix obtaining step, namely obtaining a conflict matrix of elements according to a conflict relation in the execution work;
and the comparison module is used for comparing the elements in the temporary comparison queue C with the elements in the work queue A according to the conflict matrix.
6. The conflict scheduler of claim 4 or 5, wherein the element is a radio frequency antenna number; the element operates to send a read command corresponding to the radio frequency antenna number.
7. A collision scheduling system comprising the collision scheduling apparatus of claim 6 and a radio frequency antenna; wherein,
the device sends a reading instruction corresponding to the radio frequency antenna number;
the radio frequency antenna reads the wireless signal after receiving the reading instruction corresponding to the radio frequency antenna number, and sends a completion instruction to the device after the reading is completed;
and the device judges whether the radio frequency antenna corresponding to the radio frequency antenna number in the work queue A finishes reading or not according to the return condition of the finishing instruction.
8. The collision scheduling system of claim 7, wherein the number of radio frequency antennas is greater than 4.
9. The conflict scheduling system of claim 7 or 8, wherein the radio frequency antenna and the device communicate using tcp protocol.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711482644.9A CN108366383A (en) | 2017-12-29 | 2017-12-29 | Conflict scheduling method, apparatus and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711482644.9A CN108366383A (en) | 2017-12-29 | 2017-12-29 | Conflict scheduling method, apparatus and system |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN108366383A true CN108366383A (en) | 2018-08-03 |
Family
ID=63010679
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711482644.9A Pending CN108366383A (en) | 2017-12-29 | 2017-12-29 | Conflict scheduling method, apparatus and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108366383A (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1432916A (en) * | 2002-11-01 | 2003-07-30 | 英业达股份有限公司 | Multiple-thread automatic test method |
| CN2884708Y (en) * | 2004-01-08 | 2007-03-28 | 美商内数位科技公司 | Packet scheduling in a wireless local area network |
| US7631132B1 (en) * | 2004-12-27 | 2009-12-08 | Unisys Corporation | Method and apparatus for prioritized transaction queuing |
| CN102441273A (en) * | 2010-10-05 | 2012-05-09 | 环球娱乐株式会社 | Gaming table device having a game table on which the game medium is disposed |
| CN103268258A (en) * | 2013-04-27 | 2013-08-28 | 中国空间技术研究院 | Satellite ground remote-control order-issuing safe controlling method |
| CN103793362A (en) * | 2013-12-02 | 2014-05-14 | 电子科技大学 | Reader priority based static reader scheduling policy |
-
2017
- 2017-12-29 CN CN201711482644.9A patent/CN108366383A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1432916A (en) * | 2002-11-01 | 2003-07-30 | 英业达股份有限公司 | Multiple-thread automatic test method |
| CN2884708Y (en) * | 2004-01-08 | 2007-03-28 | 美商内数位科技公司 | Packet scheduling in a wireless local area network |
| US7631132B1 (en) * | 2004-12-27 | 2009-12-08 | Unisys Corporation | Method and apparatus for prioritized transaction queuing |
| CN102441273A (en) * | 2010-10-05 | 2012-05-09 | 环球娱乐株式会社 | Gaming table device having a game table on which the game medium is disposed |
| CN103268258A (en) * | 2013-04-27 | 2013-08-28 | 中国空间技术研究院 | Satellite ground remote-control order-issuing safe controlling method |
| CN103793362A (en) * | 2013-12-02 | 2014-05-14 | 电子科技大学 | Reader priority based static reader scheduling policy |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11276036B1 (en) | Order processing method, apparatus, device, system, and storage medium | |
| CN110059926B (en) | Sorting scheduling method and device, warehousing system and readable storage medium | |
| US5293620A (en) | Method apparatus for scheduling tasks in repeated iterations in a digital data processing system having multiple processors | |
| US8806498B2 (en) | Method and system for resolving dependency among the enqueued works and/or finished works and scheduling the dependency-resolved works | |
| US20090134975A1 (en) | Tag estimation method and tag identification method for rfid system | |
| CN108710531B (en) | Data writing method and device of circular queue, terminal equipment and storage medium | |
| CN105608531A (en) | Task dispatching method and device | |
| CN111382889A (en) | Warehouse location recommendation method, device, equipment and medium | |
| US11983564B2 (en) | Scheduling of a plurality of graphic processing units | |
| CN112464410B (en) | Method and device for determining workpiece grabbing sequence, computer equipment and medium | |
| CN111246500B (en) | Bluetooth channel evaluation method, device and storage medium for recognizing wifi interference | |
| CN108366383A (en) | Conflict scheduling method, apparatus and system | |
| CN117149388A (en) | Batch task scheduling method and system, electronic equipment and storage medium | |
| US8115603B2 (en) | Method for identifying multiple moving tags with multiple readers | |
| CN109656730B (en) | Cache access method and device | |
| CN114265808A (en) | Communication method, device, Profibus DP master station and medium | |
| CN103778005A (en) | Automatic task allocation method and device | |
| CN109871939B (en) | Image processing method and image processing device | |
| US20220147024A1 (en) | Assigning tools to spaces in a tool magazine | |
| CN109240815B (en) | Multi-task running method, device and equipment for shared stack | |
| RU2019131128A (en) | SYSTEMS AND METHODS FOR RETURNING SPECTRUM RESOURCES | |
| CN113488410B (en) | Semiconductor process equipment and control method and device for moving parts thereof | |
| CN106484689B (en) | Data processing method and device | |
| CN103530742A (en) | Method and device for increasing scheduling operation speed | |
| CN110442619B (en) | Search result ordering method and device, electronic equipment and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20180803 |
|
| RJ01 | Rejection of invention patent application after publication |