Multigrid Algorithms on the Hypercube Multiprocessor

Tony Chan, Youcef Saad

Research output: Contribution to journalArticlepeer-review

86 Scopus citations


This paper examines several ways of implementing multigrid algorithms on the hypercube multiprocessor. We consider both the standard multigrid algorithms and a concurrent version proposed by Gannon and Van Rosendale. We present several mappings of the mesh points onto the nodes of the cube. The main property of these mappings, which are based on binary reflected Gray codes, is that the distance between neighboring grid points remains constant from one grid level to another. This results in a communication effective implementation of multigrid algorithms on the hypercube multiprocessor.

Original languageEnglish (US)
Pages (from-to)969-977
Number of pages9
JournalIEEE Transactions on Computers
Issue number11
StatePublished - Jan 1 1986


  • Gray codes
  • hvnercube multiprocessor
  • multigrid algorithms
  • parallel computing
  • partial differential equations

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture
  • Computational Theory and Mathematics


Dive into the research topics of 'Multigrid Algorithms on the Hypercube Multiprocessor'. Together they form a unique fingerprint.

Cite this