• DocumentCode
    2033635
  • Title

    Contention-Free 2D-Mesh Cluster Allocation in Hypercubes

  • Author

    Turner, Stephen W. ; Ni, Lionel M. ; Cheng, Betty H C

  • Author_Institution
    Michigan State University
  • Volume
    2
  • fYear
    1993
  • fDate
    16-20 Aug. 1993
  • Firstpage
    125
  • Lastpage
    129
  • Abstract
    Tkaditionally, each job in a hypercube multiprocessor is allocated with a subcube so that communication interference among jobs may be avoided. Although the hypercube is a powerful processor topology, the 2D mesh is a more popular application topology. This paper predents a 2Dmesh cluster allocation strategy for hypercubes. The proposed auxiliary free list procwor allocation strategy can efficiently allocate 2D-mesh clusters without size constraints, can reduce average job turnaround time compared with that based on subcubc allocation strategies, and can guarantee no communication interference among allocated clusters when the underlying hypercube implements deadlockfree Ecube routing. The proposed auxiIiary free list strategy can be easily implemented on hypercube multicomputers to increage processor utilization.
  • Keywords
    Computer science; Hypercubes; Interference constraints; Network topology; Parallel processing; Partial differential equations; Performance analysis; Reflective binary codes; Routing; System recovery;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Parallel Processing, 1993. ICPP 1993. International Conference on
  • Conference_Location
    Syracuse, NY, USA
  • ISSN
    0190-3918
  • Print_ISBN
    0-8493-8983-6
  • Type

    conf

  • DOI
    10.1109/ICPP.1993.64
  • Filename
    4134196