Compiler Parallelization of SIMPLE for a Distributed Memory Machine
| dc.contributor.author | Pingali, Keshav | en_US |
| dc.contributor.author | Rogers, Anne M. | en_US |
| dc.date.accessioned | 2007-04-23T17:44:27Z | |
| dc.date.available | 2007-04-23T17:44:27Z | |
| dc.date.issued | 1990-01 | en_US |
| dc.description.abstract | In machines like the Intel iPSC/2 and the BBN Butterfly, local memory operations are much faster than inter-processor communication. When writing programs for these machines, programmers must worry about exploiting spatial locality of reference. This is tedious and reduces the level of abstraction at the which the programmer works. We are implementing a parallelizing compiler that will shoulder much of that burden. Given a sequential, shared memory program and a specification of how data structures are to be mapped across the processors, our compiler will perform process decomposition to exploit locality of reference. In this paper, we discuss some experiments in parallelizing SIMPLE, a large scientific benchmark from Los Alamos, for the Intel iPSC/2. | en_US |
| dc.format.extent | 2882515 bytes | |
| dc.format.extent | 606143 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.citation | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR90-1084 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/6924 | |
| dc.language.iso | en_US | en_US |
| dc.publisher | Cornell University | en_US |
| dc.subject | computer science | en_US |
| dc.subject | technical report | en_US |
| dc.title | Compiler Parallelization of SIMPLE for a Distributed Memory Machine | en_US |
| dc.type | technical report | en_US |