Article

Free access

Cache coherence using local knowledge

Authors:

E. Darnell,

K. KennedyAuthors Info & Claims

Supercomputing '93: Proceedings of the 1993 ACM/IEEE conference on Supercomputing

Pages 720 - 729

https://doi.org/10.1145/169627.169821

Published: 01 December 1993 Publication History

PDF eReader

References

[1]

D. A. Abramson, K. Ramamohanarao, and M. Ross. A scalable cache coherence mechanism using a selectively clearable cache memory. The Australian Computer Journal, 21(1), Feb. 1989.

Digital Library

Google Scholar

[2]

L.M. Censier and P. Feautrier. A new solution to coherence problems in multicache systems. IEEE Transactions on Computers, C-27(12):1112-1118, Dec. 1978.

Digital Library

Google Scholar

[3]

H. Cheong. Life-span strategy - a compiler-based approach to cache coherence. In Proceedings of 1992 International Conference on Supercompu~ing, July 1992.

Digital Library

Google Scholar

[4]

H. Cheong and A. Veidenbaum. Compiler-directed cache management for multiprocessors. Computer, 23(6):39-47, June 1990.

Digital Library

Google Scholar

[5]

R. Covington, S. Dwarkadas, J. Jump, J. Sinclair, and S. Madala. Efficient simulation of paralle computer systems. International Journal in Comuter Simulation, 1:31-- 58, 1991. overview of RPPT.

Google Scholar

[6]

R. Cytron, S. Karlovsky, and K. McAuliffe. Automatic management of programmable caches. In Proe. of the 1988 International Conference on Parallel Processing, pages 229-238, Aug. 1988.

Google Scholar

[7]

E. Darnell, J. Mellor-Crummey, and K. Kennedy. Automatic software cache coherence through vectorization, in Proceedings of 1995 International Conference on Supercomputing, July 1992. Also available as expanded Technical Report CRPC-TR92197, Center for Research on Paxallel Computation, January 1992.

Digital Library

Google Scholar

[8]

D. James, A. Laundrie, S. Gjessing, and G. Sohi. Scalable coherent interface. Computer, 23(6), June 1990.

Digital Library

Google Scholar

[9]

S. Karlovsky. Automatic management of programmable caches: Algorithms and experience. Technical Report 89- 8010, Center for Supercomputing Research and Development, University of Illinois, Urbana, IL, July 1989.

Google Scholar

[10]

L. Lamport. How to make a multiprocessor that correctly executes multiprocess programs. IEEE Transactions on Computers, C-28(9), Sept. 1979.

Google Scholar

[11]

D. Lenoski, J. Laudon, K. Gharachorloo, W. Weber, A. Gupta, J. Hennessy, M. Horowitz, and M. Lam. The Standford DASH multiprocessor. Computer, 25(3):63-79, Mar. 1992.

Digital Library

Google Scholar

[12]

A. Louri and H. Sung. A compiler directed cache cohexence scheme with fast and parallel explicit invalidation. In Proc. of the 1992 International Conference on Parallel Processing, pages 2-9, Aug. 1992.

Google Scholar

[13]

E. P. Markatos and T. J. LeBlanc. Using processor affinity in loop scheduling on shared-memory multiprocessors, ir. Proceedings of 1992 International Conference on Supercomputing, pages 104-113, Nov. 1992.

Digital Library

Google Scholar

[14]

S. Min and J. Baer. Design and analysis of a scalabl: cache coherence scheme based on clocks and timestamps. IEEE Transactions on Parallel and Distributed System*., 3(1 ):25-44, Jan. 1992.

Digital Library

Google Scholar

[15]

S. Min, J. Baer, and H. Kim. An efficient caching support for critical sections in large-scale shared-memory multiprocessors. In Proc. of the 1990 International Conference ~'n Supercomputing/Computer Architecture News, pages 4-47, June 1990. Special issue of Computer Architecture New~, 18(3), Sept. 1990.

Digital Library

Google Scholar

[16]

