Space optimization method for priority bitmap algorithm
An optimization method and priority technology, applied in the direction of multi-programming devices, etc., can solve problems such as increased time consumption of PBA scheduling, PBA space complexity, PBA expansion dilemma, and complex table lookup process, so as to reduce algorithm time consumption and improve The effect of real-time scheduling capabilities
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0065] Consider a PBA that supports 64 priorities: n=8, m=4, k=3. Then the input signal is A 7 ~A 0 , the output signal is B 2 ~B 0 . According to the above algorithm generated "A x "As follows:
[0066] output signal
4 "A x "x"
B 0
1 3 5 7
B 1
2 3 6 7
B 2
4 5 6 7
[0067] So alternative combinational logic circuits are:
[0068] B 0 = A 1 A 0 ‾ + A 3 A 2 ‾ A 1 ‾ A 0 ‾ + A 5 A 4 ‾ A ...
Embodiment 2
[0072] Consider a PBA that supports 1024 priorities: n=32, m=16, k=5. Then the input signal is A 31 ~A 0 , the output signal is B 4 ~B 0 . According to the above algorithm generated "A x "As follows:
[0073]
[0074] So alternative combinational logic circuits are:
[0075] B 0 = A 1 A 0 ‾ + A 3 A 2 ‾ A 1 ‾ A 0 ‾ + A 5 A 4 ‾ A 3 ‾ A 2 ‾ A ...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 