Sporadic Server revisited
Open Access
- 22 March 2010
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 340-345
Abstract
The Sporadic Server (SS) overcomes the major limitations of other Resource Reservation Fixed Priority based techniques, but it also presents some drawbacks, mainly related to an increased scheduling overhead and a not so efficient behavior during overrun situations. In this paper we introduce and prove the effectiveness of an improved SS with reduced overhead and fairer handling of server overrun situations. We also show how this can be efficiently exploited to provide temporal isolation in a multiprocessor platform, adapting already existing schedulability tests.Keywords
Funding Information
- Seventh Framework Programme (FP7/2008/ICT/216586, FP7/2008/ICT/214777)
This publication has 14 references indexed in Scilit:
- Schedulability Analysis of Global Scheduling Algorithms on Multiprocessor PlatformsIEEE Transactions on Parallel and Distributed Systems, 2008
- Modeling Device Driver Effects in Real-Time Schedulability Analysis: Study of a Network Driver2007
- Hierarchical Fixed Priority Pre-Emptive Scheduling2006
- An Analysis of Fixed-Priority Schedulability on a MultiprocessorReal-Time Systems, 2006
- New Schedulability Tests for Real-Time Task Sets Scheduled by Deadline Monotonic on Multiprocessors2006
- Rate Monotonic vs. EDF: Judgment DayReal-Time Systems, 2005
- A multiprocessor implementation of the total bandwidth server2004
- Elastic scheduling for flexible workload managementIEEE Transactions on Computers, 2002
- The deferrable server algorithm for enhanced aperiodic responsiveness in hard real-time environmentsIEEE Transactions on Computers, 1995
- Aperiodic task scheduling for Hard-Real-Time systemsReal-Time Systems, 1989