DMCA
Data and Computation Transformations for Multiprocessors (1995)
| Venue: | In Proceedings of the Fifth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming |
| Citations: | 176 - 14 self |
BibTeX
@INPROCEEDINGS{Anderson95dataand,
author = {Jennifer Anderson and Saman P. Amarasinghe and Monica S. Lam},
title = {Data and Computation Transformations for Multiprocessors},
booktitle = {In Proceedings of the Fifth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming},
year = {1995},
pages = {166--178}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Effective memory hierarchy utilization is critical to the performance of modern multiprocessor architectures. We havedeveloped the first compiler system that fully automatically parallelizes sequential programs and changes the original array layouts to improve memory system performance. Our optimization algorithm consists of two steps. The first step chooses the parallelization and computation assignment such that synchronization and data sharing are minimized. The second step then restructures the layout of the data in the shared address space with an algorithm that is based on a new data transformation framework. We ran our compiler on a set of application programs and measured their performance on the Stanford DASH multiprocessor. Our results show that the compiler can effectively optimize parallelism in conjunction with memory subsystem performance. 1 Introduction In the last decade, microprocessor speeds have been steadily improving at a rate of 50% to 100% every year[16]. Meanwh...
Keyphrases
computation transformation stanford dash multiprocessor shared address space microprocessor speed memory subsystem performance new data transformation framework original array layout optimization algorithm application program effective memory hierarchy utilization first step last decade memory system performance computation assignment second step first compiler system sequential program modern multiprocessor architecture
