Parallelization for multiprocessors with memory hierarchies

Michael Gerndt, Hans Moritsch

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publicationParallel Computation - 1st International ACPC Conference, Proceedings
EditorsHans P. Zima
PublisherSpringer Verlag
Pages89-101
Number of pages13
ISBN (Print)9783540554370
DOIs
StatePublished - 1992
Externally publishedYes
Event1st International ACPC Conference on Parallel Computation, 1991 - Salzburg, Austria
Duration: 30 Sep 19912 Oct 1991

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume591 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference1st International ACPC Conference on Parallel Computation, 1991
Country/TerritoryAustria
CitySalzburg
Period30/09/912/10/91

Keywords

  • Distributed memory multiprocessors domain decomposition
  • Program parallelization
  • Program transformations
  • Shared memory multiprocessors

Fingerprint

Dive into the research topics of 'Parallelization for multiprocessors with memory hierarchies'. Together they form a unique fingerprint.

Cite this