Quotient Networks

John P. Fishburn, Raphael A. Finkel

Research output: Contribution to journalArticlepeer-review

61 Scopus citations

Abstract

A large-network algorithm solves a problem of size N on a network of N processors. We present a method for transforming certain large networks into quotient networks that emulate those large networks with fewer processors. Large-network algorithms are easily modified to execute on the quotient network. The emulations result in no loss in execution efficiency. Quotient networks allow algorithms to be designed assuming any number of processors and executed efficiently at a great savings in hardware cost.

Original languageEnglish
Pages (from-to)288-295
Number of pages8
JournalIEEE Transactions on Computers
VolumeC-31
Issue number4
DOIs
StatePublished - Apr 1982

Keywords

  • Interconnection networks
  • large problem size/machine size
  • parallel FFT
  • SIMD computers
  • theory of parallel algorithms

ASJC Scopus subject areas

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

Fingerprint

Dive into the research topics of 'Quotient Networks'. Together they form a unique fingerprint.

Cite this