A. Rogers
K. Pingali
Abstract
In the context of sequential computers, it is common practice to exploit temporal locality of reference through devices such as caches and virtual memory. In the context of multiprocessors, we believe that it is equally important to exploit spatial locality of reference. We are developing a system which, given a sequential program and its domain decomposition, performs process decomposition so as to enhance spatial locality of reference. We describe an application of this method - generating code from shared-memory programs for the (distributed memory) Intel iPSC/2.
- 1 A. Karp, Programming for Parallelism, IEEE Computer, May 1987.]] Google Scholar
Digital Library
- 2 A. Gottlieb et al., The NYU Ultracomputer- Designing an MIMD Shared Memory Parallel Cornputer, IEEE Transactions on Computers, February 1983.]]Google Scholar
- 3 J. Peir and D. Gajski, Camp: a programming aide for multiprocessors, Proceedings of the Internalional Conference on Parallel Processin!l, 1986.]]Google Scholar
- 4 Arvind, R. Nikhil and K. Pingali, Id Nouveau: Language and Operational Semantics, CSG Memo, M.I.T., September 1987.]]Google Scholar
- 5 Arvind, R. Nikhil, K. Pingali, I-structures: Data Structures for Parallel Computing, Proceedings of Workshop on Graph Reduction, Santa Fe, Springer Verlag LNCS 279, September 1986.]] Google ScholarDigital Library
- 6 D. Padua and M. Wolfe, Advanced Compiler Optimizations For Supercomputers, Communications of the A CM, December 1986.]] Google ScholarDigital Library
- 7 G. Fox et al, Solving Problems on Concurrent Processors, Volume 1, Prentice-Hall, Englewood Cliffs, New Jersey, 1986.]] Google ScholarDigital Library
- 8 Communication from Intel Corporation.]]Google Scholar
- 9 L.M. Censier and P. Feautrier, A New Solution to the Coherence Problem in Multicache Systems, IEEE Transactions on Computers, December 1978.]]Google Scholar
- 10 S.H.Bokhari, Assignment Problems in Parallel and Distributed Computing, Kluwer Academic Publishing, 1987.]] Google ScholarDigital Library
- 11 H. Stone, Multiprocessor Scheduling with the aid of Network Flow Algorithms, IEEE Transactions on Software Engineering, January 1977.]]Google Scholar
- 12 D. Callahan and K. Kennedy, Compiling Programs for Distributed-Memory Multiprocessors, The Journal of Supercomputing, October 1988.]]Google Scholar
- 13 C. Koelbel, P. Mehrotra, and J. Van Rosendale, Semi-Automatic Domain Decomposition in Blaze, Proceedings of the International Conference on Parallel Processing, 1987.]]Google Scholar
- 14 R. L. Constable et M, Implementing Mathematics with the Nuprl Proof Development System, Prentice-Hall, Englewood Cliffs, New Jersey, 1986.]] Google ScholarDigital Library
- 15 J. Lucassen and D. Gifford, Polymorphic Effect Systems, Proceedings of the Fifteenth Annual Symposium of Principles of Programming Languages, 1987.]] Google ScholarDigital Library
- 16 K. Pingali and K. Ekanadham, Accumulatorsnew logic variable abstractions for functional languages, Proceedings of the FST 8j TCS Conference, Springer Verlag LNCS 338, December 1988.]] Google ScholarDigital Library
- 17 W.P. Crowley, C.P. Hendrickson and T.E. Rudy, The Simple code, Lawrence Livermore Laboratory Report UCID- 17715, 1978.]]Google Scholar
- 18 Anne Rogers, Compiling for Distributed Memory Architectures, PhD thesis, Departmeni of Computer Science, Cornell University, expected December 1989.]]Google Scholar
Index Terms
- Process decomposition through locality of reference
Recommendations
Process decomposition through locality of reference
PLDI '89: Proceedings of the ACM SIGPLAN 1989 conference on Programming language design and implementationIn the context of sequential computers, it is common practice to exploit temporal locality of reference through devices such as caches and virtual memory. In the context of multiprocessors, we believe that it is equally important to exploit spatial ...
Competitive Paging with Locality of Reference
Selected papers of the 23rd annual ACM symposium on Theory of computingThe Sleator-Tarjan competitive analysis of paging (Comm. ACM28 (1985), 202-208) gives us the ability to make strong theoretical statements about the performance of paging algorithms without making probabilistic assumptions on the input. Nevertheless ...
Comments