Optimal Virtual Cluster-based Multiprocessor Scheduling

04/06/2020
by   Arvind Easwaran, et al.
0

Scheduling of constrained deadline sporadic task systems on multiprocessor platforms is an area which has received much attention in the recent past. It is widely believed that finding an optimal scheduler is hard, and therefore most studies have focused on developing algorithms with good processor utilization bounds. These algorithms can be broadly classified into two categories: partitioned scheduling in which tasks are statically assigned to individual processors, and global scheduling in which each task is allowed to execute on any processor in the platform. In this paper we consider a third, more general, approach called cluster-based scheduling. In this approach each task is statically assigned to a processor cluster, tasks in each cluster are globally scheduled among themselves, and clusters in turn are scheduled on the multiprocessor platform. We develop techniques to support such cluster-based scheduling algorithms, and also consider properties that minimize total processor utilization of individual clusters. In the last part of this paper, we develop new virtual cluster-based scheduling algorithms. For implicit deadline sporadic task systems, we develop an optimal scheduling algorithm that is neither Pfair nor ERfair. We also show that the processor utilization bound of US-EDFm/(2m-1) can be improved by using virtual clustering. Since neither partitioned nor global strategies dominate over the other, cluster-based scheduling is a natural direction for research towards achieving improved processor utilization bounds.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/14/2010

Semi-Partitioned Hard Real-Time Scheduling with Restricted Migrations upon Identical Multiprocessor Platforms

Algorithms based on semi-partitioned scheduling have been proposed as a ...
research
03/11/2020

Utilization Difference Based Partitioned Scheduling of Mixed-Criticality Systems

Mixed-Criticality (MC) systems consolidate multiple functionalities with...
research
03/11/2020

Demand-based Scheduling of Mixed-Criticality Sporadic Tasks on One Processor

Strategies that artificially tighten high-criticality task deadlines in ...
research
12/23/2021

Comparative Analysis of Different Techniques of Real Time Scheduling for Multi-Core Platform

As the demand of real time computing increases day by day, there is a ma...
research
12/22/2018

Bioinformatics Computational Cluster Batch Task Profiling with Machine Learning for Failure Prediction

Motivation: Traditional computational cluster schedulers are based on us...
research
07/20/2018

An Improved Speedup Factor for Sporadic Tasks with Constrained Deadlines under Dynamic Priority Scheduling

Schedulability is a fundamental problem in real-time scheduling, but it ...
research
12/19/2022

A Makespan and Energy-Aware Scheduling Algorithm for Workflows under Reliability Constraint on a Multiprocessor Platform

Many scientific workflows can be modeled as a Directed Acyclic Graph (he...

Please sign up or login with your details

Forgot password? Click here to reset