Schedulability analysis and utilization bounds for highly scalable real-time services
- 13 November 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Combined task and message scheduling in distributed real-time systemsIEEE Transactions on Parallel and Distributed Systems, 1999
- Adding Robustness in Dynamic Preemptive SchedulingPublished by Springer Nature ,1995
- The deferrable server algorithm for enhanced aperiodic responsiveness in hard real-time environmentsIEEE Transactions on Computers, 1995
- Generalized rate-monotonic scheduling theory: a framework for developing real-time systemsProceedings of the IEEE, 1994
- Algorithms for scheduling hard aperiodic tasks in fixed-priority systems using slack stealingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1994
- Multiprocessor scheduling of processes with release times, deadlines, precedence, and exclusion relationsIEEE Transactions on Software Engineering, 1993
- A pre-run-time scheduling algorithm for hard real-time systemsIEEE Transactions on Software Engineering, 1991
- The Spring kernel: a new paradigm for real-time systemsIEEE Software, 1991
- Scheduling processes with release times, deadlines, precedence and exclusion relationsIEEE Transactions on Software Engineering, 1990
- Aperiodic task scheduling for Hard-Real-Time systemsReal-Time Systems, 1989