Skip to main content

Parallelization for multiprocessors with memory hierarchies

  • Conference paper
  • First Online:
Parallel Computation (ACPC 1991)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 591))

  • 142 Accesses

Abstract

Programming shared memory multiprocessors seems to be easier than developing programs for distributed memory systems. The reason is the existence of a global names space for parallel threads providing uniform access to all global data. This programming model seems to be inadequate for systems with a larger number of processors since memory hierarchies are integrated to eliminate the bottleneck of global memory access. Therefore programming these systems has to be done with respect to the distribution of data, thus to enforce the parallel processes exploiting locality of references. This paper describes an ongoing project in which we investigate the applicability of the distributed memory parallelization strategy for shared memory systems with memory hierarchies.

The work described in this paper is being supported by IBM.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. D. Bernstein, K. So, Preface: A Fortran Preprocessor for Parallel Workstation Systems, Research Report RC13600, IBM T. J. Watson Research Center, Yorktown Heights, March 1988

    Google Scholar 

  2. David Callahan, Ken Kennedy, Compiling Progams for Distributed-Memory Multiprocessors, J. Supercomputing, 2(2), 151–169, (Oct.1988)

    Article  Google Scholar 

  3. Edward A. Carmona, Parallelizing a Large Scientific Code — Methods, Issues, and Concerns, ACM Proceedings Supercomputing 89, Reno, Nevada 89, 21–31

    Google Scholar 

  4. F. Darema-Rogers, V.A. Norton, G.F. Pfister, Using a Single-Program-Multiple-Data Computational Model for parallel Execution of Scientific Applications, Research Report IBM Watson Research Center Yorktown Heights

    Google Scholar 

  5. R. Eigenmann, J. Hoeflinger, G. Jaxon, D. Padua, Cedar Fortran and Its Compiler, Proceedings of the CONPAR90, Zürich 1990, LNCS 457, pp.288–299

    Google Scholar 

  6. Geoffrey C. Fox et al., Solving Problems on Concurrent Processors, Prentice Hall, Englewood Cliffs, 1988

    Google Scholar 

  7. A. Garcia, D.J. Foster, R.F. Freitas, The Adavanced Computing Environment Multiprocessor Workstation, Research Report RC 14491 IBM T.J.Watson Research Center, Yorktown Heights (Mar 1989)

    Google Scholar 

  8. D. Gelernter, N. Carriero, Linda on hypercube multicomputers, In: Proceedings of the 1985 SIAM Conference, Society for Industrial and Applied Mathematics, Philadelphia, 1986, 45–55

    Google Scholar 

  9. H.M. Gerndt, Updating Distributed Variables in Local Computations, Concurrency: Practice and Experience, Vol.2(3), pp. 171–193 (September 1990)

    Google Scholar 

  10. Alan H. Karp, Programming for Parallelism, Computer 20(5): pp.43–57, May 1987

    Google Scholar 

  11. C. Koelbel, P. Mehrotra, J. Van Rosendale, Semi-Automatic Process Partitioning for Parallel Computation, International Journal of Parallel Programming, Vol.16, No.5, 1987, 365–382

    Article  Google Scholar 

  12. Kai Li, Richard Schaefer, A Hypercube Shared Virtual Memory System, ICPP 1989, Vol I, pp. 125–132

    Google Scholar 

  13. G.F. Pfister, The IBM Research Parallel Processor Prototype (RPS): Inroduction and Architecture, IEEE Proceedings COMPAR 85, pp.764–771

    Google Scholar 

  14. Keshav Pingali, Anne Rogers, Compiler Parallelization of SIMPLE for a Distributed Memory Machine, Technical Report, Department of Computer Science, Cornell University, No. TR90-1084

    Google Scholar 

  15. Joel Saltz, Kathleen Crowley, Ravi Mirchandaney, Harry Berryman, RunTime Scheduling and Execution of Loops on Message Passing Machines, Journal of Parallel and Distributed Computing 8, 303–312 (1990)

    Article  Google Scholar 

  16. H.P. Zima, H.-J. Bast, H.M. Gerndt, SUPERB: A tool for semi-automatic MIMD/SIMD parallelization, Parallel Computing 6, 1988, 1–18

    Article  Google Scholar 

  17. H.P. Zima, B. Chapman, Supercompilers for Parallel and Vector Computers, Addison-Wesley, New York, 1990

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Hans P. Zima

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gerndt, M., Moritsch, H. (1992). Parallelization for multiprocessors with memory hierarchies. In: Zima, H.P. (eds) Parallel Computation. ACPC 1991. Lecture Notes in Computer Science, vol 591. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55437-8_73

Download citation

  • DOI: https://doi.org/10.1007/3-540-55437-8_73

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55437-0

  • Online ISBN: 978-3-540-47073-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics