Abstract
Concurrent requests to a shared variable by many processors on a shared-memory machine can create contention serious enough to stall large machines. This idea has been formalized in the hot spot traffic model in which a fixed fraction of memory requests is for a single shared variable. Combining, in which several requests for the same variable can be combined into a single request, has been suggested as an effective method of alleviating this contention. The NYU Ultracomputer and the IBM RP3 machine use pairwise combining, in which only two requests for the same variable can be combined at a switch. A study is made of the effectiveness of combining. It turns out that pairwise combining cannot handle hot spots if the machine size is large enough. Suggestion are put forth to overcome this weakness.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the International Conference on Parallel Processing |
| Editors | Kai Hwang, Steven M. Jacobs, Earl E. Swartzlander |
| Publisher | IEEE |
| Pages | 35-41 |
| Number of pages | 7 |
| ISBN (Print) | 0818607246 |
| Publication status | Published - 1986 |
| Externally published | Yes |
Fingerprint
ASJC Scopus subject areas
- Hardware and Architecture
Cite this
EFFECTIVENESS OF COMBINING IN SHARED MEMORY PARALLEL COMPUTERS IN THE PRESENCE OF 'HOT SPOTS'. / Lee, Kyung Ho; Kruskal, Clyde P.; Kuck, David J.
Proceedings of the International Conference on Parallel Processing. ed. / Kai Hwang; Steven M. Jacobs; Earl E. Swartzlander. IEEE, 1986. p. 35-41.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - EFFECTIVENESS OF COMBINING IN SHARED MEMORY PARALLEL COMPUTERS IN THE PRESENCE OF 'HOT SPOTS'.
AU - Lee, Kyung Ho
AU - Kruskal, Clyde P.
AU - Kuck, David J.
PY - 1986
Y1 - 1986
N2 - Concurrent requests to a shared variable by many processors on a shared-memory machine can create contention serious enough to stall large machines. This idea has been formalized in the hot spot traffic model in which a fixed fraction of memory requests is for a single shared variable. Combining, in which several requests for the same variable can be combined into a single request, has been suggested as an effective method of alleviating this contention. The NYU Ultracomputer and the IBM RP3 machine use pairwise combining, in which only two requests for the same variable can be combined at a switch. A study is made of the effectiveness of combining. It turns out that pairwise combining cannot handle hot spots if the machine size is large enough. Suggestion are put forth to overcome this weakness.
AB - Concurrent requests to a shared variable by many processors on a shared-memory machine can create contention serious enough to stall large machines. This idea has been formalized in the hot spot traffic model in which a fixed fraction of memory requests is for a single shared variable. Combining, in which several requests for the same variable can be combined into a single request, has been suggested as an effective method of alleviating this contention. The NYU Ultracomputer and the IBM RP3 machine use pairwise combining, in which only two requests for the same variable can be combined at a switch. A study is made of the effectiveness of combining. It turns out that pairwise combining cannot handle hot spots if the machine size is large enough. Suggestion are put forth to overcome this weakness.
UR - http://www.scopus.com/inward/record.url?scp=0022903116&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0022903116&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:0022903116
SN - 0818607246
SP - 35
EP - 41
BT - Proceedings of the International Conference on Parallel Processing
A2 - Hwang, Kai
A2 - Jacobs, Steven M.
A2 - Swartzlander, Earl E.
PB - IEEE
ER -