TASK SCHEDULING IN DISTRIBUTED REAL-TIME SYSTEMS.

Lui Sha, John P. Lehoczky, Ragunathan Rajkumar

Research output: Contribution to conferencePaper

Abstract

A review of some practical problems associated with the use of static priority scheduling is given. An approach to stabilize the rate-monotonic algorithm in the presence of transient processor overloads is presented. Also presented is a class of algorithms to handle aperiodic tasks which improve response times while guaranteeing the deadlines of periodic tasks. The problem of integrated processor and data I/O scheduling is studied as well as the problem of scheduling of messages over a bus with insufficient priority levels and multiple buffers.

Original languageEnglish (US)
Pages909-916
Number of pages8
StatePublished - Dec 1 1987
Externally publishedYes

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'TASK SCHEDULING IN DISTRIBUTED REAL-TIME SYSTEMS.'. Together they form a unique fingerprint.

  • Cite this

    Sha, L., Lehoczky, J. P., & Rajkumar, R. (1987). TASK SCHEDULING IN DISTRIBUTED REAL-TIME SYSTEMS.. 909-916.