A synthetic utilization bound for aperiodic tasks with resource requirements
- 23 January 2004
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- Minimum and maximum utilization bounds for multiprocessor rate monotonic schedulingIEEE Transactions on Parallel and Distributed Systems, 2004
- Worst-case utilization bound for EDF scheduling on real-time multiprocessor systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Utilization Bounds for N-Processor Rate Monotone Scheduling with Static Processor AssignmentReal-Time Systems, 1998
- Fixed-priority scheduling of real-time systems using utilization boundsJournal of Systems and Software, 1996
- Algorithms for scheduling hard aperiodic tasks in fixed-priority systems using slack stealingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1994
- Modified rate-monotonic algorithm for scheduling periodic jobs with deferred deadlinesIEEE Transactions on Software Engineering, 1993
- Priority inheritance protocols: an approach to real-time synchronizationIEEE Transactions on Computers, 1990
- Aperiodic task scheduling for Hard-Real-Time systemsReal-Time Systems, 1989
- Distributed scheduling of tasks with deadlines and resource requirementsIEEE Transactions on Computers, 1989
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time EnvironmentJournal of the ACM, 1973