ACM Home Page
Please provide us with feedback. Feedback
Architectural mechanisms for explicit communication in shared memory multiprocessors
Full text HtmlHtml (6 KB)
Source Conference on High Performance Networking and Computing archive
Proceedings of the 1995 ACM/IEEE conference on Supercomputing (CDROM) table of contents
San Diego, California, United States
Article No. 62  
Year of Publication: 1995
ISBN:0-89791-816-9
Authors
Umakishore Ramachandran  College of Computing, Georgia Institute of Technology, Atlanta, GA
Gautam Shah  College of Computing, Georgia Institute of Technology, Atlanta, GA
Anand Sivasubramaniam  College of Computing, Georgia Institute of Technology, Atlanta, GA
Aman Singla  College of Computing, Georgia Institute of Technology, Atlanta, GA
Ivan Yanasak  College of Computing, Georgia Institute of Technology, Atlanta, GA
Sponsors
IEEE-CS : Computer Society
SIGARCH: ACM Special Interest Group on Computer Architecture
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 13,   Citation Count: 10
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

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

ABSTRACT

The goal of this work is to explore architectural mechanisms for supporting explicit communication in cache-coherent shared memory multiprocessors. The motivation stems from the observation that applications display wide diversity in terms of sharing characteristics and hence impose different communication requirements on the system. Explicit communication mechanisms would allow tailoring the coherence management under software control to match these differing needs and strive to provide a close approximation to a zero overhead machine from the application perspective. Toward achieving these goals, we first analyze the characteristics of sharing observed in certain specific applications. We then use these characteristics to synthesize explicit communication primitives. The proposed primitives allow selectively updating a set of processors, or requesting a stream of data ahead of its intended use. These primitives are essentially generalizations of prefetch and poststore, with the ability to specify the sharer set for poststore either statically or dynamically. The proposed primitives are to be used in conjunction with an underlying invalidation based protocol. Used in this manner, the resulting memory system can dynamically adapt itself to performing either invalidations or updates to match the communication needs. Through application driven performance study we show the utility of these mechanisms in being able to reduce and tolerate communication latencies.


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
D. Bailey et al. The NAS Parallel Benchmarks. International Journal of Supercomputer Applications, 5(3):63-73, 1991.
5
6
 
7
H. Cheong and A. V. Veidenbaum. Stale data detection and coherence enforcement using flow analysis. In Proceedings of the 1988 International Conference on Parallel Processing, pages I: 138-145, August 1988.
 
8
Cray Research, Inc., Minnesota. The Cray T3D System Architecture Overview Manual, 1993.
9
 
10
R. Cytron, S. Marlovsky, and K. P. McAuliffe. Automatic management of programmable caches. In Proceedings of the 1988 International Conference on Parallel Processing, pages II-229-238, August 1988.
11
 
12
F. Dahlgren and P. Stenstrom. Using write caches to improve performance of cache coherence protocols in shared memory multiprocessors. Technical report, Dept. of Comp. Eng., Lund Univ., April 1993.
13
 
14
Encore Computer Corporation, 257 Cedar Hill St., Marlboro, MA 01752. Multimax Technical Summary, 1986.
 
15
 
16
Matthew I. Frank and Mary K. Vernon. A hybrid Shared Memory/Message Passing parallel machine. In Proceedings of the 1993 International Conference on Parallel Processing, August 1993.
17
18
19
20
21
22
23
 
24
L. Lamport. How to make a Multiprocessor Computer that Correctly executes Multiprocess Programs. IEEE Transactions on Computer Systems, C-28(9), 1979.
25
26
 
27
 
28
T. Lovett and S. Thakkar. The symmetry multiprocessor system. In Proceedings of the 1988 International Conference on Parallel Processing, pages 303-310, August 1988.
 
29
S. L. Min and J-L. Baer. A Timestamp-based Cache Coherence Scheme. In Proceedings of the 1989 International Conference on Parallel Processing, pages I: 23-32, August 1989.
 
30
H. Nilsson, P. Stenstrom, and M. Dubois. Implementation and evaluation of update-based cache protocols under relaxed memory consistency models. Technical report, Dept. of Comp. Eng., Lund Univ., July 1993.
 
31
U. Ramachandran, G. Shah, S. Ravikumar, and J. Muthukumarasamy. Scalability study of the KSR-1. In Proceedings of the 1993 International Conference on Parallel Processing, pages I-237-240, August 1993.
32
 
33
Kendall Square Research. Technical summary, 1992.
 
34
35
 
36
37
38
39

CITED BY  10

Collaborative Colleagues:
Umakishore Ramachandran: colleagues
Gautam Shah: colleagues
Anand Sivasubramaniam: colleagues
Aman Singla: colleagues
Ivan Yanasak: colleagues