A log-linear (2+5/6)-approximation algorithm for parallel machine scheduling with a single orthogonal resource

08/31/2021
by   Adrian Naruszko, et al.
0

As the gap between compute and I/O performance tends to grow, modern High-Performance Computing (HPC) architectures include a new resource type: an intermediate persistent fast memory layer, called burst buffers. This is just one of many kinds of renewable resources which are orthogonal to the processors themselves, such as network bandwidth or software licenses. Ignoring orthogonal resources while making scheduling decisions just for processors may lead to unplanned delays of jobs of which resource requirements cannot be immediately satisfied. We focus on a classic problem of makespan minimization for parallel-machine scheduling of independent sequential jobs with additional requirements on the amount of a single renewable orthogonal resource. We present an easily-implementable log-linear algorithm that we prove is 25/6-approximation. In simulation experiments, we compare our algorithm to standard greedy list-scheduling heuristics and show that, compared to LPT, resource-based algorithms generate significantly shorter schedules.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/13/2021

Multi-Resource List Scheduling of Moldable Parallel Jobs under Precedence Constraints

The scheduling literature has traditionally focused on a single type of ...
research
04/21/2020

Scheduling with Communication Delays via LP Hierarchies and Clustering

We consider the classic problem of scheduling jobs with precedence const...
research
05/02/2021

Weighted completion time minimization for capacitated parallel machines

We consider the weighted completion time minimization problem for capaci...
research
01/22/2018

Adaptive parallelism with RMI: Idle high-performance computing resources can be completely avoided

In practice, standard scheduling of parallel computing jobs almost alway...
research
08/31/2021

Plan-based Job Scheduling for Supercomputers with Shared Burst Buffers

The ever-increasing gap between compute and I/O performance in HPC platf...
research
01/17/2019

Scheduling Jobs with Random Resource Requirements in Computing Clusters

We consider a natural scheduling problem which arises in many distribute...
research
06/05/2020

Single-machine scheduling with an external resource

This paper studies the complexity of single-machine scheduling with an e...

Please sign up or login with your details

Forgot password? Click here to reset