An Empirical Comparison of Global, Partitioned, and Clustered Multiprocessor EDF Schedulers

Bastoni, Andrea; Brandenburg, Björn B.; Anderson, James H.

doi:10.1109/rtss.2010.23

Cited by 117 publications

(104 citation statements)

References 15 publications

Supporting

Mentioning

102

Contrasting

Order By: Relevance

“…Interestingly, the aTC-allocator success ratio appears to be quite close to that of DSE, which allows concluding that our algorithm is sufficiently good at finding feasible partitions. Notably, the success ratio decreases when the total utilization in isolation reaches 2.4 − 2.5 out of 4, which is consistent with state-ofthe-art results in the analysis of schedulable utilization with partitioned scheduling [6]. In the next section we analyze in detail why aTC-allocator does not reach good success rates for higher utilizations.…”

Section: Results With Atc Etbsupporting

confidence: 83%

Seeking Time-Composable Partitions of Tasks for COTS Multicore Processors

Fernández

Abella

Quiñones

et al. 2015

2015 IEEE 18th International Symposium on Real-Time Distributed Computing

View full text Add to dashboard Cite

Abstract-The timing verification of real-time singlecore systems involves a timing analysis step that yields an Execution Time Bound (ETB) for each task, followed by a schedulability analysis step, where the scheduling attributes of the individual tasks, including the ETB, are studied from the system level perspective. The transition between those two steps involves accounting for the interference effects that arise when tasks contend for access to shared resource. The advent of multicore processors challenges the viability of this two-step approach because several complex contention effects at the processor level arise that cause tasks to be unable to make progress while actually holding the CPU, which are very difficult to tightly capture by simply inflating the tasks' ETB. In this paper we show how contention on access to hardware shared resources creates a circular dependence between the determination of tasks' ETB and their scheduling at run time. To help loosen this knot we present an approach that acknowledges different flavors of time composability, examining in detail the variant intended for partitioned scheduling, which we evaluate on two real processor boards used in the space domain.

show abstract

Section: Results With Atc Etbsupporting

confidence: 83%

Seeking Time-Composable Partitions of Tasks for COTS Multicore Processors

Fernández

Abella

Quiñones

et al. 2015

2015 IEEE 18th International Symposium on Real-Time Distributed Computing

View full text Add to dashboard Cite

show abstract

“…We can assume that this gap in system load between the two strategies will increase with more processors. This is in accordance with the results of Bastoni et al stating that G-EDF is not a viable choice for hard real-time systems with a large number of processors (24 in their study) (Bastoni et al, 2010). The computation times of the jobs are shorter with P-EDF compared to G-EDF as shown in Figure 7.…”

Section: Application Examplesupporting

confidence: 91%

Simulation of Real-time Multiprocessor Scheduling with Overheads

Chéramy¹,

Déplanche²,

Hladik³

2013

Proceedings of the 3rd International Conference on Simulation and Modeling Methodologies, Technologies and Applications

View full text Add to dashboard Cite

Abstract:Numerous scheduling algorithms were and still are designed in order to handle multiprocessor architectures, raising new issues due to the complexity of such architectures. Moreover, evaluating them is difficult without a real and complex implementation. Thus, this paper presents a tool that intends to facilitate the study of schedulers by providing an easy way of prototyping. Compared to the other scheduling simulators, this tool takes into account the impact of the caches through statistical models and includes direct overheads such as context switches and scheduling decisions.

show abstract

“…For any time t > 0, the notation t − is used to denote the time t − ε in the limit ε → 0+, and the notation t + is used to denote the time t + ε in the limit ε → 0+. 2 The SRT analysis framework used here has been adopted from a framework for ordinary sporadic task systems first proposed in [7], and subsequently used in several other papers [15][16][17]. …”

Section: Response Time Boundmentioning

confidence: 99%

“…4 Each such parallel task set was generated by creating parallel tasks until total utilization exceeded U sum , and by then reducing the last task's utilization so that the total system utilization equalled U sum . For each generated system, we first checked schedulability (i.e., the ability to ensure bounded 4 For systems with higher processor counts, recent experimental work [2] suggests that when overheads are considered, clustered scheduling approaches (where groups of processors with low processor counts that share low-level caches are scheduled globally) are better than global approaches. response times) and the magnitude of response time bounds using Theorem 1.…”

Section: Experimental Evaluationmentioning

confidence: 99%

Supporting Soft Real-Time Parallel Applications on Multicore Processors

Liu

Anderson

2012

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

Self Cite

View full text Add to dashboard Cite

The prevalence of multicore processors has resulted in the wider applicability of parallel programming models such as OpenMP and MapReduce. A common goal of running parallel applications implemented under such models is to guarantee bounded response times while maximizing system utilization. Unfortunately, little previous work has been done that can provide such performance guarantees. In this paper, this problem is addressed by applying soft real-time scheduling analysis techniques. Analysis and conditions are presented for guaranteeing bounded response times for parallel applications under global EDF multiprocessor scheduling.

show abstract

An Empirical Comparison of Global, Partitioned, and Clustered Multiprocessor EDF Schedulers

Cited by 117 publications

References 15 publications

Seeking Time-Composable Partitions of Tasks for COTS Multicore Processors

Seeking Time-Composable Partitions of Tasks for COTS Multicore Processors

Simulation of Real-time Multiprocessor Scheduling with Overheads

Supporting Soft Real-Time Parallel Applications on Multicore Processors

Contact Info

Product

Resources

About