Characterization of backfilling strategies for parallel job scheduling

S Srinivasan, R Kettimuthu… - Proceedings …, 2002 - ieeexplore.ieee.org
Although there is wide agreement that backfilling produces significant benefits in scheduling
of parallel jobs, there is no clear consensus on which backfilling strategy is preferable eg …

Enhanced round-robin algorithm in the cloud computing environment for optimal task scheduling

F Alhaidari, TZ Balharith - Computers, 2021 - mdpi.com
Recently, there has been significant growth in the popularity of cloud computing systems.
One of the main issues in building cloud computing systems is task scheduling. It plays a …

Selective reservation strategies for backfill job scheduling

S Srinivasan, R Kettimuthu, V Subramani… - … Strategies for Parallel …, 2002 - Springer
Although there is wide agreement that backfilling produces significant benefits in scheduling
of parallel jobs, there is no clear consensus on which backfilling strategy is preferable …

Using moldability to improve the performance of supercomputer jobs

W Cirne, F Berman - Journal of Parallel and Distributed Computing, 2002 - Elsevier
In most parallel supercomputers, submitting a job for execution involves specifying (i) how
many processors are to be allocated to the job, and (ii) for how long these processors are to …

Parallel computer workload modeling with markov chains

B Song, C Ernemann, R Yahyapour - Workshop on Job Scheduling …, 2004 - Springer
In order to evaluate different scheduling strategies for parallel computers, simulations are
often executed. As the scheduling quality highly depends on the workload that is served on …

Tuning easy-backfilling queues

J Lelong, V Reis, D Trystram - … Workshop, JSSPP 2017, Orlando, FL, USA …, 2018 - Springer
EASY-Backfilling is a popular scheduling heuristic for allocating jobs in large scale High
Performance Computing platforms. While its aggressive reservation mechanism is fast and …

Multi-Layer In-Memory Processing

D Fujiki, A Khadem, S Mahlke… - 2022 55th IEEE/ACM …, 2022 - ieeexplore.ieee.org
In-memory computing provides revolutionary changes to computer architecture by fusing
memory and computation, allowing data-intensive computations to reduce data …

Adapting batch scheduling to workload characteristics: What can we expect from online learning?

A Legrand, D Trystram, S Zrigui - 2019 IEEE International …, 2019 - ieeexplore.ieee.org
Despite the impressive growth and size of super-computers, the computational power they
provide still cannot match the demand. Efficient and fair resource allocation is a critical task …

Online tuning of EASY-backfilling using queue reordering policies

E Gaussier, J Lelong, V Reis… - IEEE Transactions on …, 2018 - ieeexplore.ieee.org
The EASY-FCFS heuristic is the basic building block of job scheduling policies in most
parallel High Performance Computing platforms. Despite its simplicity, and the guarantee of …

Selective preemption strategies for parallel job scheduling

R Kettimuthu, V Subramani… - … Journal of High …, 2005 - inderscienceonline.com
Although theoretical results have been established regarding the utility of preemptive
scheduling in reducing average job turnaround time, job suspension/restart is not much …