Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
article
Free access

Process decomposition through locality of reference

Published: 21 June 1989 Publication History

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.

References

[1]
A. Karp, Programming for Parallelism, IEEE Computer, May 1987.]]
[2]
A. Gottlieb et al., The NYU Ultracomputer- Designing an MIMD Shared Memory Parallel Cornputer, IEEE Transactions on Computers, February 1983.]]
[3]
J. Peir and D. Gajski, Camp: a programming aide for multiprocessors, Proceedings of the Internalional Conference on Parallel Processin!l, 1986.]]
[4]
Arvind, R. Nikhil and K. Pingali, Id Nouveau: Language and Operational Semantics, CSG Memo, M.I.T., September 1987.]]
[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.]]
[6]
D. Padua and M. Wolfe, Advanced Compiler Optimizations For Supercomputers, Communications of the A CM, December 1986.]]
[7]
G. Fox et al, Solving Problems on Concurrent Processors, Volume 1, Prentice-Hall, Englewood Cliffs, New Jersey, 1986.]]
[8]
Communication from Intel Corporation.]]
[9]
L.M. Censier and P. Feautrier, A New Solution to the Coherence Problem in Multicache Systems, IEEE Transactions on Computers, December 1978.]]
[10]
S.H.Bokhari, Assignment Problems in Parallel and Distributed Computing, Kluwer Academic Publishing, 1987.]]
[11]
H. Stone, Multiprocessor Scheduling with the aid of Network Flow Algorithms, IEEE Transactions on Software Engineering, January 1977.]]
[12]
D. Callahan and K. Kennedy, Compiling Programs for Distributed-Memory Multiprocessors, The Journal of Supercomputing, October 1988.]]
[13]
C. Koelbel, P. Mehrotra, and J. Van Rosendale, Semi-Automatic Domain Decomposition in Blaze, Proceedings of the International Conference on Parallel Processing, 1987.]]
[14]
R. L. Constable et M, Implementing Mathematics with the Nuprl Proof Development System, Prentice-Hall, Englewood Cliffs, New Jersey, 1986.]]
[15]
J. Lucassen and D. Gifford, Polymorphic Effect Systems, Proceedings of the Fifteenth Annual Symposium of Principles of Programming Languages, 1987.]]
[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.]]
[17]
W.P. Crowley, C.P. Hendrickson and T.E. Rudy, The Simple code, Lawrence Livermore Laboratory Report UCID- 17715, 1978.]]
[18]
Anne Rogers, Compiling for Distributed Memory Architectures, PhD thesis, Departmeni of Computer Science, Cornell University, expected December 1989.]]

Cited By

View all
  • (2023)Architecture-Aware Currying2023 32nd International Conference on Parallel Architectures and Compilation Techniques (PACT)10.1109/PACT58117.2023.00029(250-264)Online publication date: 21-Oct-2023
  • (2023)Data Recomputation for Multithreaded Applications2023 IEEE/ACM International Conference on Computer Aided Design (ICCAD)10.1109/ICCAD57390.2023.10323776(01-09)Online publication date: 28-Oct-2023
  • (2017)On a cyberinfrastructure platform for multidisciplinary, data-intensive scientific research2017 IEEE 7th Annual Computing and Communication Workshop and Conference (CCWC)10.1109/CCWC.2017.7868483(1-6)Online publication date: Jan-2017
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM SIGPLAN Notices
ACM SIGPLAN Notices  Volume 24, Issue 7
Proceedings of the SIGPLAN '89 symposium on Interpreters and interpretive techniques
July 1989
355 pages
ISSN:0362-1340
EISSN:1558-1160
DOI:10.1145/74818
Issue’s Table of Contents
  • cover image ACM Conferences
    PLDI '89: Proceedings of the ACM SIGPLAN 1989 conference on Programming language design and implementation
    June 1989
    355 pages
    ISBN:089791306X
    DOI:10.1145/73141
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 21 June 1989
Published in SIGPLAN Volume 24, Issue 7

Check for updates

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)85
  • Downloads (Last 6 weeks)17
Reflects downloads up to 09 Nov 2024

Other Metrics

Citations

Cited By

View all
  • (2023)Architecture-Aware Currying2023 32nd International Conference on Parallel Architectures and Compilation Techniques (PACT)10.1109/PACT58117.2023.00029(250-264)Online publication date: 21-Oct-2023
  • (2023)Data Recomputation for Multithreaded Applications2023 IEEE/ACM International Conference on Computer Aided Design (ICCAD)10.1109/ICCAD57390.2023.10323776(01-09)Online publication date: 28-Oct-2023
  • (2017)On a cyberinfrastructure platform for multidisciplinary, data-intensive scientific research2017 IEEE 7th Annual Computing and Communication Workshop and Conference (CCWC)10.1109/CCWC.2017.7868483(1-6)Online publication date: Jan-2017
  • (2015)Code Generation for Distributed-Memory ArchitecturesThe Computer Journal10.1093/comjnl/bxv077(bxv077)Online publication date: 15-Sep-2015
  • (2014)PYRROSACM International Conference on Supercomputing 25th Anniversary Volume10.1145/2591635.2667165(163-172)Online publication date: 10-Jun-2014
  • (2012)Evolutionary multimodal optimization using the principle of localityInformation Sciences: an International Journal10.1016/j.ins.2011.12.016194(138-170)Online publication date: 1-Jul-2012
  • (2010)Automatic Data DistributionThe Compiler Design Handbook10.1201/9781420040579.ch12Online publication date: 7-Mar-2010
  • (2010)Compilation for Distributed Memory ArchitecturesThe Compiler Design Handbook10.1201/9781420040579.ch11Online publication date: 7-Mar-2010
  • (2010)Effect of spatial locality on an evolutionary algorithm for multimodal optimizationProceedings of the 2010 international conference on Applications of Evolutionary Computation - Volume Part I10.1007/978-3-642-12239-2_50(481-490)Online publication date: 7-Apr-2010
  • (2006)Run‐time issues in program partitioning on distributed memory systemsConcurrency: Practice and Experience10.1002/cpe.43300705077:5(429-454)Online publication date: 25-Oct-2006
  • Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media