ScholarLens Back to search
2003•Unpublished venueRequires access

Robustness results concerning EDF scheduling upon uniform multiprocessors

Sanjoy Baruah

Open publisher page 13 citations

Abstract

The earliest-deadline-first (EDF) scheduling of hard-real-time systems upon uniform multiprocessor machines is considered. It is shown that EDF scheduling upon uniform multiprocessors is robust with respect to processor computing capacity. This result is used to derive a new multiprocessor EDF-feasibility analysis algorithm, which is superior to previously-proposed algorithms.

About this research paper

What this paper is about

The earliest-deadline-first (EDF) scheduling of hard-real-time systems upon uniform multiprocessor machines is considered. It is shown that EDF scheduling upon uniform multiprocessors is robust with respect to processor computing capacity. This result is used to derive a new multiprocessor EDF-feasibility analysis algorithm, which is superior to previously-proposed algorithms.

Why it matters

OpenAlex reports 13 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The earliest-deadline-first (EDF) scheduling of hard-real-time systems upon uniform multiprocessor machines is considered. It is shown that EDF scheduling upon uniform multiprocessors is robust with respect to processor computing capacity. This result is used to derive a new multiprocessor EDF-feasibility analysis algorithm, which is superior to previously-proposed algorithms.

Key concepts: Multiprocessing, Computer science, Parallel computing, Multiprocessor scheduling, Processor scheduling, Scheduling (production processes), Earliest deadline first scheduling, Robustness (evolution)

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Robustness results concerning EDF scheduling upon uniform multiprocessors — Research Paper | ScholarLens