Noncontiguous processor allocation algorithms for mesh-connected multicomputers

  • Lo V
  • Windisch K
  • Liu W
 et al. 
  • 8

    Readers

    Mendeley users who have this article in their library.
  • 106

    Citations

    Citations of this article.

Abstract

Current processor allocation techniques for highly parallel systems are
typically restricted to contiguous allocation strategies for which
performance suffers significantly due to the inherent problem of
fragmentation. As a result, message-passing systems have yet to achieve
the high utilization levels exhibited by traditional vector
supercomputers. We are investigating processor allocation algorithms
which lift the restriction on contiguity of processors in order to
address the problem of fragmentation.
Three noncontiguous processor allocation strategies-Paging allocation,
Random allocation, and the Multiple Buddy Strategy (MBS)-are proposed
and studied in this paper. Simulations compare the performance of the
noncontiguous strategies with that of several well-known contiguous
algorithms. We show that noncontiguous allocation algorithms perform
better overall than the contiguous ones, even when message-passing
contention is considered. We also present the results of experiments on
an Intel Paragon XP/S-15 with 208 nodes that show noncontiguous
allocation is feasible with current technologies.

Author-supplied keywords

  • Fragmentation
  • Mesh
  • Noncontiguous
  • Processor allocation
  • Resource management
  • Scheduling

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Authors

  • Virginia Lo

  • Kurt J. Windisch

  • Wanqian Liu

  • Bill Nitzberg

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free