DMCA
Tradeoffs in Message Passing and Shared Memory Implementations of a Standard Cell Router (1989)
Cached
Download Links
- [www.ee.princeton.edu]
- [parapet.ee.princeton.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | In Proceedings of the 1989 International Conference on Parallel Processing |
| Citations: | 15 - 2 self |
BibTeX
@INPROCEEDINGS{Martonosi89tradeoffsin,
author = {Margaret Martonosi and Anoop Guptacomputer},
title = {Tradeoffs in Message Passing and Shared Memory Implementations of a Standard Cell Router},
booktitle = {In Proceedings of the 1989 International Conference on Parallel Processing},
year = {1989},
pages = {88--96}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
1 Introduction Two common parallel programming paradigms are the mes-sage passing programming model and the shared memory programming model. In the message passing style, datais distributed among the processes; if there are global data structures, they are kept up to date by sending messages. Insuch an approach, the programmer is responsible for maintaining the consistency of the data structures. In the sharedmemory model, the data structures are stored in the shared memory, and the consistency of the shared memory is guar-anteed by an underlying coherence mechanism, such as a hardware cache coherence protocol.In this paper, we explain the decisions made in encoding the LocusRoute [8, 9] standard cell routing program In Proc. 1989 InternationalConference on Parallel Processing
Keyphrases
shared memory standard cell router shared memory implementation message passing data structure message passing style mes-sage passing parallel processing sharedmemory model common parallel hardware cache coherence protocol global data structure standard cell underlying coherence mechanism
