By the same authors

From the same journal

A Survey of Hard Real-Time Scheduling for Multiprocessor Systems

Research output: Contribution to journalArticle

Author(s)

Department/unit(s)

Publication details

JournalACM Comput. Surv.
DatePublished - 1 Oct 2011
Issue number4
Volume43
Number of pages44
Pages (from-to)35:1 -35:44
Original languageEnglish

Abstract

This survey covers hard real-time scheduling algorithms and schedulability analysis techniques for homogeneous multiprocessor systems. It reviews the key results in this field from its origins in the late 1960’s to the latest research published in late 2009. The survey outlines fundamental results about multiprocessor realtime scheduling that hold independent of the scheduling algorithms employed. It provides a taxonomy of the different scheduling methods, and considers the various performance metrics that can be used for comparison purposes. A detailed review is provided covering partitioned, global, and hybrid scheduling algorithms, approaches to resource sharing, and the latest results from empirical investigations. The survey identifies open issues, key research challenges and likely productive research directions.

Bibliographical note

DOI: 10.1145/1978802.1978814

    Research areas

  • real-time , schedulability analysis, multiprocesor, multicore, survey, Scheduling

Discover related content

Find related publications, people, projects, datasets and more using interactive charts.

View graph of relations