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

Qi, Xuan; Zhu, Dakai; Aydın, Hakan

doi:10.1007/s11241-011-9121-1

Cited by 9 publications

(4 citation statements)

References 45 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In fact, this model aligns very well with cluster-based scheduling approaches, which have been shown to improve the percentage of task sets that can be found schedulable [25].…”

Section: A More Flexible Dispatching Modelmentioning

confidence: 63%

Ada and many-core platforms

2013

View full text Add to dashboard Cite

show abstract

“…In fact, this model aligns very well with cluster-based scheduling approaches, which have been shown to improve the percentage of task sets that can be found schedulable [25].…”

Section: A More Flexible Dispatching Modelmentioning

confidence: 63%

Ada and many-core platforms

2013

View full text Add to dashboard Cite

show abstract

“…The real time software development industry assigns harmonic period to tasks to achieve full utilization and fault tolerant system. The cluster based tasks assignment algorithm for hierarchical real time system is as explained in Algorithm 2 55 …”

Section: Methodology and Implementation Detailsmentioning

confidence: 99%

Cluster formation techniques for hierarchical real time tasks allocation on multiprocessor system

Talmale

Shrawankar

2021

Concurrency and Computation

View full text Add to dashboard Cite

Summary Real‐time systems are nowadays extensively used in most time‐critical embedded applications. The existing multiprocessor real‐time scheduling algorithms are based on partitioned and global scheduling approaches. The partitioned‐based algorithms suffer poor utilization bound, load balancing, not compatible for an open system environment, and the global scheduling approach faces problems like high scheduling, migration overhead. Cluster scheduling represents a hybrid scheduling approach which consists of a set of processors as clusters and tasks scheduled to each processor of clusters using a global scheduling approach. The different cluster formation heuristics are investigated for homogenous clusters. The main objective of this article is to propose task utilization‐based cluster formation and harmonic period aware task allocation for a hierarchical real‐time system on a multiprocessor platform. Tasks with high utilization, cluster size tune to a smaller value to achieve high utilization. Tasks with low utilization, the size of cluster tune to larger to reduce migration and scheduling overheads. Experimentation performed on multiprocessor real‐time simulator with a different set of tasks, multiprocessor system, different tasks utilization, and cluster size. Simulation results show that cluster base approach increases the number of tasks scheduled on a multiprocessor system, system utilization, and reduces response time, migration, and preemption overheads.

show abstract

“…Clustering techniques as discussed in Qi et al (2011) and Andersson and Tovar (2006) can also help reducing the number of task migrations and preemptions when the system is not fully utilized. They divide the platform into clusters of size k (i.e., subsets of k processors).…”

Section: Clusteringmentioning

confidence: 99%

An optimal boundary fair scheduling

Nelissen

Guo

et al. 2014

Real-Time Syst

Self Cite

View full text Add to dashboard Cite

Nowadays, many real-time operating systems discretize the time relying on a system time unit. To take this behavior into account, real-time scheduling algorithms must adopt a discrete-time model in which both timing requirements of tasks and their time allocations have to be integer multiples of the system time unit. That is, tasks cannot be executed for less than one time unit, which implies that they always have to achieve a minimum amount of work before they can be preempted. Assuming such a discrete-time model, the authors of Zhu et al. (10):1411-1425, 2011) proposed an efficient "boundary fair" algorithm (named BF) and proved its optimality for the scheduling of periodic tasks while achieving full system utilization. However, BF cannot handle sporadic tasks due to their inherent irregular and unpredictable job release patterns. In this paper, we propose an optimal boundary-fair scheduling algorithm for sporadic tasks (named BF 2 ), which follows the same principle as BF by making scheduling decisions only at the job arrival times and (expected) task deadlines. This new algorithm was implemented in Linux and we show through experiments conducted upon a multicore machine that BF 2 outperforms the stateof-the-art discrete-time optimal scheduler (PD 2 ), benefiting from much less scheduling overheads. Furthermore, it appears from these experimental results that BF 2 is barely dependent on the length of the system time unit while PD 2 -the only other existing solution for the scheduling of sporadic tasks in discrete-time systems-sees its number of preemptions, migrations and the time spent to take scheduling decisions increasing linearly when improving the time resolution of the system.

show abstract

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

Cited by 9 publications

References 45 publications

Ada and many-core platforms

Ada and many-core platforms

Cluster formation techniques for hierarchical real time tasks allocation on multiprocessor system

An optimal boundary fair scheduling

Contact Info

Product

Resources

About