SOLUTIONS FOR SOME PRACTICAL PROBLEMS IN PRIORITIZED PREEMPTIVE SCHEDULING.

Lui Sha, John P. Lehoczky, Ragunathan Rajkumar

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

A comprehensive treatment of a number of practical problems associated with the use of the rate monotonic algorithm is presented. These include the scheduling of messages over a bus with insufficient priority levels but with multiple buffers. Methods to handle aperiodic tasks are reviewed and a new approach to stabilize the rate monotonic algorithm in the presence of transit processor overloads is presented. The problem of integrated processor and data I/O scheduling is addressed. The results clearly establish the importance of using an integrated approach to schedule both the processor and data I/O activities.

Original languageEnglish (US)
Title of host publicationUnknown Host Publication Title
PublisherIEEE
Pages181-191
Number of pages11
ISBN (Print)0818607491
StatePublished - Dec 1 1986
Externally publishedYes

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Fingerprint

Dive into the research topics of 'SOLUTIONS FOR SOME PRACTICAL PROBLEMS IN PRIORITIZED PREEMPTIVE SCHEDULING.'. Together they form a unique fingerprint.

Cite this