MFCS 1988
Comparing Interconnection Networks
Abstract
Abstract We review results on embedding network and program structures into popular parallel computer structures. Such embeddings can be viewed as high level descriptions of efficient methods to simulate an algorithm designed for one type of architecture on a different network structure and/or techniques to distribute data/program variables to achieve optimum use of all available processors.
Authors
Keywords
No keywords are indexed for this paper.
Context
- Venue
- International Symposium on Mathematical Foundations of Computer Science
- Archive span
- 1973-2025
- Indexed papers
- 3045
- Paper id
- 92630440226701096