Task Scheduling in Distributed Real-Time Systems

Research output: Contribution to journalArticlepeer-review


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.

Original languageEnglish (US)
Pages (from-to)909-916
Number of pages8
JournalProceedings of SPIE - The International Society for Optical Engineering
StatePublished - Oct 19 1987
Externally publishedYes

ASJC Scopus subject areas

  • Electronic, Optical and Magnetic Materials
  • Condensed Matter Physics
  • Computer Science Applications
  • Applied Mathematics
  • Electrical and Electronic Engineering


Dive into the research topics of 'Task Scheduling in Distributed Real-Time Systems'. Together they form a unique fingerprint.

Cite this