2015
DOI: 10.1002/cpe.3653
|View full text |Cite
|
Sign up to set email alerts
|

A new auction‐based scheduler for heterogeneous systems with moldable generic resources support

Abstract: SUMMARYSlurm resource management system is used on many TOP500 supercomputers. We present a new auctionbased heterogeneous cluster scheduler plug-in called AUCSCHED2. AUCSCHED2 contributes two major enhancements: the first is the extension of Slurm to support generic resource moldability by specification of resource ranges. The generic resources include accelerators like graphics processing unit or Xeon Phi. The current version of Slurm supports specification of node ranges but not of generic resource ranges. … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2016
2016
2019
2019

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(3 citation statements)
references
References 13 publications
0
3
0
Order By: Relevance
“…In order to design the assessment functions for HPC cluster environments, the nonfunctional requirements for such systems as well as the key indicators describing the effectiveness of scheduling and execution. The most common parameters describing the performance of a scheduling mechanism for HPC clusters are as follows 38–40 : Lowest‐level common switch: The lowest‐level common switch, from which all the nodes allocated to a request can be reached; Spread: The network distance from the first to the last node allocated to a job; Utilization: The utilization is computed as the ratio of the theoretical runtime to the observed runtime. The theoretical runtime cannot be computed easily since it requires the optimal placement.…”
Section: Self‐management and Self‐organization In Hpc Cluster Environmentsmentioning
confidence: 99%
“…In order to design the assessment functions for HPC cluster environments, the nonfunctional requirements for such systems as well as the key indicators describing the effectiveness of scheduling and execution. The most common parameters describing the performance of a scheduling mechanism for HPC clusters are as follows 38–40 : Lowest‐level common switch: The lowest‐level common switch, from which all the nodes allocated to a request can be reached; Spread: The network distance from the first to the last node allocated to a job; Utilization: The utilization is computed as the ratio of the theoretical runtime to the observed runtime. The theoretical runtime cannot be computed easily since it requires the optimal placement.…”
Section: Self‐management and Self‐organization In Hpc Cluster Environmentsmentioning
confidence: 99%
“…The five papers contained in this special issue cover very different areas. The titles of the papers are the following: MPI and UPC Broadcast, Scatter and Gather Algorithms in Xeon Phi A New Auction Based Scheduler for Heterogeneous Systems with Moldable Generic Resources Support Gaspar: A Compositional Aspect‐oriented Approach for Cluster Applications Novo‐G#: A Multidimensional Torus‐based Reconfigurable Cluster for Molecular Dynamics The DEEP Project: An alternative approach to heterogeneous cluster‐computing in the many‐core era …”
Section: Forewordmentioning
confidence: 99%
“…In the next paper, the authors propose several optimizations for schedulers of heterogeneous systems . First, they propose the possibility of resource range specifications to improve resource specification within batch jobs.…”
Section: Forewordmentioning
confidence: 99%