A Tie-Breaking Strategy for Processor Allocation in Meshes

Authors:
Christopher R. Johnson;David P. Bunde;Vitus J. Leung
Affiliations:
-;-;-
Venue:
ICPPW '10 Proceedings of the 2010 39th International Conference on Parallel Processing Workshops
Year:
2010

Citing 0
Cited 1

Using task migration to improve non-contiguous processor allocation in NoC-based CMPs

Journal of Systems Architecture: the EUROMICRO Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

Many of the proposed algorithms for allocating processors to jobs in supercomputers choose arbitrarily among potential allocations that are "equally good" according to the allocation algorithm. In this paper, we add a parametrized tie-breaking strategy to the MC1x1 allocation algorithm for mesh supercomputers. This strategy attempts to favor allocations that preserve large regions of free processors, benefiting future allocations and improving machine performance. Trace-based simulations show the promise of our strategy; with good parameter choices, most jobs benefit and no class of jobs is harmed significantly.