Publication: A Stencil Complier for the Connection Machine Models CM-2/200
Open/View Files
Date
1993
Published Version
Published Version
Journal Title
Journal ISSN
Volume Title
Publisher
The Harvard community has made this article openly available. Please share how this access benefits you.
Citation
Brickner, Ralph G., William George, S. Lennart Johnsson, Alan Ruttenberg. 1993. A Stencil Complier for the Connection Machine Models CM-2/200. Harvard Computer Science Computer Group Technical Report TR-22-93.
Research Data
Abstract
In this paper we present a Stencil Compiler for the Connection Machine Models CM-2 and CM-200. A stencil is a weighted sum of circularly-shifted CM Fortran arrays. The stencil compiler optimizes the data motion between processing nodes, minimizes the data motion within a node, and minimizes the data motion between registers and local memory in a node. The compiler makes novel use of the communication system and has highly optimized register use. The compiler natively supports two{dimensional stencils, but stencils in three or four dimensions are automatically decomposed. Portions of the system are integrated as part of the CM Fortran programming system, and also as part of the system microcode. The compiler is available as part of the Connection Machine Scientific Software Library (CMSSL) Release 3.1.
Description
Other Available Sources
Keywords
Terms of Use
This article is made available under the terms and conditions applicable to Other Posted Material (LAA), as set forth at Terms of Service