Multi-level scheduling method supporting multiple time periods
A scheduling method, multi-time technology, applied in advanced technology, climate sustainability, sustainable communication technology, etc., can solve the problem of no multi-level periodic scheduling, no implementation method, etc.
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0038] An example of the scheduling composition of the present invention is such as figure 1 As shown, the queues Q1-Q7 are 7 queues, and each queue has a corresponding scheduling period T1-T7, of which Q1-Q4 form a queue group G1, denoted as virtual queue G-Q1, and the scheduling period is G-T1; Q5 -Q7 forms a queue group G2, denoted as virtual queue G-Q2, and the scheduling period is G-T2. Each queue scheduled according to the time period, including the virtual queue, has a corresponding counter. C1-C7 corresponds to the actual queue Q1-Q7, C-G1 corresponds to the virtual queue G-Q1, and C-G2 corresponds to the virtual queue G-Q2 .
[0039] The scheduling of each queue is controlled by two flags, namely the flip flag R and the message flag E whether the queue has a message. Among them, R is set according to the increase or decrease of the counter, and E is set according to whether the corresponding queue is empty.
[0040] The parameters of each queue are shown in Table 1...
Embodiment 2
[0060] Internal queue like figure 1 As shown, the parameters of each queue are as follows in Table 2 (the timer interval is 1us precision):
[0061] Table 2: Example 2 Q1-Q7 queue parameter table
[0062] Queue ID Period size (T) Count initial value (C) The identifier of the secondary queue to which it belongs Scheduling Algorithm Weights Q1 T1=30us C1=30 G-Q1 PB-SP Q2 T2=50us C2=50 G-Q1 PB-SP Q3 T3=70us C3=70 G-Q1 PB-SP Q4 T4=100us C4=100 G-Q1 PB-SP Q5 T5=125us C5=125 G-Q2 PB-SP Q6 T6=150us C6=150 G-Q2 PB-SP Q7 T7=250us C7=250 G-Q2 PB-SP G-Q1 G-T1=125us C-G1=125 PB-SP G-Q2 G-T2=250us C-G1=250 PB-SP
[0063] The initial R=true of each queue, E=true; C is operated by subtracting one, when C is 0, the R of the corresponding queue is set to true. For detailed workflow, see figure 2 .
[0064] 1. Start the device, and set the queue pa...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


