Linear programming: methods and applications
Linear programming: methods and applications
Fixed-priority scheduling of real-time systems using utilization bounds
Journal of Systems and Software
Schedule validation for embedded reactive real-time systems
DAC '97 Proceedings of the 34th annual Design Automation Conference
Proceedings of the 6th international workshop on Hardware/software codesign
Performance Estimation for Real-Time Distributed Embedded Systems
IEEE Transactions on Parallel and Distributed Systems
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Fast performance prediction for periodic task systems
CODES '00 Proceedings of the eighth international workshop on Hardware/software codesign
Real-Time Systems
Scientific Computing
New Strategies for Assigning Real-Time Tasks to Multiprocessor Systems
IEEE Transactions on Computers
Timing Analysis for Fixed-Priority Scheduling of Hard Real-Time Systems
IEEE Transactions on Software Engineering
A generalized utilization bound test for fixed-priority real-time scheduling
RTCSA '95 Proceedings of the 2nd International Workshop on Real-Time Computing Systems and Applications
Schedulability Analysis of Periodic Fixed Priority Systems
IEEE Transactions on Computers
| Hi-index | 0.00 |
The paper presents a novel approach to compute tight upper bounds on the processor utilization independent of the implementation for general real-time systems where tasks are composed of subtasks and precedence constraints may exist among subtasks of the same task. We formulate the problem as a set of linear programming (LP) problems. Observations are made to reduce the number of LP problem instances required to be solved, which greatly improves the computation time of the utilization bounds. Furthermore, additional constraints are allowed to be included under certain circumstances to improve the quality of the bounds.