A survey of hard real-time scheduling for multiprocessor systems

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.

Hard-real-time scheduling of data-dependent tasks in embedded streaming applications

“…Upon empirical evaluation, we demonstrate that our strictly periodic scheduling approach yields the maximum achievable throughput for a class of applications called matched I/O rates applications which represents the majority of streaming applications. Applying our approach to matched I/O rates applications enables using a plethora of schedulability tests developed in the real-time scheduling theory [7] to easily determine the minimum number of processors needed to schedule a set of applications using a certain algorithm to provide the maximum achievable throughput. This can be of great use for embedded systems designers during the Design Space Exploration (DSE) phase.…”

“…However, these solutions either use simple MoCs such as SDF/PGM graphs or use TimeDivision Multiplexing (TDM)/Round-Robin (RR) scheduling combined with heuristics. Several algorithms from the hard-real-time multiprocessor scheduling theory [7] can perform fast admission and scheduling decisions for incoming applications while providing hard-real-time services. Moreover, these algorithms provide temporal isolation which is the ability to dynamically start/stop applications without affecting other already running applications.…”

“…However, these algorithms from the hard-real-time multiprocessor scheduling theory received little attention in the embedded MPSoC community. This is mainly due to the fact that these algorithms assume independent periodic or sporadic tasks [7]. Such a simple task model is not directly applicable to modern embedded streaming applications.…”

A Survey on Job Scheduling in Big Data

“…Global, hybrid scheduling algorithm and various approaches for sharing and usage in real time scheduling are discussed in [10]. To make decisions better Big Data need to convert the data to an interactive format.…”

Exact schedulability tests for real-time scheduling of periodic tasks on unrelated multiprocessor platforms

“…The problem of scheduling periodic task systems on multiprocessors was originally studied in [14]. Recent studies provide a better understanding of this scheduling problem and provide the first solutions, e.g., [3] presents a categorization of real-time multiprocessor scheduling problems and [7] an up-to-date state of the art. To the best of our knowledge, a single work [1] provides exact schedulability test for the global scheduling of periodic systems on multiprocessors (except two past conference papers we have already published [4,5]).…”