Handling aperiodic tasks in diverse real-time systems via plug-ins

Functionality for various services of scheduling algorithms is typically provided as extensions to a basic algorithm. A similar approach dominates operating system functionality: implementation of the actual real-time scheduling algorithm. In this paper, we propose the use of a plug-in approach to a...

Full description

Saved in:
Bibliographic Details
Published inProceedings - 5th IEEE International Symposium on Object-Oriented Real-Time Distributed Computing, ISORC 2002 pp. 137 - 144
Main Authors Lennvall, T., Fohler, G., Lindberg, B.
Format Conference Proceeding
LanguageEnglish
Published IEEE 2002
Subjects
Algorithm design and analysis
Algorithms
Computer operating systems
Dispatching
Distributed computer systems
Earliest deadline first scheduling
Interactive computer systems
Job shop scheduling
Kernel
Operating systems
Optimization
Packaging
Processor scheduling
Real - time scheduling
Real time systems
Real-time scheduling algorithms
Scheduling
Scheduling algorithm
Scheduling algorithms
Switches
System functionality
Time switches
Online AccessGet full text

Cover

More Information
Summary:Functionality for various services of scheduling algorithms is typically provided as extensions to a basic algorithm. A similar approach dominates operating system functionality: implementation of the actual real-time scheduling algorithm. In this paper, we propose the use of a plug-in approach to add functionality to existing scheduling schemes and provide for easy, replacement on the operating system level. In particular, we present an architecture to disentangle actual real-time scheduling from dispatching and other kernel routines with a small API, suited for a variety of scheduling schemes as plug-ins. We detail two plug-ins for aperiodic task handling and how they can extend two target systems, table-driven and earliest deadline first scheduling, using the approach presented.
ISBN:0769515584
9780769515588
DOI:10.1109/ISORC.2002.1003674