Anne Marie Rogers. Compiling for Locality of Reference. Technical Report TR 91-1195, Department of Computer Science, Cornell University, March 1991. PhD thesis. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Compiling for Shared-Memory and Message-Passing Computer - Larus (1994) (10 citations) (Correct)
....time, it must be computed during program execution. Run time techniques are necessary in common and mundane situations, for example doubly subscripted array references. Two techniques for computing this mapping are run time resolution and inspector executor systems. With run time resolution [34], every processor at reference A[B[i] computes B[i] examines the resulting value x to determine if it owns A[x] and if so, finds the processor to which to send the value. Run time resolution is costly because it requires fine grain message passing, performs an expensive location to processor ....
Anne Marie Rogers. Compiling for Locality of Reference. Technical Report TR 91-1195, Department of Computer Science, Cornell University, March 1991. PhD thesis.
HPF on Fine-Grain Distributed Shared Memory: Early Experience - Chandra, Larus (1996) (5 citations) (Correct)
....of non regular programs. 1 Introduction High Performance Fortran (HPF) 20] is the product of many years of collective experience with compiling for distributed memory machines. Researchers and companies have built compilers that compile HPF like languages to efficient message passing code [7, 13, 15, 19, 29, 34]. Yet, the domain of programs for which such compilers generate efficient code is very limited: good results have been demonstrated only on regular programs. Programs that use complicated array subscripts, such as those in the Perfect Club benchmark suite [11] have not been successfully compiled ....
....[19,34] into SPMD code that, in essence, synthesizes a global name space using explicit messages [22] Unfortunately, the compiler depends on complete and accurate program analysis [34] to generate good message passing code. Programs that cannot be completely analyzed show poor performance [29]. An alternative approach leaves the onerous task of implementing a program s shared address space to an underlying system. With an underlying coherent shared address space, compilers can greatly expand the range of programs that they can compile efficiently, as demonstrated by the Illinois ....
[Article contains additional citation context not shown here]
Anne Marie Rogers. Compiling for Locality of Reference. Technical Report TR 91-1195, Department of Computer Science, Cornell University, March 1991. PhD thesis.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC