The most commonly used scheduling algorithm for parallel supercomputers is FCFS with backfilling, as originally introduced in the EASY scheduler. Backfilling means that short jobs …
Multiserver-job systems, where jobs require concurrent service at many servers, occur widely in practice. Essentially all of the theoretical work on multiserver-job systems focuses …
Abstract Multiserver-job (MSJ) systems, where jobs need to run concurrently across many servers, are increasingly common in practice. The default service ordering in many settings …
User estimates of job runtimes have emerged as an important component of the workload on parallel machines, and can have a significant impact on how a scheduler treats different …
X Liu, C Wang, BB Zhou, J Chen… - … on Parallel and …, 2012 - ieeexplore.ieee.org
The cloud computing paradigm is attracting an increased number of complex applications to run in remote data centers. Many complex applications require parallel processing …
JR Challenger, LR Degenaro, JR Giles… - US Patent …, 2010 - Google Patents
(57) ABSTRACT A method is provided for the recovery of an instance of a job manager running on one of a plurality of nodes used to execute the processing elements associated …
Y Huang, N Bessis, P Norrington, P Kuonen… - Future Generation …, 2013 - Elsevier
Job scheduling strategies have been studied for decades in a variety of scenarios. Due to the new characteristics of the emerging computational systems, such as the grid and cloud …
High performance computing (HPC) scheduling landscape currently faces new challenges due to the changes in the workload. Previously, HPC centers were dominated by tightly …
Abstract High-Performance Computing (HPC) domain provided the necessary tools to support the scientific and industrial advancements we all have seen during the last decades …