View in EDS

Utility accrual scheduling with real-time Java

Saved in:
Bibliographic Details
Title: Utility accrual scheduling with real-time Java
Authors: William Beebee, Jr., Binoy Ravindran, Peng Li, Martin Rinard
Contributors: The Pennsylvania State University CiteSeerX Archives
Source: http://people.csail.mit.edu/rinard//paper/jtres03.pdf.
Publication Year: 2003
Collection: CiteSeerX
Subject Terms: Utility Accrual Scheduling, Overload Schedul- ing, FLEX/RTJ, Distributed Real-time Java, Soft Real-time, Embedded Systems Tools, Real-time Systems
Description: Graceful performance degradation during overload conditions is the primary objective of soft real-time systems. Utility accrual soft real-time scheduling algorithms allow specification of highly customized temporal system behavior during overload. Such algorithms are typically found in real-time supervisory systems where significant run-time uncertainty exists. This paper outlines an investigation of several utility accrual scheduling algorithms implemented in a Real-Time Java (RTJ) environment. These alternate schedulers are constructed, tested, and evaluated under the MIT FLEX/RTJ Compiler Infrastructure. The scheduling frame-work for this environment and its associated scheduling primitives are described and the corresponding performance characteristics are profiled. Furthermore, we outline the architecture of an experimental distributed Real-time Java scheduler.
Document Type: text
File Description: application/pdf
Language: English
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.459.5648; http://people.csail.mit.edu/rinard//paper/jtres03.pdf
Availability: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.459.5648
http://people.csail.mit.edu/rinard//paper/jtres03.pdf
Rights: Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Accession Number: edsbas.7DD59C5
Database: BASE
Description
Abstract:Graceful performance degradation during overload conditions is the primary objective of soft real-time systems. Utility accrual soft real-time scheduling algorithms allow specification of highly customized temporal system behavior during overload. Such algorithms are typically found in real-time supervisory systems where significant run-time uncertainty exists. This paper outlines an investigation of several utility accrual scheduling algorithms implemented in a Real-Time Java (RTJ) environment. These alternate schedulers are constructed, tested, and evaluated under the MIT FLEX/RTJ Compiler Infrastructure. The scheduling frame-work for this environment and its associated scheduling primitives are described and the corresponding performance characteristics are profiled. Furthermore, we outline the architecture of an experimental distributed Real-time Java scheduler.