skip to main content
article
Free access

An empirical evaluation of two memory-efficient directory methods

Published: 01 May 1990 Publication History

Abstract

This paper presents an empirical evaluation of two memory-efficient directory methods for maintaining coherent caches in large shared memory multiprocessors. Both directory methods are modifications of a scheme proposed by Censier and Feautrier [5] that does not rely on a specific interconnection network and can be readily distributed across interleaved main memory. The schemes considered here overcome the large amount of memory required for tags in the original scheme in two different ways. In the first scheme each main memory block is sectored into sub-blocks for which the large tag overhead is shared. In the second scheme a limited number of large tags are stored in an associative cache and shared among a much larger number of main memory blocks. Simulations show that in terms of access time and network traffic both directory methods provide significant performance improvements over a memory system in which shared-writeable data is not cached. The large block sizes required for the sectored scheme, however, promotes sufficient false sharing that its performance is markedly worse than using a tag cache.

References

[1]
A. Agarwal et al. An evaluation of directory schemes for cache coherence. In Proceedings of the Internarional Symposium on Computer Architecfure, pages 280-289, May 1988.
[2]
J. Archibald and J-L. Baer. An economical solution to the cache coherence problem. In Proceedings of the Internadonal Symposium on Computer Architecture, pages 355-362,1984.
[3]
T. Axelrod et at. A simulator for MIMD performance prediction: AppIication to the S-l MkIIa mnltiprocessor. Parallel Computing. 1:237-274. 1984.
[4]
M. Carlmn. private communication.
[5]
L. M. Censier and P. Feaunier. A new solution to coherence problems in multicache systems. IEEE Transactions on Computers, C-27(12):1 11% 1118, Dec. 1978.
[6]
S. Devadas and A. R. Newton. Topological optimization of multiple level array logic. IEEE Transacrions on Computer-Aided Design, Nov. 1987.
[7]
S. J. Eggers andR. H. Katz. A characterization of sharing inparallelprograms and its application to coherency protocol evaluation. In Proceedings of he International Symposium on Computer Architecfure, pages 373-383, June 1988.
[8]
M. J. Flynn. Some computer organizations and their effectiveness. IEEE Transactions on Computers, C-21(9):948-960, Sept. 1972.
[9]
D. Gajski et al. Cedar-a large scale multiprocessor. In Proceedings of thelnlemational Conference on Parallel Processing, pages 514-529. August 1983.
[10]
J. R. Goodman and P. J. Woest The Wisconsin Multicube: A new largescale cache-coherent multiprocessor. In Proceedings ofthe International Symposium on Computer Architecture, pages 422-433, May 1988.
[11]
Goulieb et al. The NYU Ultracomputer-designing an MIMD shared memory parallel computer. IEEE Transactions on Cotnpurers, C- 32(2):175-189, Feb. 1983.
[12]
M. D. Hill and A. J. Smith. Experimental evaluation of on-chip microprocessor cache memories. In Proceedings of the Internarional Symposium on Compuier Architecture, pages 158-166, June 1984.
[13]
E. A. Lee and D. G. Messerschmitt. Static scheduling of synchronous data flow programs for digital signal processing. IEEE Transactions on Computers, C-36(1):24-35, Jan. 1987.
[14]
H. T. Ma et al. Logic verification algorithms and their parallel implementation. In Proceedings of the Design Automarion Conference, PP. 283-290, July 1987.
[15]
G. F. Pfister et al. The IBM research parallel processor prototype (RP3): Introduction and archhecture. In Proceedings of rhe International Symposium on Computer Architecrure, June 198.5.
[16]
C. Scheurich and M. Dubois. Correct memory operation of cache-based multiprocessors. In Proceedings of the International Symposium on Computer Architecture, pages 234-243, June 1987.
[17]
J. T. Schwartz. Ultracomputers. ACM Transactions on Programming Languages andsysfems, 2(4):48&521,Oct. 1980.
[18]
H. J. Siegel. Interconnection Nehvorkr for Large-Scale Parallel Processing. Lexington Books, 1985.
[19]
A. J. Smifh. Cache memories. ComputingSurveys, 14(3):473-530, Sept. 1982.
[20]
H. S. Stone. High-Performance Computer Architecture. Addison- Wesley Publishing Company, 1987.
[21]
A. W. Wilson Jr. Hierarchical cache/bus architecture for shared memory multiprocessors. In Proceerlings of the International Symposium on Computer Architecture, pages 244-252, June 1987.

Cited By

View all

Index Terms

  1. An empirical evaluation of two memory-efficient directory methods

      Recommendations

      Comments

      Information & Contributors

      Information

      Published In

      cover image ACM SIGARCH Computer Architecture News
      ACM SIGARCH Computer Architecture News  Volume 18, Issue 2SI
      Special Issue: Proceedings of the 17th annual international symposium on Computer Architecture
      June 1990
      356 pages
      ISSN:0163-5964
      DOI:10.1145/325096
      Issue’s Table of Contents

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      Published: 01 May 1990
      Published in SIGARCH Volume 18, Issue 2SI

      Check for updates

      Qualifiers

      • Article

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • Downloads (Last 12 months)110
      • Downloads (Last 6 weeks)14
      Reflects downloads up to 07 Nov 2024

      Other Metrics

      Citations

      Cited By

      View all

      View Options

      View options

      PDF

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      Get Access

      Login options

      Media

      Figures

      Other

      Tables

      Share

      Share

      Share this Publication link

      Share on social media