CN105824769B - A kind of configurable dynamic time piece robin scheduling method - Google Patents
A kind of configurable dynamic time piece robin scheduling method Download PDFInfo
- Publication number
- CN105824769B CN105824769B CN201610147991.5A CN201610147991A CN105824769B CN 105824769 B CN105824769 B CN 105824769B CN 201610147991 A CN201610147991 A CN 201610147991A CN 105824769 B CN105824769 B CN 105824769B
- Authority
- CN
- China
- Prior art keywords
- unit
- tracking cell
- online
- online tracking
- response
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
- 238000000034 method Methods 0.000 title claims abstract description 11
- 241001522296 Erithacus rubecula Species 0.000 title claims abstract description 10
- 230000004044 response Effects 0.000 claims description 115
- 230000003139 buffering effect Effects 0.000 claims description 15
- 230000015572 biosynthetic process Effects 0.000 abstract description 4
- 238000003786 synthesis reaction Methods 0.000 abstract description 4
- 230000005540 biological transmission Effects 0.000 description 2
- 230000003068 static effect Effects 0.000 description 2
- 239000002699 waste material Substances 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 235000013399 edible fruits Nutrition 0.000 description 1
- 230000002452 interceptive effect Effects 0.000 description 1
- 238000010606 normalization Methods 0.000 description 1
- 238000012795 verification Methods 0.000 description 1
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/36—Handling requests for interconnection or transfer for access to common bus or bus system
- G06F13/362—Handling requests for interconnection or transfer for access to common bus or bus system with centralised access control
- G06F13/366—Handling requests for interconnection or transfer for access to common bus or bus system with centralised access control using a centralised polling arbiter
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2213/00—Indexing scheme relating to interconnection of, or transfer of information or other signals between, memories, input/output devices or central processing units
- G06F2213/36—Arbitration
Abstract
The invention discloses a kind of configurable dynamic time piece robin scheduling method, the dispatching algorithm multiple online tracking cell suitable for online tracking system need by single coffret carry out data output the case where.The algorithm is by configuring corresponding threshold value, time leaf length and priority, in conjunction with the Mobile Forms judgement to online tracking cell, is arbitrated to the data output request of each online tracking cell using two kinds of inquiry modes.The present invention can realize the synthesis to multichannel tracking data under the premise of low consumption of resources, low data flood rate and enhanced scalability, to solve most scheduling problems according to buffer queue in online tracking system.
Description
Technical field
The invention belongs to arbitration field, specifically a kind of combination thresholding and Mobile Forms judge configurable
Dynamic time piece robin scheduling method.
Background technology
When heterogeneous polynuclear SoC is increasingly becoming the mainstream of integrated circuit, quickly and effectively debugging technique has become reduction
The key of SoC design cost.On-line debugging technology can obtain desired tune in real time in the case where not interfering multiple nucleus system to run completely
Information is tried, is the important research direction of debugging design.On-line debugging necessarily involves the design of online tracking system, for reduction pair
The occupancy of chip pin resource, an output port is usually only arranged in online tracking system, therefore output port becomes online tracking
The bandwidth bottleneck of system.For the online tracking of multiple nucleus system, the tracking data of more resource nodes needs to converge to single
Coffret is tracked, is the key that the online Tracking skill of multiple nucleus system according to the synthesis dispatching algorithm of buffer queue for majority
The key factor of one of art and determination data efficiency of transmission and Buffer Utilization.Its design often need to consider data flood rates,
Queue priority, queue handover overhead, area-constrained and time-constrain etc..
The dispatching method of the online tracking data synthesis of common solution has：Trace in the CoreSight frameworks of ARM
Funnel modules.The module for each queue by being arranged mutually different priority and the identical minimum response granularity of individual queue
HTC (Hold Time Cycle) is at least HTC using non-preemptive limit preferential answering mode per secondary response.This scheduling
The hardware spending of mode is small, but limit preferential answering mode often results in the cushion space of high-priority queue and not yet makes full use of
And Low Priority Queuing overflows seriously；For another example LBF (Local Binary Fitting) algorithm preferential answering normalizes buffering area
Length maximum buffering queue (to the ratio between long and buffer capacity), but normalization needs divide operations so that and the algorithm is realized multiple
It is miscellaneous, and being compared to each other between buffer length is so that autgmentability is poor；Buffering queue does not have priority difference, does not consider to reduce yet
Queue switching times；Also have the method that is responded to each priority query according to different probability of proposing, but generate random number and
The hardware costs of related operation is excessively high.
Invention content
The present invention is to provide a kind of configurable dynamic time piece rotation to overcome the shortcomings of the prior art place
Dispatching method tracks multichannel to be realized under the premise of low consumption of resources, low data flood rate and enhanced scalability
The synthesis of data, so as to solve most scheduling problems according to buffer queue in online tracking system.
The present invention is to solve technical problem to adopt the following technical scheme that：
A kind of configurable dynamic time piece robin scheduling method of the present invention is applied in online tracking system, described
Tracking system includes online：N online tracking cell, a bus arbiter unit and a tracking coffret；The n exists
Line tracking cell corresponds respectively to n resource node, meets with a response for acquiring the data in respective resources node, and in request
After send data to the bus arbiter unit；The bus arbiter unit is defeated by tracking coffret progress data
Go out；Its main feature is that the bus arbiter unit is to carry out dynamic time piece robin scheduling to request as follows：
Step 1, setting thresholding
Corresponding threshold value is set according to FIFO capacity is respectively cached in the n online tracking cell, is denoted as { A1,
A2,…,Ai,…,An, AiIndicate the threshold value of i-th of online tracking cell；1≤i≤n；
When the data stored in described i-th online tracking cell are formed by the long B of buffering queuei≥AiWhen, then it is described total
Line arbitration unit, which sets the request transmitted by described i-th online tracking cell to urgent state, asks；
0 ＜ B are grown when the data stored in described i-th online tracking cell are formed by buffering queuei＜ AiWhen, then institute
Bus arbiter unit is stated to set the request transmitted by described i-th online tracking cell to increase state request；
When the data stored in described i-th online tracking cell are formed by the long B of buffering queueiIt is when=0, then described total
Line arbitration unit sets the request transmitted by described i-th online tracking cell to empty state request；
Step 2, the bus arbiter unit write enabled examine to the caching FIFO of described i-th online tracking cell
It surveys, enables for high level, to judge that described i-th online tracking cell is Mobile Forms if caching FIFO writes；If caching FIFO writes
It enables for low level, then to judge that described i-th online tracking cell is inactive；
When step 3, the bus arbiter unit are corresponding according to the caching FIFO capacity setting of i-th of online tracking cell
Between leaf length, be denoted as { S1,S2,…,Si,…,Sn, SiIndicate the time leaf length of i-th of online tracking cell；
The response priority of step 4, the online tracking cell of bus arbiter unit setting n；
One urgent state register U is set in step 5, the bus arbiter unit, and i-th of online tracking cell corresponds to
I-th bit in the urgent state register U；
When i-th of online tracking cell is in urgent state, then set " 1 " i-th bit in urgent state register U to；
When i-th of online tracking cell, which is in, increases state or empty state, then the i-th bit in urgent state register U is arranged
For " 0 "；
A Mobile Forms register V is arranged in step 6, the bus arbiter unit, and i-th of online tracking cell corresponds to
I-th bit in the Mobile Forms register V；
When i-th of online tracking cell is in Mobile Forms, then set " 1 " i-th bit in Mobile Forms register V to；
When i-th of online tracking cell is in inactive, then set the i-th bit in Mobile Forms register V to
“0”；
A request register R is arranged in step 7, the bus arbiter unit, and i-th of online tracking cell corresponds to institute
State the i-th bit in request register R；
When the caching FIFO of i-th of online tracking cell is non-empty, then the i-th bit in the request register R is set
It is set to " 1 "；
When the caching FIFO of i-th of online tracking cell is empty, then the i-th bit in the request register R is arranged
For " 0 "；
Step 8, the bus arbiter unit carry out step-by-step OR operation to the urgent state register U, obtain operation knot
Fruit u；
Step 9, the bus arbiter unit carry out step-by-step OR operation to the active register V, obtain operating result
v；
Step 10, the bus arbiter unit carry out step-by-step OR operation to the request register R, obtain operating result
r；
Step 11 assumes that i-th of online tracking cell is initially received data, then by described i-th online tracking cell
As current response tracking unit；At this point, the operating result r is " 1 ", and starts counter and counted；
Step 12, when counter value be less than current response tracking unit time leaf length and request register R in when
When position corresponding to preceding response tracking unit is " 1 ", the bus arbiter unit obtains the number of the current response tracking unit
According to, and be transmitted to tracking coffret and exported, it is performed simultaneously step 13；
Step 13 judges whether operating result r is " 0 ", if " 0 ", then stops counter and resets；And return to step
11；If not " 0 " after being then performed simultaneously step 14, step 16, step 18 and step 20, then executes step 22；
Step 14；The bus arbiter unit obtains online in urgent state and Mobile Forms in remaining online tracking cell
Tracking cell；Judge to be in urgent state and whether the response priority of the online tracking cell of Mobile Forms is identical, if identical, holds
Row step 15；Otherwise it is inquired according to the sequence of response priority from high to low, obtains highest priority and be in urgent state
With the online tracking cell of Mobile Forms, as the first response tracking unit；
Step 15, the bus arbiter unit are from the urgent state register U corresponding to current response tracking unit
Position starts, and corresponding online tracking cell is inquired according to clockwise rotation；Obtain the online tracking in urgent state and Mobile Forms
Unit, as the first response tracking unit；
It is single that step 16, the bus arbiter unit obtain the online tracking in urgent state in remaining online tracking cell
Member；Judge whether the response priority of the online tracking cell in urgent state is identical, if identical, thens follow the steps 17；Otherwise
It is inquired according to the sequence of response priority from high to low, acquires highest priority and the online tracking list in urgent state
Member, as the second response tracking unit；
Step 17, the bus arbiter unit are from the urgent state register U corresponding to current response tracking unit
Position starts, and corresponding online tracking cell is inquired according to clockwise rotation；The online tracking cell in urgent state is obtained, as
Second response tracking unit；
Step 18, the bus arbiter unit obtain in remaining online tracking cell in increasing the online of state and Mobile Forms
Tracking cell；Judge whether the response priority of the online tracking cell in growth state and Mobile Forms is identical, if identical, holds
Row step 19；Otherwise it is inquired according to the sequence of response priority from high to low, acquires highest priority and in growth
The online tracking cell of state and Mobile Forms, as third response tracking unit；
Step 19, the bus arbiter unit are from the urgent state register U corresponding to current response tracking unit
Position starts, and corresponding online tracking cell is inquired according to clockwise rotation；It obtains in the online tracking for increasing state and Mobile Forms
Unit, as third response tracking unit；
Step 20, the bus arbiter unit obtain single in the online tracking for increasing state in remaining online tracking cell
Member；Judge whether the response priority of the online tracking cell in growth state is identical, if identical, thens follow the steps 21；Otherwise
It is inquired according to the sequence of response priority from high to low, acquires highest priority and in the online tracking list for increasing state
Member, as the 4th response tracking unit；
Step 21, the bus arbiter unit are from the urgent state register U corresponding to current response tracking unit
Position starts, and corresponding online tracking cell is inquired according to clockwise rotation；The online tracking cell in growth state is obtained, as
4th response tracking unit；
Step 22, as operating result u=1 and v=1；Using the first response tracking unit as next response tracking
Unit；
As operating result u=1 and v=0；Using the second response tracking unit as next response tracking unit；
As operating result u=0 and v=1；Using the third response tracking unit as next response tracking unit；
As operating result u=0 and v=0；Using the 4th response tracking unit as next response tracking unit；
Step 23, when counter value be equal to current response tracking unit time leaf length or request register R in when
When position corresponding to preceding response tracking unit is " 0 ", counter O reset；And it is rung using the next response tracking unit as current
After answering tracking cell, return to step 12 executes.
Compared with the prior art, the present invention has the beneficial effect that：
It is 1, of the invention by providing configurable threshold value, priority and timeslice for each online tracking cell,
And the judgement of combining movement state, using two different inquiry modes, overcomes high in the prior art according to the difference of priority
The problems such as data flood rate, high resource consumption and poor expandability, to make bus arbitration respond each online tracking cell
Time it is more reasonable, reduce queue switching and hardware spending, improve buffering utilization rate.
2, the invention enables each online tracking cell corresponding thresholding is arranged according to corresponding buffer memory capacity
Value, and judged by urgent state, make the online tracking cell of the urgent state of bus arbitration preferential answering；Solve Trace Funnel
The cushion space of high priority not yet makes full use of and the spilling serious problems of low priority in technology, reduces data spilling
Rate.
3, bus arbiter unit is judged by the Mobile Forms to each online tracking cell in the present invention, in conjunction with urgent state
Judgement, classify to online tracking cell, it is every it is a kind of in, it is whether identical according to the priority of configuration, looked into using two kinds
Inquiry mode judges next response tracking unit；This various considerations are so that each online tracking of bus arbiter unit response is single
The time distribution of member is more reasonable, improves buffering utilization rate.
4, the invention enables each online tracking cell the corresponding time is arranged according to corresponding buffer memory capacity
Piece fully considers the response time needed for each online tracking cell, effectively reduces queue switching cost.
5, the present invention is each to store respectively by the way that urgent state register, Mobile Forms register and request register is arranged
The state of online tracking cell；When needing to increase online tracking cell, it is only necessary to increase register bit wide, therefore the algorithm
Scalability it is fine.
6, main logical operation is inclusive-OR operation in hardware realization of the invention, is not necessarily to arithmetical operation, and resource consumption is small；
The module carries out prototype verification, resource consumption 33 on the XC7V2000TFPGA chips of 7 series of Xilinx companies Virtex
A static register and 529 static state LUT.
Specific implementation mode
In the present embodiment, a kind of configurable dynamic time piece robin scheduling method is applied in online tracking system,
Tracking system includes online：N online tracking cell, a bus arbiter unit and a tracking coffret；N online with
Track unit corresponds respectively to n resource node, for acquiring the data in respective resources node, and will after request meets with a response
Data transmission is to bus arbiter unit；Bus arbiter unit carries out data output by tracking coffret；
Bus arbiter unit is to carry out dynamic time piece robin scheduling to request as follows：
Step 1, setting thresholding
Corresponding threshold value is set according to FIFO capacity is respectively cached in n online tracking cell, is denoted as { A1,A2,…,
Ai,…,An, AiIndicate the threshold value of i-th of online tracking cell；1≤i≤n；Not due to the data characteristic in resource node
Together, the collected data volume of online tracking cell is also different, in order to save hardware resource, the caching FIFO in online tracking cell
Capacity is also different.For the reasonability that subsequent emergency state judges, threshold value also needs to make different settings.First according to one
Suitable threshold value is arranged in FIFO capacity in a online tracking cell, further according to threshold value in the online tracking cell and capacity
The threshold value of remaining online tracking cell is arranged, such as in ratio：When the threshold value for the online tracking cell that FIFO capacity is 512 is set
When being set to 400；The threshold value for the online tracking cell that then FIFO capacity is 256 need to be set as 200.
When the data stored in i-th of online tracking cell are formed by the long B of buffering queuei≥AiWhen, then bus arbitration list
Member, which sets the request transmitted by i-th of online tracking cell to urgent state, asks；
0 ＜ B are grown when the data stored in i-th of online tracking cell are formed by buffering queuei＜ AiWhen, then bus is secondary
Unit is cut out to set the request transmitted by i-th of online tracking cell to increase state request；
When the data stored in i-th of online tracking cell are formed by the long B of buffering queueiWhen=0, then bus arbitration list
Member sets the request transmitted by i-th of online tracking cell to empty state request；
Step 2, i-th of online tracking cell of bus arbiter unit pair caching FIFO write it is enabled be detected, if caching
FIFO, which writes, to be enabled as high level, then judges that i-th of online tracking cell is Mobile Forms；It is enabled as low level if caching FIFO writes,
Then judge that i-th of online tracking cell is inactive；
Corresponding timeslice is arranged according to the caching FIFO capacity of i-th of online tracking cell in step 3, bus arbiter unit
Length is denoted as { S1,S2,…,Si,…,Sn, SiIndicate the time leaf length of i-th of online tracking cell；Time leaf length is set
Setting also should be identical with the setting rule of thresholding, such as：When the timeslice length value setting for the online tracking cell that FIFO capacity is 512
When being 64；The timeslice length value for the online tracking cell that then FIFO capacity is 256 need to be set as 32.In addition time leaf length
Too conference increases cache overflow risk, too small, can lead to queue frequent switching, increases time waste and bandwidth waste.
The response priority of step 4, the online tracking cell of bus arbiter unit setting n；Priority can be all identical,
Can be all different, it can be same with Local Phase.In the hardware realization of the algorithm, the priority of each online tracking cell is posted with one
The value of storage indicates that the more big then priority of the value is higher.
One urgent state register U is set in step 5, bus arbiter unit, and i-th of online tracking cell corresponds to urgent state
I-th bit in register U；
When i-th of online tracking cell is in urgent state, then set " 1 " i-th bit in urgent state register U to；
When i-th of online tracking cell, which is in, increases state or empty state, then the i-th bit in urgent state register U is arranged
For " 0 "；
A Mobile Forms register V is arranged in step 6, bus arbiter unit, and i-th of online tracking cell is posted corresponding to Mobile Forms
I-th bit in storage V；
When i-th of online tracking cell is in Mobile Forms, then set " 1 " i-th bit in Mobile Forms register V to；
When i-th of online tracking cell is in inactive, then set the i-th bit in Mobile Forms register V to
“0”；
Step 7, one request register R of bus arbiter unit setting, i-th of online tracking cell correspond to request register
I-th bit in R；
When the caching FIFO of i-th of online tracking cell is non-empty, then set the i-th bit in request register R to
“1”；
When the caching FIFO of i-th of online tracking cell is empty, then set the i-th bit in request register R to
“0”；
The value of R and U identical bits is only possible to " 1 " and " 1 ", " 1 " and " 0 " and " 0 " and " 0 " three kinds of different situations occur, works as R
When with the value differences of U identical bits, it is known that the corresponding online tracking cell of this, which is in, increases state.
Step 8, bus arbiter unit carry out step-by-step OR operation to urgent state register U, obtain operating result u.As u etc.
When 1, then it represents that there is the online tracking cell in urgent state；When u is equal to 0, then it represents that there is no be in urgent state
Online tracking cell；
Step 9, bus arbiter unit carry out step-by-step OR operation to active register V, obtain operating result v.When v is equal to
When 1, then it represents that there is the online tracking cell in Mobile Forms；When v is equal to 0, then it represents that there is no exist in Mobile Forms
Line tracking cell；
Step 10, bus arbiter unit carry out step-by-step OR operation to request register R, obtain operating result r.As r etc.
When 1, then it represents that there are the responses that online tracking cell is asking arbitration unit；When r is equal to 0, then it represents that all online
There is no data to need to export by the buffering FIFO of tracking cell；
Step 11, assume i-th of online tracking cell be initially received data, then using i-th of online tracking cell as
Current response tracking unit；At this point, operating result r is " 1 ", and starts counter and counted；
Step 12, when counter value be less than current response tracking unit time leaf length and request register R in when
When position corresponding to preceding response tracking unit is " 1 ", bus arbiter unit obtains the data of current response tracking unit, and transmits
It is exported to tracking coffret, is performed simultaneously step 13；
Step 13 judges whether operating result r is " 0 ", if " 0 ", then stops counter and resets；And return to step
11；If not " 0 " after being then performed simultaneously step 14, step 16, step 18 and step 20, then executes step 22；
Step 14；Bus arbiter unit obtains the online tracking in urgent state and Mobile Forms in remaining online tracking cell
Unit；Judge to be in urgent state and whether the response priority of the online tracking cell of Mobile Forms is identical, if identical, executes step
Rapid 15；Otherwise it is inquired according to the sequence of response priority from high to low, obtains highest priority and be in urgent state and work
Dynamic online tracking cell, as the first response tracking unit；
The position of step 15, bus arbiter unit since urgent state register U corresponding to current response tracking unit, press
Corresponding online tracking cell is inquired according to clockwise rotation；The online tracking cell in urgent state and Mobile Forms is obtained, as
First response tracking unit；Here inquiry mode clockwise refers to the assumption that current response tracking unit institute in urgent state register U
Corresponding position is i-th bit, then judge the online tracking cell corresponding to i+1 whether meet be both urgent state and Mobile Forms item
Part, as the first response tracking unit if meeting, if not satisfied, continuing to judge i+2, until wheel goes to i-th bit.
Step 16, bus arbiter unit obtain the online tracking cell that urgent state is in remaining online tracking cell；Sentence
Whether the response priority of the disconnected online tracking cell in urgent state is identical, if identical, thens follow the steps 17；Otherwise according to sound
It answers the sequence of priority from high to low to be inquired, acquires highest priority and the online tracking cell in urgent state, make
For the second response tracking unit；
The position of step 17, bus arbiter unit since urgent state register U corresponding to current response tracking unit, press
Corresponding online tracking cell is inquired according to clockwise rotation；The online tracking cell in urgent state is obtained, as the second response
Tracking cell；
Step 18, bus arbiter unit obtain in remaining online tracking cell in the online tracking for increasing state and Mobile Forms
Unit；Judge whether the response priority of the online tracking cell in growth state and Mobile Forms is identical, if identical, executes step
Rapid 19；Otherwise inquired according to response priority sequence from high to low, acquire highest priority and in increase state and
The online tracking cell of Mobile Forms, as third response tracking unit；
The position of step 19, bus arbiter unit since urgent state register U corresponding to current response tracking unit, press
Corresponding online tracking cell is inquired according to clockwise rotation；The online tracking cell in growth state and Mobile Forms is obtained, as
Third response tracking unit；
Step 20, bus arbiter unit obtain in remaining online tracking cell in the online tracking cell for increasing state；Sentence
Whether the disconnected response priority in the online tracking cell for increasing state is identical, if identical, thens follow the steps 21；Otherwise according to sound
It answers the sequence of priority from high to low to be inquired, acquire highest priority and in the online tracking cell for increasing state, makees
For the 4th response tracking unit；
The position of step 21, bus arbiter unit since urgent state register U corresponding to current response tracking unit, press
Corresponding online tracking cell is inquired according to clockwise rotation；It obtains in the online tracking cell for increasing state, as the 4th response
Tracking cell；
Step 22, as operating result u=1 and v=1；Using the first response tracking unit as next response tracking unit；
As operating result u=1 and v=0；Using the second response tracking unit as next response tracking unit；
As operating result u=0 and v=1；Using third response tracking unit as next response tracking unit；
As operating result u=0 and v=0；Using the 4th response tracking unit as next response tracking unit；
Step 23, when counter value be equal to current response tracking unit time leaf length or request register R in when
When position corresponding to preceding response tracking unit is " 0 ", counter O reset；And using next response tracking unit as current response with
After track unit, return to step 12 executes.
Claims (1)
1. a kind of configurable dynamic time piece robin scheduling method is applied in online tracking system, the online tracking
System includes：N online tracking cell, a bus arbiter unit and a tracking coffret；The n online tracking are single
Member corresponds respectively to n resource node, for acquiring the data in respective resources node, and by data after request meets with a response
It is transmitted to the bus arbiter unit；The bus arbiter unit carries out data output by the tracking coffret；It is special
Sign is that the bus arbiter unit is to carry out dynamic time piece robin scheduling to request as follows：
Step 1, setting thresholding
Corresponding threshold value is set according to FIFO capacity is respectively cached in the n online tracking cell, is denoted as { A1,A2,…,
Ai,…,An, AiIndicate the threshold value of i-th of online tracking cell；1≤i≤n；
When the data stored in described i-th online tracking cell are formed by the long B of buffering queuei≥AiWhen, then the bus is secondary
It cuts out unit and sets the request transmitted by described i-th online tracking cell to urgent state request；
0 ＜ B are grown when the data stored in described i-th online tracking cell are formed by buffering queuei＜ AiWhen, then it is described total
Line arbitration unit sets the request transmitted by described i-th online tracking cell to increase state request；
When the data stored in described i-th online tracking cell are formed by the long B of buffering queueiWhen=0, then the bus is secondary
It cuts out unit and sets the request transmitted by described i-th online tracking cell to empty state request；
Step 2, the bus arbiter unit, which write the caching FIFO of described i-th online tracking cell, to be enabled to be detected, if
Caching FIFO, which writes, to be enabled for high level, then to judge that described i-th online tracking cell is Mobile Forms；If caching FIFO write enable be
Low level then judges that described i-th online tracking cell is inactive；
Corresponding timeslice is arranged according to the caching FIFO capacity of i-th of online tracking cell in step 3, the bus arbiter unit
Length is denoted as { S1,S2,…,Si,…,Sn, SiIndicate the time leaf length of i-th of online tracking cell；
The response priority of step 4, the online tracking cell of bus arbiter unit setting n；
One urgent state register U is set in step 5, the bus arbiter unit, and i-th of online tracking cell corresponds to institute
State the i-th bit in urgent state register U；
When i-th of online tracking cell is in urgent state, then set " 1 " i-th bit in urgent state register U to；
When i-th of online tracking cell, which is in, increases state or empty state, then set the i-th bit in urgent state register U to
“0”；
A Mobile Forms register V is arranged in step 6, the bus arbiter unit, and i-th of online tracking cell corresponds to described
I-th bit in Mobile Forms register V；
When i-th of online tracking cell is in Mobile Forms, then set " 1 " i-th bit in Mobile Forms register V to；
When i-th of online tracking cell is in inactive, then set " 0 " i-th bit in Mobile Forms register V to；
A request register R is arranged in step 7, the bus arbiter unit, and i-th of online tracking cell corresponds to described ask
Seek the i-th bit in register R；
When the caching FIFO of i-th of online tracking cell is non-empty, then set the i-th bit in the request register R to
“1”；
When the caching FIFO of i-th of online tracking cell is empty, then set the i-th bit in the request register R to
“0”；
Step 8, the bus arbiter unit carry out step-by-step OR operation to the urgent state register U, obtain operating result u；
Step 9, the bus arbiter unit carry out step-by-step OR operation to the Mobile Forms register V, obtain operating result v；
Step 10, the bus arbiter unit carry out step-by-step OR operation to the request register R, obtain operating result r；
Step 11, assume i-th of online tracking cell be initially received data, then using described i-th online tracking cell as
Current response tracking unit；At this point, the operating result r is " 1 ", and starts counter and counted；
Step 12 is currently rung when the value of counter is less than in the time leaf length of current response tracking unit and request register R
When to answer position corresponding to tracking cell be " 1 ", the bus arbiter unit obtains the data of the current response tracking unit, and
It is transmitted to tracking coffret to be exported, is performed simultaneously step 13；
Step 13 judges whether operating result r is " 0 ", if " 0 ", then stops counter and resets；And return to step 11；If
It is not " 0 ", then after being performed simultaneously step 14, step 16, step 18 and step 20, then executes step 22；
Step 14；The bus arbiter unit obtains the online tracking in urgent state and Mobile Forms in remaining online tracking cell
Unit；Judge to be in urgent state and whether the response priority of the online tracking cell of Mobile Forms is identical, if identical, executes step
Rapid 15；Otherwise it is inquired according to the sequence of response priority from high to low, obtains highest priority and be in urgent state and work
Dynamic online tracking cell, as the first response tracking unit；
It opens the position of step 15, the bus arbiter unit from the urgent state register U corresponding to current response tracking unit
Begin, corresponding online tracking cell is inquired according to clockwise rotation；The online tracking cell in urgent state and Mobile Forms is obtained,
As the first response tracking unit；
Step 16, the bus arbiter unit obtain the online tracking cell that urgent state is in remaining online tracking cell；Sentence
Whether the response priority of the disconnected online tracking cell in urgent state is identical, if identical, thens follow the steps 17；Otherwise according to sound
It answers the sequence of priority from high to low to be inquired, acquires highest priority and the online tracking cell in urgent state, make
For the second response tracking unit；
It opens the position of step 17, the bus arbiter unit from the urgent state register U corresponding to current response tracking unit
Begin, corresponding online tracking cell is inquired according to clockwise rotation；The online tracking cell in urgent state is obtained, as second
Response tracking unit；
Step 18, the bus arbiter unit obtain in remaining online tracking cell in the online tracking for increasing state and Mobile Forms
Unit；Judge whether the response priority of the online tracking cell in growth state and Mobile Forms is identical, if identical, executes step
Rapid 19；Otherwise inquired according to response priority sequence from high to low, acquire highest priority and in increase state and
The online tracking cell of Mobile Forms, as third response tracking unit；
It opens the position of step 19, the bus arbiter unit from the urgent state register U corresponding to current response tracking unit
Begin, corresponding online tracking cell is inquired according to clockwise rotation；It obtains in the online tracking cell for increasing state and Mobile Forms,
As third response tracking unit；
Step 20, the bus arbiter unit obtain in remaining online tracking cell in the online tracking cell for increasing state；Sentence
Whether the disconnected response priority in the online tracking cell for increasing state is identical, if identical, thens follow the steps 21；Otherwise according to sound
It answers the sequence of priority from high to low to be inquired, acquire highest priority and in the online tracking cell for increasing state, makees
For the 4th response tracking unit；
It opens the position of step 21, the bus arbiter unit from the urgent state register U corresponding to current response tracking unit
Begin, corresponding online tracking cell is inquired according to clockwise rotation；It obtains in the online tracking cell for increasing state, as the 4th
Response tracking unit；
Step 22, as operating result u=1 and v=1；Using the first response tracking unit as next response tracking unit；
As operating result u=1 and v=0；Using the second response tracking unit as next response tracking unit；
As operating result u=0 and v=1；Using the third response tracking unit as next response tracking unit；
As operating result u=0 and v=0；Using the 4th response tracking unit as next response tracking unit；
Step 23, when counter value be equal to current response tracking unit time leaf length or request register R in currently ring
When to answer position corresponding to tracking cell be " 0 ", counter O reset；And using the next response tracking unit as current response with
After track unit, return to step 12 executes.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610147991.5A CN105824769B (en) | 2016-03-14 | 2016-03-14 | A kind of configurable dynamic time piece robin scheduling method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610147991.5A CN105824769B (en) | 2016-03-14 | 2016-03-14 | A kind of configurable dynamic time piece robin scheduling method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105824769A CN105824769A (en) | 2016-08-03 |
| CN105824769B true CN105824769B (en) | 2018-08-28 |
Family
ID=56987801
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610147991.5A Expired - Fee Related CN105824769B (en) | 2016-03-14 | 2016-03-14 | A kind of configurable dynamic time piece robin scheduling method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105824769B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107870812B (en) * | 2017-11-17 | 2021-06-15 | 南京国电南自轨道交通工程有限公司 | Application management method based on single thread concurrent multi-timer |
| CN108107852A (en) * | 2017-11-24 | 2018-06-01 | 中核控制系统工程有限公司 | A kind of algorithms library implementation method based on bus architecture |
| CN109062661B (en) * | 2018-07-10 | 2021-10-26 | 中国电子科技集团公司第三十八研究所 | Multi-channel arbitration circuit of online simulation debugger and scheduling method thereof |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1851652A (en) * | 2006-05-23 | 2006-10-25 | 浙江大学 | Method for realizing process priority-level round robin scheduling for embedded SRAM operating system |
| CN101051280A (en) * | 2006-04-03 | 2007-10-10 | 北京握奇数据系统有限公司 | Intelligent card embedded operation system and its control method |
| CN102970762A (en) * | 2012-05-11 | 2013-03-13 | 深圳市创想网络系统有限公司 | Processing method for scheduling in wireless network by combining tokens on basis of time slice rotation |
| EP2712123A1 (en) * | 2012-09-20 | 2014-03-26 | Robert Bosch Gmbh | Standard CAN implementation tolerating CAN FD frames |
| CN103885825A (en) * | 2014-03-05 | 2014-06-25 | 南京邮电大学 | Real-time speed monotony scheduling method based on dynamic time slices |
| CN104375893A (en) * | 2014-11-29 | 2015-02-25 | 中国航空工业集团公司第六三一研究所 | Partition scheduling method based on two-stage operating system structure |
-
2016
- 2016-03-14 CN CN201610147991.5A patent/CN105824769B/en not_active Expired - Fee Related
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101051280A (en) * | 2006-04-03 | 2007-10-10 | 北京握奇数据系统有限公司 | Intelligent card embedded operation system and its control method |
| CN1851652A (en) * | 2006-05-23 | 2006-10-25 | 浙江大学 | Method for realizing process priority-level round robin scheduling for embedded SRAM operating system |
| CN102970762A (en) * | 2012-05-11 | 2013-03-13 | 深圳市创想网络系统有限公司 | Processing method for scheduling in wireless network by combining tokens on basis of time slice rotation |
| EP2712123A1 (en) * | 2012-09-20 | 2014-03-26 | Robert Bosch Gmbh | Standard CAN implementation tolerating CAN FD frames |
| CN103885825A (en) * | 2014-03-05 | 2014-06-25 | 南京邮电大学 | Real-time speed monotony scheduling method based on dynamic time slices |
| CN104375893A (en) * | 2014-11-29 | 2015-02-25 | 中国航空工业集团公司第六三一研究所 | Partition scheduling method based on two-stage operating system structure |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105824769A (en) | 2016-08-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| TWI694339B (en) | Blockchain consensus method, equipment and system | |
| US9477280B1 (en) | Specification for automatic power management of network-on-chip and system-on-chip | |
| CN105824769B (en) | A kind of configurable dynamic time piece robin scheduling method | |
| CN105988970B (en) | The processor and chip of shared storing data | |
| US20070005530A1 (en) | Selecting grid executors via a neural network | |
| CN110138732A (en) | Response method, device, equipment and the storage medium of access request | |
| US8725873B1 (en) | Multi-server round robin arbiter | |
| CN103493449A (en) | Effective circuits in packet-switched networks | |
| US11061871B2 (en) | Data placement for a distributed database | |
| US20160173413A1 (en) | Architecture For On-Die Interconnect | |
| WO2022199027A1 (en) | Random write method, electronic device and storage medium | |
| CN110569596A (en) | Hybrid clock tree structure for system on chip | |
| CN107391422A (en) | multi-path asynchronous serial communication data access system and method | |
| CN103902505A (en) | Configurable FFT processor circuit structure based on switching network | |
| CN106250348A (en) | A kind of heterogeneous polynuclear framework buffer memory management method based on GPU memory access characteristic | |
| CN108351838A (en) | Memory management functions are provided using polymerization memory management unit (MMU) | |
| CN109951540A (en) | A kind of data transmission method, device and electronic equipment | |
| CN110168644B (en) | System, method and computer program for providing row tamper protection in a bank memory cell array | |
| CN106547707B (en) | Concurrent access Local Priority switched circuit is stored in array processor in cluster | |
| US10728186B2 (en) | Preventing reader starvation during order preserving data stream consumption | |
| CN113126911A (en) | Queue management method, medium and equipment based on DDR3SDRAM | |
| CN103106177B (en) | Interconnect architecture and method thereof on the sheet of multi-core network processor | |
| US7460544B2 (en) | Flexible mesh structure for hierarchical scheduling | |
| Jian et al. | Understanding and optimizing power consumption in memory networks | |
| US9665518B2 (en) | Methods and systems for controlling ordered write transactions to multiple devices using switch point networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20180828 |