Analyzing the Performance of Allocation Strategies Based on Space-Filling Curves

• Published in: Job Scheduling Strategies for Parallel Processing Vol. 10353; pp. 232 - 251
• Main Authors: Pascual, Jose A., Lozano, Jose A., Miguel-Alonso, Jose
• Format: Book Chapter
• Language: English
• Published: Switzerland Springer International Publishing AG 2017; Springer International Publishing
• Series: Lecture Notes in Computer Science
• Subjects: Allocation; Contiguity; Non-contiguity; Partitioning; Scheduling; Space-filling Curves
• ISBN: 9783319617558; 3319617559
• ISSN: 0302-9743; 1611-3349
• DOI: 10.1007/978-3-319-61756-5_13

Future exascale supercomputers will be composed of thousands of nodes. In those massive systems, the search for physically close nodes will become essential to deliver an optimal environment to execute parallel applications. Schedulers manage those resources, shared by many users and jobs, searching for partitions in which jobs will run. Significant effort has been devoted to develop allocation strategies that maximize system utilization, while providing partitions that are adequate for the communication demands of applications. In this paper we evaluate a class of strategies based on space-filling curves (SFCs) that search for partitions in which nodes are physically close, compared to other alternatives that relax this requirement (e.g. non-contiguous), or make it even more strict (e.g. contiguous). Several metrics are used to assess the quality of an allocation strategy, some based on system utilization, some others measuring the quality of the resulting partitions. Contiguous allocators suffer from severe degradation in terms of system utilization, while non-contiguous allocators provide inadequate partitions. Somewhere in the middle, SFC allocators offer good system utilization while using quite compact partitions. The final metric to decide which allocator is the best depend on the severity of the slowdown suffered by applications when running in non-optimal partitions.