A Hybrid Real-Time Scheduling Approach for Large-Scale Multicore Platforms

Calandrino, J.M.; Anderson, James H.; Baumberger, Dan

doi:10.1109/ecrts.2007.81

Cited by 90 publications

(78 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There are two main steps in cluster scheduling: first, tasks are partitioned/allocated to clusters; then, within each cluster, tasks are scheduled by a global scheduler (Baruah 2007;Calandrino et al 2007;Shin et al 2008). It can be seen that, the schedulability of a task set under cluster scheduling depends not only on the task allocation/partitioning schemes, but also on the global scheduler adopted within each cluster, in addition to the number of clusters and processors in a system.…”

Section: Cluster Scheduling and Problem Descriptionmentioning

confidence: 99%

“…In this approach, processors are grouped into clusters and tasks are partitioned among different clusters. For tasks that are allocated to a cluster, different global scheduling policies (e.g., global-EDF) can be adopted (Baruah 2007;Bletsas and Andersson 2009;Calandrino et al 2007;Shin et al 2008). Note that, cluster scheduling is a general approach, which will reduce to partitioned scheduling when there is only one processor in each cluster.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Cluster scheduling for real-time systems: utilization bounds and run-time overhead

Zhu

Aydın

2011

Real-Time Syst

View full text Add to dashboard Cite

Cluster scheduling, where processors are grouped into clusters and the tasks that are allocated to one cluster are scheduled by a global scheduler, has attracted attention in multiprocessor real-time systems research recently. In this paper, assuming that an optimal global scheduler is adopted within each cluster, we investigate the worst-case utilization bounds for cluster scheduling with different task allocation/partitioning heuristics. First, we develop a lower limit on the utilization bounds for cluster scheduling with any reasonable task allocation scheme. Then, the lower limit is shown to be the exact utilization bound for cluster scheduling with the worstfit task allocation scheme. For other task allocation heuristics (such as first-fit, bestfit, first-fit decreasing, best-fit decreasing and worst-fit decreasing), higher utilization bounds are derived for systems with both homogeneous clusters (where each cluster has the same number of processors) and heterogeneous clusters (where clusters have different number of processors). In addition, focusing on an efficient optimal global scheduler, namely the boundary-fair (Bfair) algorithm, we propose a period-aware task allocation heuristic with the goal of reducing the scheduling overhead (e.g., the number of scheduling points, context switches and task migrations). Simulation results indicate that the percentage of task sets that can be scheduled is significantly improved under cluster scheduling even for small-size clusters, compared to that of the partitioned scheduling. Moreover, when comparing to the simple generic task Real-Time Syst (2011) 47: 253-284 allocation scheme (e.g., first-fit), the proposed period-aware task allocation heuristic markedly reduces the scheduling overhead of cluster scheduling with the Bfair scheduler.

show abstract

Section: Cluster Scheduling and Problem Descriptionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Cluster scheduling for real-time systems: utilization bounds and run-time overhead

Zhu

Aydın

2011

Real-Time Syst

View full text Add to dashboard Cite

show abstract

“…On the other hand, global algorithms introduce large amount of overheads in large platforms [7]. The scheduling scheme has been shown in Figure 2.…”

Section: Partitioned Schedulingmentioning

confidence: 99%

Resource Sharing under Multiprocessor Semi-partitioned Scheduling

Afshar

Nemati

Nolte

2012

2012 IEEE International Conference on Embedded and Real-Time Computing Systems and Applications

View full text Add to dashboard Cite

Semi-partitioned scheduling has been the subject of interest compared to conventional global and partitioned scheduling algorithms for multiprocessors due to better utilization results. In Semi-partitioned scheduling most of tasks are assigned to fixed processors while a few number of tasks are split up and allocated to different processors.Various techniques have been proposed recently on different assigning protocols under semi-partitioned scheduling. Yet an appropriate synchronization mechanism for resource sharing in semi-partitioned scheduling have not been investigated. In this thesis we propose two methods for handling resource sharing under semipartitioned scheduling on multiprocessor platforms. The main challenge is handling the resource requests of tasks that are split over multiple processors.The solutions include handling non-split tasks as well as split tasks over requests for shared resources in the system. In this thesis we investigate delays caused by blocking on resources. Furthermore, we perform the schedulability analysis for both algorithms.Finally we evaluate the performance of our proposed synchronization algorithms by means of experimental evaluations.

show abstract

“…Under clustered scheduling [4,17], processors are grouped into m c non-overlapping sets (or clusters) of c processors each, where C k denotes the k th cluster. We require uniform cluster sizes and for simplicity assume that m is an integer multiple of c. 2 Each task is statically assigned to a cluster; we let C(T i ) denote the cluster to which task T i has been assigned.…”

Section: Background and Definitionsmentioning

confidence: 99%

“…In particular, the OMLP family contains semaphore-based mutual exclusion protocols for global scheduling, partitioned scheduling, and for clustered scheduling [4,17], which is a hybrid (or generalization) of global and partitioned scheduling where tasks are statically assigned to non-overlapping subsets (or clusters) of processors, and each cluster is scheduled using a global policy. We revisit these protocols, denoted as P-OMLP, G-OMLP, and C-OMLP, resp., in greater detail in Sec.…”

Section: Introductionmentioning

confidence: 99%

A Fully Preemptive Multiprocessor Semaphore Protocol for Latency-Sensitive Real-Time Applications

Brandenburg¹

2013

2013 25th Euromicro Conference on Real-Time Systems

View full text Add to dashboard Cite

Independence preservation, a property in real-time locking protocols that isolates latency-sensitive tasks from delays due to unrelated critical sections, is identified, formalized, and studied in detail. The key to independence preservation is to ensure that tasks remain fully preemptive at all times. For example, on uniprocessors, the classic priority inheritance protocol is independence-preserving. It is shown that, on multiprocessors, independence preservation is impossible if job migrations are disallowed. The O(m) independencepreserving protocol (OMIP), a new, asymptotically optimal binary sempahore protocol based on migratory priority inheritance, is proposed and analyzed. The OMIP is the first independence-preserving, real-time, suspension-based locking protocol for clustered job-level fixed-priority scheduling. It is shown to benefit latency-sensitive workloads, both analytically by means of schedulability experiments, and empirically using response-time measurements in LITMUS RT .

show abstract

A Hybrid Real-Time Scheduling Approach for Large-Scale Multicore Platforms

Cited by 90 publications

References 5 publications

Cluster scheduling for real-time systems: utilization bounds and run-time overhead

Cluster scheduling for real-time systems: utilization bounds and run-time overhead

Resource Sharing under Multiprocessor Semi-partitioned Scheduling

A Fully Preemptive Multiprocessor Semaphore Protocol for Latency-Sensitive Real-Time Applications

Contact Info

Product

Resources

About