Unstructured grids on SIMD Torus machines

Author

Bjørstad, Petter E. ; Schreiber, Robert

Author_Institution

Dept. of Comput. Sci., Bergen Univ., Norway

fYear

1994

fDate

23-25 May 1994

Firstpage

658

Lastpage

665

Abstract

Unstructured grids lead to unstructured communication on distributed memory parallel computers, a problem that has been considered difficult. We consider adaptive, offline communication routing for a SIMD processor grid. Our approach is empirical. We use large data sets drawn from supercomputing applications instead of an analytic model of communication load. The chief contribution of this paper is an experimental demonstration of the effectiveness of certain routing heuristics. Our routing algorithm is adaptive, nonminimal, and is generally designed to exploit locality. We have a parallel implementation of the router, and we report on its performance

Keywords

distributed memory systems; network routing; parallel architectures; parallel machines; performance evaluation; SIMD Torus machines; SIMD processor grid; adaptive nonminimal routing algorithm; adaptive offline communication routing; distributed memory parallel computers; locality; router performance; routing heuristics; supercomputing applications; unstructured communication; unstructured grids; Computer science; Concurrent computing; Distributed computing; Eigenvalues and eigenfunctions; Grid computing; Load modeling; Routing; Sparse matrices; Testing; Vectors;

fLanguage

English

Publisher

ieee

Conference_Titel

Scalable High-Performance Computing Conference, 1994., Proceedings of the

Conference_Location

Knoxville, TN

Print_ISBN

0-8186-5680-8

Type

conf

DOI

10.1109/SHPCC.1994.296704

Filename

296704