2009•Real-Time SystemsOpen access

Exact quantification of the sub-optimality of uniprocessor fixed priority pre-emptive scheduling

Robert I. Davis, Thomas Rothvoß, Sanjoy Baruah, Alan Burns

Open full text 37 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

OpenAlex reports 37 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.

Key concepts: Uniprocessor system, Speedup, Computer science, Scheduling (production processes), Earliest deadline first scheduling, Parallel computing, Mathematical optimization, Dynamic priority scheduling

Back to paper search Browse research topics Original source

Exact quantification of the sub-optimality of uniprocessor fixed priority pre-emptive scheduling — Research Paper | ScholarLens