A. Osterhaug, editor. Guide to Parallel Programming on Sequent Computer Systems. Sequent Technical Publi(ations, San Diego, CA, 1989.

Digital Library

Google Scholar

[17]

K. Peterson and K. Li. Cache coherence for shared mere ory multiprocessors based on virtual memory support. In Proceedings of the 7th International Parallel Processinq Symposium, Apr. 1993.

Google Scholar

[18]

D. Schanln. The design and development of a very high speed system bus - the encore multimax nanobus. In Proceedings of the Fall Joint Computer Conference, page,~ 410-418, Nov. 1986.

Digital Library

Google Scholar

[19]

J. Willis, A. Sanderson, and C. Hill. Cache coherence in systems with parallel communication channels & many processors. In Supercomputing '90, pages 554-563, 1990

Digital Library

Google Scholar

Cited By

View all

Rochange CUhrig SSainrat P(2014)BibliographyTime‐Predictable Architectures10.1002/9781118790229.biblio(163-178)Online publication date: 17-Jan-2014
https://doi.org/10.1002/9781118790229.biblio
Saito MMatsumoto M(2013)Variants of Mersenne Twister Suitable for Graphic ProcessorsACM Transactions on Mathematical Software10.1145/2427023.242702939:2(1-20)Online publication date: 1-Feb-2013
https://dl.acm.org/doi/10.1145/2427023.2427029
Boisvert JMuir PSpiteri R(2013)A Runge-Kutta BVODE Solver with Global Error and Defect ControlACM Transactions on Mathematical Software10.1145/2427023.242702839:2(1-22)Online publication date: 1-Feb-2013
https://dl.acm.org/doi/10.1145/2427023.2427028
Show More Cited By

Index Terms

Cache coherence using local knowledge

Recommendations

Cache coherence using local knowledge
Improving cache performance with adaptive cache topologies and deferred coherence models
Maintaining Cache Coherence through Compiler-Directed Data Prefetching

In this paper, we propose a compiler-directed cache coherence scheme which makes use of data prefetching to enforce cache coherence in large-scale distributed shared-memory (DSM) systems. TheCache Coherence With Data Prefetching(CCDP) scheme uses ...

Comments

Information & Contributors

Information

Published In

Supercomputing '93: Proceedings of the 1993 ACM/IEEE conference on Supercomputing

December 1993

935 pages

ISBN:0818643404

DOI:10.1145/169627

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 December 1993

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SC '93

Sponsor:

SIGARCH
IEEE-CS

SC '93: International Conference for High Performance Computing, Networking, Storage and Analysis

November 15 - 19, 1993

Oregon, Portland, USA

Acceptance Rates

Supercomputing '93 Paper Acceptance Rate 72 of 300 submissions, 24%;

Overall Acceptance Rate 1,516 of 6,373 submissions, 24%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

32
Total Citations
View Citations
250
Total Downloads

Downloads (Last 12 months)42
Downloads (Last 6 weeks)11

Reflects downloads up to 17 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Rochange CUhrig SSainrat P(2014)BibliographyTime‐Predictable Architectures10.1002/9781118790229.biblio(163-178)Online publication date: 17-Jan-2014
https://doi.org/10.1002/9781118790229.biblio
Saito MMatsumoto M(2013)Variants of Mersenne Twister Suitable for Graphic ProcessorsACM Transactions on Mathematical Software10.1145/2427023.242702939:2(1-20)Online publication date: 1-Feb-2013
https://dl.acm.org/doi/10.1145/2427023.2427029
Boisvert JMuir PSpiteri R(2013)A Runge-Kutta BVODE Solver with Global Error and Defect ControlACM Transactions on Mathematical Software10.1145/2427023.242702839:2(1-22)Online publication date: 1-Feb-2013
https://dl.acm.org/doi/10.1145/2427023.2427028
Gustavson FWaśniewski JDongarra JHerrero JLangou J(2013)Level-3 Cholesky Factorization Routines Improve Performance of Many Cholesky AlgorithmsACM Transactions on Mathematical Software10.1145/2427023.242702639:2(1-10)Online publication date: 1-Feb-2013
https://dl.acm.org/doi/10.1145/2427023.2427026
Diouf BHantaş CCohen AÖzturk ÖPalsberg J(2013)A decoupled local memory allocatorACM Transactions on Architecture and Code Optimization10.1145/2400682.24006939:4(1-22)Online publication date: 20-Jan-2013
https://dl.acm.org/doi/10.1145/2400682.2400693
Antão SSousa L(2013)The CRNS framework and its application to programmable and reconfigurable cryptographyACM Transactions on Architecture and Code Optimization10.1145/2400682.24006929:4(1-25)Online publication date: 20-Jan-2013
https://dl.acm.org/doi/10.1145/2400682.2400692
Van Craeynest KEeckhout L(2013)Understanding fundamental design choices in single-ISA heterogeneous multicore architecturesACM Transactions on Architecture and Code Optimization10.1145/2400682.24006919:4(1-23)Online publication date: 20-Jan-2013
https://dl.acm.org/doi/10.1145/2400682.2400691
Trossen D(2012)Turing, the internet and a theory for architectureACM SIGCOMM Computer Communication Review10.1145/2317307.231731742:3(47-53)Online publication date: 26-Jun-2012
https://dl.acm.org/doi/10.1145/2317307.2317317
Himura YYasuda Y(2012)Discovering configuration templates of virtualized tenant networks in multi-tenancy datacenters via graph-miningACM SIGCOMM Computer Communication Review10.1145/2317307.231731042:3(13-20)Online publication date: 26-Jun-2012
https://dl.acm.org/doi/10.1145/2317307.2317310
Zhai DChang HShan SChen XGao W(2012)Multiview Metric Learning with Global Consistency and Local SmoothnessACM Transactions on Intelligent Systems and Technology10.1145/2168752.21687673:3(1-22)Online publication date: 1-May-2012
https://dl.acm.org/doi/10.1145/2168752.2168767
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations