RUN: Optimal Multiprocessor Real-Time Scheduling via Reduction to Uniprocessor

Regnier, Paul; Lima, George; Massa, Ernesto; Levin, Greg; Brandt, Scott

doi:10.1109/rtss.2011.17

Cited by 99 publications

(91 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This section introduces the system model that supports the extended imprecise computation model [20] as well as RUN's specific model [26]. Figure 1 shows the extended imprecise computation model [20], which adds a wind-up part to the imprecise computation model [23].…”

Section: System Modelmentioning

confidence: 99%

“…This paper is interested in global scheduling and especially optimal multiprocessor real-time scheduling that can achieve 100% processor utilization with implicit-deadline periodic task sets (i.e., all relative deadlines of tasks are equal to their periods). Several optimal multiprocessor real-time scheduling algorithms have been proposed [3], [7], [18], [22] and Reduction to Uniprocessor (RUN) [26] outperforms other algorithms with respect to the number of preemptions/migrations, and hence this paper focuses on RUN.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Multiprocessor Semi-fixed-priority Scheduling

Chishiro

2018

Journal of Information Processing

View full text Add to dashboard Cite

Optimal multiprocessor real-time scheduling can achieve full system utilization with implicit-deadline periodic task sets. However, worst case execution time (WCET) analysis is difficult on state-of-the-art hardware/software platforms due to the complex hierarchy of shared caches and multiprogramming. The actual case execution time of each task is usually shorter than its WCET and imprecise computation is an effective method to make better use of the remaining processor time. Semi-fixed-priority scheduling is real-time scheduling that supports imprecise computation and multiprocessors but conventional semi-fixed-priority scheduling algorithms are not optimal. This paper proposes an optimal multiprocessor semi-fixed-priority scheduling algorithm that supports imprecise computation. The proposed algorithm, which integrates Reduction to Uniprocessor (RUN) for Rate Monotonic with Wind-up Part (RMWP), called RUN-RMWP, is superior to Partitioned RMWP algorithm in terms of schedulability analysis. Simulation studies show that RUN-RMWP has a few more preemptions/migrations compared to RUN but confirms its optimality even though conventional semi-fixed priority scheduling algorithms are not optimal.

show abstract

Section: System Modelmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Multiprocessor Semi-fixed-priority Scheduling

Chishiro

2018

Journal of Information Processing

View full text Add to dashboard Cite

show abstract

“…For continuous-time based systems, the T-L plane based scheduling algorithms were studied in [13], [19] and a generalized deadline-partitioned fair (DP-Fair) scheduling model was investigated in [29]. More recently, an optimal approach RUN was studied that reduces the problem to be a uniprocessor scheduling problem [39]. Although these optimal global schedulers can achieve full system utilization, all of them could incur quite high scheduling overhead due to excessive number of scheduling points and context switches.…”

Section: Related Workmentioning

confidence: 99%

Multiprocessor Real-Time Systems with Shared Resources: Utilization Bound and Mapping

Han

Zhu

et al. 2014

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

Abstract-In real-time systems, both scheduling theory and resource access protocols have been studied extensively. However, there is very limited research focusing on scheduling algorithms specifically for real-time systems with shared resources, where the problem becomes more prominent with the emergence of multicore processors. In this paper, focusing on the partitioned-EDF scheduling with the MSRP resource access protocol, we study the utilization bound and efficient task mapping schemes for a set of periodic real-time tasks running on a multicore/multiprocessor system with shared resources. Specifically, we first illustrate the scheduling anomaly where the tasks are schedulable when being mapped on to fewer but not more processors due to synchronization overhead. Then, with such synchronization overhead being considered, we develop a synchronization-cognizant utilization bound. Moreover, we show that finding the optimal mapping of tasks with shared resources is NP-hard and propose two efficient synchronization-cognizant task mapping algorithms (SC-TMA) that rely on the new tightened synchronization overhead and have the goal of achieving better schedulability and balanced workload on deployed processors. Finally, the proposed SC-TMA schemes are evaluated through extensive simulations with synthetic tasks. The results show that, the schedulability ratio and (average) system load under SC-TMA are close to that of an INLP (Integer Non-Linear Programming) based solution for small task systems. When compared to the existing task mapping algorithms, SC-TMA obtain much better schedulability ratio and lower/balanced workload on all processors.

show abstract

“…Semi-partitioned scheduling was first proposed for supporting soft real-time (SRT) sporadic task systems for which bounded deadline tardiness is allowed [1]. Subsequently, several semi-partitioned algorithms were proposed for hard real-time (HRT) systems [2,3,6,7,8,11,13,14,15,16,17,18,19,20,25].…”

Section: Introductionmentioning

confidence: 99%

“…Of the HRT algorithms cited above, two are optimal, at least in theory, namely RUN [25] and EKG [3]. However, both are optimal only for implicit deadline periodic task systems, and EKG becomes optimal (for periodic systems) only when a configurable parameter k becomes arbitrarily close to the number of processors, which unrealistically increases preemption frequency.…”

Section: Introductionmentioning

confidence: 99%

Optimal Semi-Partitioned Scheduling in Soft Real-Time Systems

Anderson

Erickson

Devi

et al. 2015

J Sign Process Syst

View full text Add to dashboard Cite

Semi-partitioned real-time scheduling algorithms extend partitioned ones by allowing a (usually small) subset of tasks to migrate. The first such algorithm to be proposed was directed at soft real-time (SRT) sporadic task systems where bounded deadline tardiness is acceptable. That algorithm, called EDF-fm, is able to fully utilize the underlying hardware platform's available capacity. Moreover, it has the desirable practical property that migrations are boundary-limited, i.e., they can only occur at job boundaries. Unfortunately, EDF-fm requires restrictions on pertask utilizations, and thus is not optimal. In this paper, a new boundary-limited, semi-partitioned algorithm is presented for SRT systems that is the first such algorithm to be optimal. This algorithm, called EDF-os, is similar to EDF-fm but utilizes several new mechanisms that obviate the need for per-task utilization restrictions. Experiments presented herein show that, not only is EDF-os provably better than EDF-fm with respect to schedulability, tardiness bounds under EDF-os are often much lower as well.

show abstract

RUN: Optimal Multiprocessor Real-Time Scheduling via Reduction to Uniprocessor

Cited by 99 publications

References 17 publications

Multiprocessor Semi-fixed-priority Scheduling

Multiprocessor Semi-fixed-priority Scheduling

Multiprocessor Real-Time Systems with Shared Resources: Utilization Bound and Mapping

Optimal Semi-Partitioned Scheduling in Soft Real-Time Systems

Contact Info

Product

Resources

About