DMCA
Midway: Shared Memory Parallel Programming with Entry Consistency for Distributed Memory Multiprocessors (1991)
| Citations: | 194 - 0 self |
BibTeX
@TECHREPORT{Bershad91midway:shared,
author = {Brian N. Bershad and Matthew J. Zekauskas},
title = {Midway: Shared Memory Parallel Programming with Entry Consistency for Distributed Memory Multiprocessors},
institution = {},
year = {1991}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Distributed memory multiprocessing offers a cost-effective and scalable solution for a large class of scientific and numeric applications. Unfortunately, the performance of current distributed memory programming environments suffers because the frequency of communication between processors can exceed that required to ensure a correctly functioning program. Midway is a shared memory parallel programming system which addresses the problem of excessive communication in a distributed memory multiprocessor. Midway programs are written using a conventional MIMD-style programming model executing within a single globally shared memory. Local memories on each processor cache recently used data to counter the effects of network latency. Midway is based on a new model of memory consistency called entry consistency. Entry consistency exploits the relationship between synchronization objects and the data which they protect. Updates to shared data are communicated between processors only when not ...
Keyphrases
entry consistency distributed memory multiprocessor shared memory parallel memory consistency local memory processor cache conventional mimd-style programming model midway program excessive communication shared memory network latency numeric application scalable solution new model large class functioning program current distributed memory environment suffers synchronization object
