ACM Home Page
Please provide us with feedback. Feedback
Hardware spatial forwarding for widely shared data
Full text PdfPdf (1.15 MB)
Source International Conference on Supercomputing archive
Proceedings of the 14th international conference on Supercomputing table of contents
Santa Fe, New Mexico, United States
Pages: 264 - 273  
Year of Publication: 2000
ISBN:1-58113-270-0
Authors
Marius Pirvu  Department of Computer Science, Texas A&M University, College Station, TX
Laxmi Bhuyan  Department of Computer Science, Texas A&M University, College Station, TX
Sponsor
SIGARCH: ACM Special Interest Group on Computer Architecture
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 10,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/335231.335257
What is a DOI?

ABSTRACT

Applications with widely shared data do not perform well on cc-NUMA multiprocessors due to the hot-spots they create in the system. In this paper we address this problem by enhancing the memory controller with a forwarding mechanism capable of hiding the read latency of widely shared data, while potentially decreasing the memory and network contention. Based on the influx of requests, the memory anticipates the next read references and forwards the data in advance to the processors. To identify the set of processors the data is to be forwarded to we use a heuristic based on the spatial locality of memory blocks. To increase the forwarding effectiveness and minimize the number of messages, we incorporate simple filters combined with a feedback mechanism. We also show that further improvements are possible using a combined software-prefetching/hardware-forwarding approach. Our experimental results obtained with a detailed execution driven simulator with ILP processors show significant improvements in execution time (up to 37%).


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
2
 
3
 
4
B. Brooks, R. Bruccoleri, B. Olafson, D. S. es, S. Swaminathan, and M. Karplus. Charmm: A program for macromolecular energy, minimization, and dynamics calculations. Journal of Computational Chemistry, 4:187, 1983.
5
 
6
7
8
9
10
 
11
A. Gottlieb, R. Grishman, C. P. Kruskal, K. P. McAuliffe, L. Rudolph, and M. Snir. The NYU ultracomputer - designing a MIMD, shared-memory parallel machine. IEEE Trans. on Computers, 32(2):175, Feb. 1983.
 
12
W. Gunsteren and H. Berencisen. GROMOS: GROningen MOlecular Simulation software. Technical report, Laboratory of Physical Chemistry, University of Groningen, 1988.
 
13
14
15
 
16
17
18
 
19
 
20
 
21
22
 
23
 
24
V. S. Pai, P. Ranganathan, and S. V. Adve. RSIM: An Execution-Driven Simulator for ILP-Based Shared- Memory Multiprocessors and Uniprocessors. In Proceedings of the Third Workshop on Computer Architecture Education, February 1997.
 
25
 
26
D. K. Poulsen and P.-C. Yew. Data prefetching and data forwarding in shared memory multiprocessors. In Proceedings of the ~Jrd International Conference on Parallel Processing. Volume 2: Software, pages 276- 280, Aug. 1994.
 
27
A. J. Smith. Sequential program prefetching in memory hierarchies. IEBE Computer, 11(12):7-21, Dec. 1978.
28
29
30
31


Collaborative Colleagues:
Marius Pirvu: colleagues
Laxmi Bhuyan: colleagues