Selective Buddy Allocation for Scheduling Parallel Jobs on Clusters

Authors:
Vijay Subramani;Rajkumar Kettimuthu;Srividya Srinivasan;Jeanette Johnston;P. Sadayappan
Affiliations:
-;-;-;-;-
Venue:
CLUSTER '02 Proceedings of the IEEE International Conference on Cluster Computing
Year:
2002

Citing 0
Cited 11

Scheduling Security-Critical Real-Time Applications on Clusters

IEEE Transactions on Computers
PARSE: A Tool for Parallel Application Run Time Sensitivity Evaluation

ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
Selective preemption strategies for parallel job scheduling

International Journal of High Performance Computing and Networking
Application-aware management of parallel simulation collections

Proceedings of the 14th ACM SIGPLAN symposium on Principles and practice of parallel programming
A two-phase scheduling strategy for real-time applications with security requirements on heterogeneous clusters

Computers and Electrical Engineering
Routing-contained virtualization based on Up*/Down* forwarding

HiPC'07 Proceedings of the 14th international conference on High performance computing
SAQA: A Self-Adaptive QoS-Aware Scheduling Algorithm for Real-Time Tasks on Heterogeneous Clusters

CCGRID '10 Proceedings of the 2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing
A network performance sensitivity metric for parallel applications

International Journal of High Performance Computing and Networking
Contention-aware node allocation policy for high-performance capacity systems

Proceedings of the 2012 Interconnection Network Architecture: On-Chip, Multi-Chip Workshop
Communication-aware processor allocation for supercomputers

WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Parallel application-level behavioral attributes for performance and energy management of high-performance computing systems

Cluster Computing

Quantified Score

Hi-index	0.03

Visualization

Abstract

In this paper, we evaluate the performance implications of using a buddy scheme for contiguous node allocation, in conjunction with a backfilling job scheduler for clusters. When a contiguous node allocation strategy is used, there is a trade-off between improved run-time of jobs (due to reduced link contention and lower communication overhead) and increased wait-time of jobs (due to external fragmentation of the processor system). Using trace-based simulation, a buddy strategy for contiguous node allocation is shown to be unattractive compared to the standard noncontiguous allocation strategy used in all production job schedulers. A simple but effective scheme for selective buddy allocation is then proposed, that is shown to perform better than non-contiguous allocation.