Divide-and-conquer mapping of parallel programs onto hypercube computers

Sam Lor, Hong Shen, Piyush Maheshwari

Research output: Contribution to journalArticlepeer-review

5 Citations (Scopus)


Mapping of parallel programs onto parallel computers for efficient execution is a fundamental problem of great significance in parallel processing. This paper describes a heuristic algorithm for mapping arbitrary parallel programs onto hypercube computers using a divide-and-conquer technique. The running time of our algorithm is O(dn3), where n is the number of tasks in the parallel program and d is the dimension of the hypercube computer. The algorithm is implemented in C + + and its performance is evaluated through extensive testing and analysis.

Original languageEnglish
Pages (from-to)373-390
Number of pages18
JournalJournal of Systems Architecture
Issue number6-7
Publication statusPublished - Apr 1997
Externally publishedYes


  • Clustering
  • Graph partitioning
  • Heuristic algorithm
  • Hypercube
  • Mapping problem
  • Task allocation/assignment


Dive into the research topics of 'Divide-and-conquer mapping of parallel programs onto hypercube computers'. Together they form a unique fingerprint.

Cite this