Share Email Print

Proceedings Paper

Task Scheduling In Distributed Real-Time Systems
Author(s): Lui Sha; John P. Lehoczky; Ragunathan Rajkumar
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

In this paper, we give a comprehensive review of a number of practical problems associated with the use of static priority scheduling. We first present a new approach to stabilize the rate-monotonic algorithm in the presence of transient processor overloads. We also present a new class of algorithms to handle aperiodic tasks which improve the response times to aperiodic tasks while guaranteeing the deadlines of periodic tasks. We then study the problem of integrated processor and data I/O scheduling. Finally we review the problem of scheduling of messages over a bus with insufficient priority levels but with multiple buffers.

Paper Details

Date Published: 19 October 1987
PDF: 9 pages
Proc. SPIE 0857, IECON'87:Automated Design and Manufacturing, (19 October 1987);
Show Author Affiliations
Lui Sha, Carnegie Mellon University (United States)
John P. Lehoczky, Carnegie Mellon University (United States)
Ragunathan Rajkumar, Carnegie Mellon University (United States)

Published in SPIE Proceedings Vol. 0857:
IECON'87:Automated Design and Manufacturing
Victor K.L. Huang, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?