CN113971144A - Dynamic hybrid lottery method for multiprocessor priority arbitration - Google Patents
Dynamic hybrid lottery method for multiprocessor priority arbitration Download PDFInfo
- Publication number
- CN113971144A CN113971144A CN202111254497.6A CN202111254497A CN113971144A CN 113971144 A CN113971144 A CN 113971144A CN 202111254497 A CN202111254497 A CN 202111254497A CN 113971144 A CN113971144 A CN 113971144A
- Authority
- CN
- China
- Prior art keywords
- lottery
- master
- time
- weight
- request
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 23
- 230000002123 temporal effect Effects 0.000 claims description 4
- 238000004364 calculation method Methods 0.000 abstract description 6
- 230000005540 biological transmission Effects 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 150000001875 compounds Chemical class 0.000 description 1
- 230000002349 favourable effect Effects 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
- 230000036962 time dependent Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F13/00—Interconnection of, or transfer of information or other signals between, memories, input/output devices or central processing units
- G06F13/14—Handling requests for interconnection or transfer
- G06F13/16—Handling requests for interconnection or transfer for access to memory bus
- G06F13/1605—Handling requests for interconnection or transfer for access to memory bus based on arbitration
- G06F13/1652—Handling requests for interconnection or transfer for access to memory bus based on arbitration in a multiprocessor architecture
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F13/00—Interconnection of, or transfer of information or other signals between, memories, input/output devices or central processing units
- G06F13/14—Handling requests for interconnection or transfer
- G06F13/16—Handling requests for interconnection or transfer for access to memory bus
- G06F13/18—Handling requests for interconnection or transfer for access to memory bus based on priority control
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
- G06F7/58—Random or pseudo-random number generators
- G06F7/588—Random number generators, i.e. based on natural stochastic processes
-
- G—PHYSICS
- G07—CHECKING-DEVICES
- G07C—TIME OR ATTENDANCE REGISTERS; REGISTERING OR INDICATING THE WORKING OF MACHINES; GENERATING RANDOM NUMBERS; VOTING OR LOTTERY APPARATUS; ARRANGEMENTS, SYSTEMS OR APPARATUS FOR CHECKING NOT PROVIDED FOR ELSEWHERE
- G07C15/00—Generating random numbers; Lottery apparatus
- G07C15/006—Generating random numbers; Lottery apparatus electronically
Abstract
The invention relates to a dynamic hybrid lottery method for multiprocessor priority arbitration, which comprises the following steps: the lottery generator dynamically generates the initial lottery number of each main device, and the initial lottery number takes any value in each clock period within a set interval range; calculating the time weight f (t) of each main device according to the sequence of the request time; calculating the total number of lottery ticket holdings of each main device after considering the time weight; the random number generator generates a random number, compares the random number with the total number of lottery ticket holdings of each master device, and selects the corresponding master device for output. The invention not only considers that the main equipment with higher priority is endowed with more lottery numbers, but also considers that the lottery numbers obtained by the main equipment are influenced by the time when the main equipment sends the request, and the earlier the request time is, the more the lottery numbers are; the proposed time weight function modifies the existing lottery calculation method, so that the factor of the request time is fully considered in the lottery number calculation.
Description
Technical Field
The invention relates to the technical field of integrated circuit design, in particular to a dynamic hybrid lottery method for multiprocessor priority arbitration.
Background
For a board level system with multiple processors, when there are multiple master devices requesting to contend for the same transmission channel, the priority of the lottery ticket is more widely used because different devices can be given different priorities with different weights, and the devices with higher priorities have more lottery tickets. However, conventional lottery priorities, either static or dynamic, do not take into account the time of the message request and decide which device to respond to based only on the number of tickets generated, which may result in some requests that may not be responded to even though early.
In some specific situations, it is required that information transmission between the master device and the slave device reaches load balancing, and this way may result in some devices being in "busy" state and other devices being in "idle" state, which obviously is not favorable for balanced distribution of information flow between devices. Whether the priority of the equipment is considered or not is considered, the factor of the sequence of the request time is properly taken into consideration, and how to embody the variable of the request time on the basis of the original priority is an urgent problem to be solved.
Disclosure of Invention
The invention aims to provide an arbitration method giving consideration to both lottery priority and first-come-first-serve, and a dynamic hybrid lottery method for multiprocessor priority arbitration, which modulates the lottery priority by using request time.
In order to achieve the purpose, the invention adopts the following technical scheme: a dynamic hybrid lottery method for multiprocessor priority arbitration, the method comprising the sequential steps of:
the method comprises the following steps in sequence:
(1) the lottery generator dynamically generates the initial lottery number of each main device, and the initial lottery number takes any value in each clock cycle within a set interval range;
(2) calculating the time weight f (t) of each main device according to the sequence of the request time;
(3) calculating the total number of lottery ticket holdings of each main device after considering the time weight;
(4) and (4) generating a random number by a random number generator, comparing the random number with the total number of the lottery held by each main device obtained in the step (3), and selecting the corresponding main device for output.
In step (2), the time weight f (t) of each master device is calculated as follows:
f(t)＝(n-i+1)/n (1)
in the formula, n is the total number of the main equipment; i is the order of sending the requests, and the order corresponds to the sequence of the request time;
distributing weight according to the request time, wherein the earlier the request time is, the greater the weight is; assuming that the total number of the master devices is n and the order of the master device requests is i, the time weight of the master device requests is (n-i +1)/n, so that the device with the earliest request time, i.e. the device with the 1 st request, has a weight of 1, and as time sequentially moves backwards, the time weight of the master device is sequentially (n-1)/n, (n-2)/n,. once, 2/n, 1/n.
The step (3) specifically comprises the following steps: adding a time weight to the number of tickets generated by the ticket generator, resulting in a total number of ticket holders for each master device after considering the time weight:
assuming that there are n master devices, each master device generates a total of s lottery ticket holders0＝r0*b0f0(t)， s1＝r1*b1f1(t)+s0，s2＝r2*b2f2(t)+s1，...，sn-1＝rn-1*bn-1fn-1(t)+sn-2，sn＝rn*bnfn(t)+sn-1(ii) a Wherein r is0,r1,r2,rn-1,rnThe number of tickets initially allocated for master device n-1 and master device n, which dynamically changes over time in the dynamic lottery priority method, is master device 0, master device 1, master device 2, ·; b0，b1，b2，...， bn-1，bnRespectively indicating that a main device 0, a main device 1, a main device 2, a main device n-1 and a main device n send out requests, if the requests are sent out, the value is 1, otherwise, the value is 0; f. of0，f1，f2，...，fn-1，fnRepresenting the time weights of master 0, master 1, master 2,. and master n-1, respectively.
The step (4) specifically comprises the following steps: generating a random number C by a random number generator if the value of C is (0, s)0) Selecting a first master device within the range; if the value of C is in(s)0,s1) Selecting a second master device within the range; if the value of C is in(s)1,s2) Selecting a third main device within the range; if the value of C is in(s)n-1,sn) Within the range, selecting the nth main equipment; when the request signal is valid and the permission signal is valid, the selected device is output as the device having the highest priority.
According to the technical scheme, the beneficial effects of the invention are as follows: firstly, the invention considers that the main equipment with higher priority is endowed with more lottery numbers, and the lottery numbers obtained by the main equipment are influenced by the time when the main equipment sends the request, under the condition that other conditions are not changed, the earlier the request time is, the more the lottery numbers are; secondly, the invention provides a function expression of time weight, the weight function is in direct proportion to the sequence of the request time, and the earlier the request time is, the larger the value of the weight function is; thirdly, the present invention modifies the existing lottery ticket calculation method by using the proposed time weight function, so that the lottery ticket number calculation fully considers the time factor.
Drawings
FIG. 1 is a schematic diagram of time weight assignment;
FIG. 2 is a schematic illustration of arbitration priorities of dynamic hybrid lottery tickets requiring time modulation;
FIG. 3 is a schematic diagram of the time weights of four master devices in a lottery priority arbitration method;
FIG. 4 is a flow chart of the method of the present invention.
Detailed Description
As shown in fig. 4, a dynamic hybrid lottery method for multiprocessor priority arbitration, the method comprising the sequential steps of:
the method comprises the following steps in sequence:
(1) the lottery generator dynamically generates the initial lottery number of each main device, and the initial lottery number takes any value in each clock cycle within a set interval range; the lottery generator may be implemented with a random number generator;
(2) calculating the time weight f (t) of each main device according to the sequence of the request time;
(3) calculating the total number of lottery ticket holdings of each main device after considering the time weight;
(4) and (4) generating a random number by a random number generator, comparing the random number with the total number of the lottery held by each main device obtained in the step (3), and selecting the corresponding main device for output.
In step (2), the time weight f (t) of each master device is calculated as follows:
f(t)＝(n-i+1)/n (1)
in the formula, n is the total number of the main equipment; i is the order of sending the requests, and the order corresponds to the sequence of the request time;
distributing weight according to the request time, wherein the earlier the request time is, the greater the weight is; assuming that the total number of the master devices is n and the order of the master device requests is i, the time weight of the master device requests is (n-i +1)/n, so that the device with the earliest request time, i.e. the device with the 1 st request, has a weight of 1, and as time sequentially moves backwards, the time weight of the master device is sequentially (n-1)/n, (n-2)/n,. once, 2/n, 1/n.
The step (3) specifically comprises the following steps: adding a time weight to the number of tickets generated by the ticket generator, resulting in a total number of ticket holders for each master device after considering the time weight:
assuming that there are n master devices, each master device generates a total of s lottery ticket holders0＝r0*b0f0(t)， s1＝r1*b1f1(t)+s0，s2＝r2*b2f2(t)+s1，...，sn-1＝rn-1*bn-1fn-1(t)+sn-2，sn＝rn*bnfn(t)+sn-1(ii) a Wherein r is0,r1,r2,rn-1,rnThe number of tickets initially allocated for master device n-1 and master device n, which dynamically changes over time in the dynamic lottery priority method, is master device 0, master device 1, master device 2, ·; b0，b1，b2，...， bn-1，bnRespectively indicating that a main device 0, a main device 1, a main device 2, a main device n-1 and a main device n send out requests, if the requests are sent out, the value is 1, otherwise, the value is 0; f. of0，f1，f2，...，fn-1，fnRepresenting the time weights of master 0, master 1, master 2,. and master n-1, respectively.
The step (4) specifically comprises the following steps: generating a random number C by a random number generator if the value of C is (0, s)0) Selecting a first master device within the range; if the value of C is in(s)0,s1) Selecting a second master device within the range; if the value of C is in(s)1,s2) Selecting a third main device within the range; if the value of C is in(s)n-1,sn) Within the range, selecting the nth main equipment;when the request signal is valid and the permission signal is valid, the selected device is output as the device having the highest priority. Here, the request signal means b issued by the master device0、b1、b2And b3When the request signal is valid, the value is 1, and when the request signal is invalid, the value is 0; the enabling signal is g sent by the answering device0、g1、g2、 g3When the enable signal is valid, the value is 1, and when the enable signal is invalid, the value is 0.
The invention is further described below with reference to fig. 1 to 4.
As shown in fig. 1, Master X, Master Y,.,. Master K, Master Q,.., Master C, and Master D sequentially enter the circular queue in chronological order. Assuming that the total number of masters is n, the request time assignment weights are as follows:
assuming that the total number of masters is n and the order of master requests is i, the temporal weight of the master request is (n-i +1)/n, so that the device with the earliest request time, i.e., the 1 st requested device, has a weight of 1, and as time sequentially moves backward, the temporal weight of the master is sequentially (n-1)/n, (n-2)/n.
As shown in fig. 2, a variable of the request time is added to the number of tickets generated based on the conventional dynamic lottery priority arbitration. In the figure r0,r1,r2And r3The lottery numbers are distributed to the main equipment 0, the main equipment 1, the main equipment 2 and the main equipment 3 at the beginning, and the lottery numbers corresponding to different main equipment in each clock period are dynamically changed. The conventional main device demand signal is a time-independent boolean variable, which is set to 1 when requested; when there is no request, the demand signal is set to 0. Unlike the conventional dynamic lottery ticket generation method, the present invention proposes to set the demand signal as a function of time, i.e., b0f0(t)、b1f1(t)、b2f2(t) and b3f3(t) wherein b0、b1、b2And b3Is a Boolean variable, which indicates whether a request signal is sent, and takes a value of only 0 or1, respectively. f. of0(t)、f1(t)、f2(t) and f3(t) is a time dependent weighting function. At r0,r1,r2And r3And b is0f0(t)、b1f1(t)、b2f2(t) and b3f3(t) under the combined action of the two lottery tickets, the number of the generated lottery tickets is s0＝r0*b0f0(t)、s1＝r1*b1f1(t)+s0、s2＝r2*b2f2(t)+s1And s3＝r3*b3f3(t)+s2. At this time, the random number and s generated by the random number generator0、s1、s2And s3By comparison, a priority order, g, is generated0、 g1、g2、g3Indicating an enable signal, and sequentially selecting the master device with the highest priority to respond when the enable signal is effective.
As shown in fig. 3, if the master device 0, the master device 1, the master device 2, and the master device 3 are enqueued for the 2 nd, the 4 th, the 3 rd, and the 1 st according to the time-first-later order. Then the time weights of master 0, master 1, master 2, and master 3 are respectively according to the formula (n-i +1)/n (where n is the total number of devices, i is the enqueue order, and the earlier the order is, meaning the earlier the request time is): 3/4,1/4,2/4,1.
Based on the time weights calculated in FIG. 3, the total number s of each master device lottery ticket held by the lottery generator in FIG. 20，s1，s2And s3Can be written as formula (1)
In the formula (I), the compound is shown in the specification,
denotes rounding up, r0,r1,r2And r3Number of initial lottery ticket held for each master device, b0、b1、b2And b3Whether a request signal is sent or not is shown, if so, the value is 1, otherwise, the value is 0.
In summary, the present invention considers that the number of lottery tickets given to the master device with higher priority is larger, and also considers that the number of lottery tickets obtained by the master device is influenced by the time when the master device makes a request, and under the condition that other conditions are not changed, the earlier the request time is, the more the lottery tickets are; secondly, the invention provides a function expression of time weight, the weight function is in direct proportion to the sequence of the request time, and the earlier the request time is, the larger the value of the weight function is; thirdly, the present invention modifies the existing lottery ticket calculation method by using the proposed time weight function, so that the lottery ticket number calculation fully considers the time factor.
Claims (4)
1. A dynamic hybrid lottery method for multiprocessor priority arbitration, characterized by: the method comprises the following steps in sequence:
(1) the lottery generator dynamically generates the initial lottery number of each main device, and the initial lottery number takes any value in each clock period within a set interval range;
(2) calculating the time weight f (t) of each main device according to the sequence of the request time;
(3) calculating the total number of lottery ticket holdings of each main device after considering the time weight;
(4) and (4) generating a random number by a random number generator, comparing the random number with the total number of the lottery held by each main device obtained in the step (3), and selecting the corresponding main device for output.
2. The dynamic hybrid lottery method for multiprocessor priority arbitration of claim 1, wherein: in step (2), the time weight f (t) of each master device is calculated as follows:
f(t)＝(n-i+1)/n (1)
in the formula, n is the total number of the main equipment; i is the order of sending the requests, and the order corresponds to the sequence of the request time;
distributing weight according to the request time, wherein the earlier the request time is, the greater the weight is; assuming that the total number of masters is n and the order of master requests is i, the temporal weight of the master request is (n-i +1)/n, so that the device with the earliest request time, i.e., the 1 st requested device, has a weight of 1, and as time sequentially moves backward, the temporal weight of the master is sequentially (n-1)/n, (n-2)/n.
3. The dynamic hybrid lottery method for multiprocessor priority arbitration of claim 1, wherein: the step (3) specifically comprises the following steps: adding a time weight to the number of tickets generated by the ticket generator, resulting in a total number of ticket holders for each master device after considering the time weight:
assuming that there are n master devices, each master device generates a total of s lottery ticket holders0＝r0*b0f0(t)，s1＝r1*b1f1(t)+s0，s2＝r2*b2f2(t)+s1，...，sn-1＝rn-1*bn-1fn-1(t)+sn-2，sn＝rn*bnfn(t)+sn-1(ii) a Wherein r is0,r1,r2,rn-1,rnThe number of initially assigned tickets for master device 0, master device 1, master device 2, and master device n-1 and master device n, respectively, which dynamically changes over time in a dynamic lottery priority method; b0，b1，b2，...，bn-1，bnRespectively indicating that a main device 0, a main device 1, a main device 2, a main device n-1 and a main device n send out requests, if the requests are sent out, the value is 1, otherwise, the value is 0; f. of0，f1，f2，...，fn-1，fnRepresenting the time weights of master 0, master 1, master 2,. and master n-1 and master n, respectivelyAnd (4) heavy.
4. The dynamic hybrid lottery method for multiprocessor priority arbitration of claim 1, wherein: the step (4) specifically comprises the following steps: generating a random number C by a random number generator if the value of C is (0, s)0) Selecting a first master device within the range; if the value of C is in(s)0,s1) Selecting a second master device within the range; if the value of C is in(s)1,s2) Selecting a third main device within the range; if the value of C is in(s)n-1,sn) Within the range, selecting the nth main equipment; when the request signal is valid and the permission signal is valid, the selected device is output as the device having the highest priority.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111254497.6A CN113971144B (en) | 2021-10-27 | 2021-10-27 | Dynamic mixed lottery method for multiprocessor priority arbitration |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111254497.6A CN113971144B (en) | 2021-10-27 | 2021-10-27 | Dynamic mixed lottery method for multiprocessor priority arbitration |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113971144A true CN113971144A (en) | 2022-01-25 |
| CN113971144B CN113971144B (en) | 2024-04-16 |
Family
ID=79588574
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111254497.6A Active CN113971144B (en) | 2021-10-27 | 2021-10-27 | Dynamic mixed lottery method for multiprocessor priority arbitration |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113971144B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115580585A (en) * | 2022-11-17 | 2023-01-06 | 沐曦集成电路(南京)有限公司 | Balanced arbitration method based on arbiter |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5463624A (en) * | 1994-04-15 | 1995-10-31 | Dsc Communications Corporation | Bus arbitration method for telecommunications switching |
| US5956493A (en) * | 1996-03-08 | 1999-09-21 | Advanced Micro Devices, Inc. | Bus arbiter including programmable request latency counters for varying arbitration priority |
| US20020129181A1 (en) * | 2001-01-03 | 2002-09-12 | Nec Usa, Inc. | High-performance communication architecture for circuit designs |
| CN102576350A (en) * | 2009-08-21 | 2012-07-11 | 谷歌公司 | System and method of caching information |
| CN103299271A (en) * | 2011-01-11 | 2013-09-11 | 惠普发展公司，有限责任合伙企业 | Concurrent request scheduling |
| CN107301546A (en) * | 2017-05-03 | 2017-10-27 | 北京众享比特科技有限公司 | Generating random number and methods for using them and device |
| US20210050045A1 (en) * | 2019-08-16 | 2021-02-18 | Micron Technology, Inc. | Memory element for weight update in a neural network |
| US20210124696A1 (en) * | 2019-10-23 | 2021-04-29 | Infineon Technologies Ag | Device for a single wire digital bus, master device, sensor, and method to assign addresses to multiple devices on a single wire digital bus |
| JP2021082103A (en) * | 2019-11-21 | 2021-05-27 | ルネサスエレクトロニクス株式会社 | Arbitration circuit, data forwarding system, and arbitration method by arbitration circuit |
-
2021
- 2021-10-27 CN CN202111254497.6A patent/CN113971144B/en active Active
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5463624A (en) * | 1994-04-15 | 1995-10-31 | Dsc Communications Corporation | Bus arbitration method for telecommunications switching |
| US5956493A (en) * | 1996-03-08 | 1999-09-21 | Advanced Micro Devices, Inc. | Bus arbiter including programmable request latency counters for varying arbitration priority |
| US20020129181A1 (en) * | 2001-01-03 | 2002-09-12 | Nec Usa, Inc. | High-performance communication architecture for circuit designs |
| CN102576350A (en) * | 2009-08-21 | 2012-07-11 | 谷歌公司 | System and method of caching information |
| CN103299271A (en) * | 2011-01-11 | 2013-09-11 | 惠普发展公司，有限责任合伙企业 | Concurrent request scheduling |
| CN107301546A (en) * | 2017-05-03 | 2017-10-27 | 北京众享比特科技有限公司 | Generating random number and methods for using them and device |
| US20210050045A1 (en) * | 2019-08-16 | 2021-02-18 | Micron Technology, Inc. | Memory element for weight update in a neural network |
| US20210124696A1 (en) * | 2019-10-23 | 2021-04-29 | Infineon Technologies Ag | Device for a single wire digital bus, master device, sensor, and method to assign addresses to multiple devices on a single wire digital bus |
| JP2021082103A (en) * | 2019-11-21 | 2021-05-27 | ルネサスエレクトロニクス株式会社 | Arbitration circuit, data forwarding system, and arbitration method by arbitration circuit |
Non-Patent Citations (4)
| Title |
|---|
| KHANAM, R ETAL: "Design a low latency Arbiter for on chip Communication Architecture", 《 2015 INTERNATIONAL CONFERENCE ON COMPUTING, COMMUNICATION & AUTOMATION (ICCCA)》, 22 September 2016 (2016-09-22), pages 1421 - 1426 * |
| T. TAKIZAWA ETAL: "An efficient memory arbitration algorithm for a single chip MPEG2 AV decoder", 《2001 INTERNATIONAL CONFERENCE ON CONSUMER ELECTRONICS, DIGEST OF TECHNICAL PAPERS》, 21 July 2001 (2001-07-21), pages 182 - 183 * |
| 檀明 等: "面向抖动优化的任务静态优先级指派算法", 《计算机工程》, vol. 38, no. 20, 20 October 2012 (2012-10-20), pages 282 - 285 * |
| 赵琳: "多路总线仲裁算法优化研究", 《电子设计工程》, vol. 26, no. 07, 5 April 2018 (2018-04-05), pages 14 - 17 * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115580585A (en) * | 2022-11-17 | 2023-01-06 | 沐曦集成电路(南京)有限公司 | Balanced arbitration method based on arbiter |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113971144B (en) | 2024-04-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7577780B2 (en) | Fine-grained bandwidth control arbiter and the method thereof | |
| CN111210136B (en) | Robot task scheduling method and server | |
| US20130339977A1 (en) | Managing task load in a multiprocessing environment | |
| Stüdli et al. | Optimal real-time distributed V2G and G2V management of electric vehicles | |
| CN105205020B (en) | It arbitrates to direct memory access channel request | |
| CN113971144A (en) | Dynamic hybrid lottery method for multiprocessor priority arbitration | |
| CN109543947A (en) | Method, apparatus and terminal device based on the task distribution for surveying grid | |
| CN100514316C (en) | Dynamic self-adaptive bus arbiter based on microprocessor-on-chip | |
| CN111284347B (en) | State clustering coding method in charging station vehicle access control | |
| CN109087524A (en) | Parking stall distribution method and device | |
| CN104581967A (en) | Method for adjusting contention access resource, and method and device for sending contention access request | |
| CN116991585A (en) | Automatic AI calculation power scheduling method, device and medium | |
| CN113283778A (en) | Layered convergence federated learning method based on security evaluation | |
| CN109615920A (en) | The creation method and relevant device of virtual parking area | |
| US6754658B1 (en) | Database server processing system, method, program and program storage device | |
| CN115499306B (en) | Method and device for constructing flow scheduling model, electronic equipment and storage medium | |
| Chen et al. | A real-time and bandwidth guaranteed arbitration algorithm for SoC bus communication | |
| CN103051548B (en) | Based on hierarchical organization method and the organization system of communication delay | |
| CN115190127A (en) | Evidence storing method, device and system for computing power service | |
| US8489752B2 (en) | Method and system for controlling bus access | |
| CN110234167A (en) | A kind of method for channel allocation, channel dividing arrangement and electronic equipment | |
| CN104917692B (en) | A kind of method and apparatus for distributing token | |
| CN114091932A (en) | Resource scheduling method, device, medium and electronic equipment | |
| CN107707383B (en) | Put-through processing method and device, first network element and second network element | |
| CN112114949A (en) | Service scheduling method and system for cloud computing |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |