Linear-time online task assignment scheme for multiprocessor systems

Almut Burchard, Yingfeng Oh, Jorg Liebeherr, Sang H. Son

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Scopus citations

Abstract

A new online task assignment scheme is presented for multiprocessor systems where individual processors execute the rate-monotonic scheduling algorithm. The computational complexity of the task assignment scheme grows linearly with the number of tasks, and its performance is shown to be significantly better than previously existing schemes. The superiority of the assignment scheme is achieved by a new schedulability condition derived for the rate-monotonic scheduling discipline.

Original languageEnglish
Title of host publicationProceedings of the IEEE Workshop on Real-Time Operating Systems and Software
PublisherPubl by IEEE
Pages28-31
Number of pages4
ISBN (Print)0818657103
StatePublished - 1994
EventProceedings of the 11th IEEE Workshop on Real-Time Operating Systems and Software - Seattle, WA, USA
Duration: 18 May 199419 May 1994

Publication series

NameProceedings of the IEEE Workshop on Real-Time Operating Systems and Software

Conference

ConferenceProceedings of the 11th IEEE Workshop on Real-Time Operating Systems and Software
CitySeattle, WA, USA
Period18/05/9419/05/94

Fingerprint

Dive into the research topics of 'Linear-time online task assignment scheme for multiprocessor systems'. Together they form a unique fingerprint.

Cite this