Parallel algorithms for hypercube allocation

Y. Chang, L. N. Bhuyan

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)


Parallel algorithms of the hypercube allocation strategies are considered. Although the sequential algorithms of various hypercube allocation strategies are easier to implement, their worst case time complexities exponentially increase as the dimension of the hypercube increases. The authors show that the free processors can be utilized to perform the allocation jobs in parallel to improve the efficiency of the hypercube allocation algorithms. A modified parallel algorithm for the single Gray-Code (GC) strategy is proposed and is shown to be able to recognize more subcubes than the single GC strategy by using the binary reflected Gray code and inverse binary reflected Gray code, without increasing the execution time. Two algorithms for a complete subcube recognition system are also presented and shown to be more efficient and attractive than the sequential one currently used in the hypercube multiprocessor.

Original languageEnglish
Title of host publicationProceedings of 7th International Parallel Processing Symposium, IPPS 1993
PublisherInstitute of Electrical and Electronics Engineers Inc.
Number of pages8
ISBN (Electronic)0818634421, 9780818634420
Publication statusPublished - 1993
Event7th International Parallel Processing Symposium, IPPS 1993 - Newport, United States
Duration: 1993 Apr 131993 Apr 16

Publication series

NameProceedings of 7th International Parallel Processing Symposium, IPPS 1993


Conference7th International Parallel Processing Symposium, IPPS 1993
Country/TerritoryUnited States

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Hardware and Architecture
  • Software
  • Computational Theory and Mathematics
  • Computer Networks and Communications


Dive into the research topics of 'Parallel algorithms for hypercube allocation'. Together they form a unique fingerprint.

Cite this