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. Aperiodic task handling, guarantees, etc., are integrated with a specific basic scheme, such as earliest deadline first, rate monotonic, or off-line scheduling. Thus, scheduling services come in packages of scheduling schemes, fixed to a certain methodology. A similar approach dominates operating system functionality: implementation of the actual real-time scheduling algorithm, i.e., take the decisions which task to execute at which times to ensure deadlines are met, are intertwined with kernel routines such as task switching, dispatching, and bookkeeping to form a scheduling/dispatching module. Consequently, designers have to choose a single scheduling package, although the desired functionality may be spread over several ones. Instead, there is a need to seamlessly integrate new functionality with a developed system, enabling designers to choose the best of variou...

• Type: Conference
• Year: 2002
• Where: ISORC
• Authors: Tomas Lennvall, Gerhard Fohler, Björn Lindberg
• Keywords: Actual Real-time Scheduling, Distributed And Parallel Computing, ISORC 2002, Scheduling Algorithm, Scheduling Schemes