Task Scheduling In Distributed Real-Time Systems

Lui Sha; John P. Lehoczky; Ragunathan Rajkumar

doi:10.1117/12.943278

19 October 1987 Task Scheduling In Distributed Real-Time Systems

Lui Sha, John P. Lehoczky, Ragunathan Rajkumar

Proceedings Volume 0857, IECON'87:Automated Design and Manufacturing; (1987) https://doi.org/10.1117/12.943278
Event: IECON, Cambridge, 1987, Cambridge, MA, United States

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.

Citation Download Citation

Lui Sha, John P. Lehoczky, and Ragunathan Rajkumar "Task Scheduling In Distributed Real-Time Systems", Proc. SPIE 0857, IECON'87:Automated Design and Manufacturing, (19 October 1987); https://doi.org/10.1117/12.943278

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available