skip to main content
article
Free Access

An argument against scalable cache coherency

Published:01 July 1991Publication History
Skip Abstract Section

Abstract

Recently there has been considerable interest in cache coherency protocols in shared-memory multiprocessor systems, particularly in protocols which are scalable, i.e. efficient in very large systems. In this position paper, it will be argued that in most multiprocessor applications scalability---or for that matter, systemwide cache coherency itself---is unnecessary, no matter how large the system is. Since even an efficient protocol will be a significant inhibitor of performance, it is then argued that systems not be built with systemwide coherency. Instead, a concept of "local coherency" is proposed. In this approach, though the shared-memory paradigm is retained and the system is still assumed to consist of a very large number of processors, hardware support for accessing shared variables exists only within groups of processors. Accordingly, it is asserted that the main research in cache coherency protocols should concentrate on developing efficient protocols for small and medium numbers of caches rather than on scalability.

References

  1. 1. J. Boyle, R. Butler, T. Disz, B. Glickfield, E. Lusk, R. Overbeek, J. Patterson and R. Stevens. Portable Programs for Parallel Processors, 1987, Holt, Rinehart & Winston. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. 2. D. James, A. Laundrie, S. Gjessing and G. Sohi. "Scalable Coherent Interface," Computer, June 1990, 74-77. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 3. N. Matloff. "On Decentralized Task Allocation and Scalable Cache Coherency." Technical Report, Division of Computer Science, University of California at Davis, 1991.Google ScholarGoogle Scholar
  4. 4. L. Ni and C.-F. Wu. "Design Tradeoffs for Process Scheduling in Shared Memory Multiprocessor Systems," IEEE Transactions on Software Engineering, 15, 1989, 327-334. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. 5. G. Pfister and V. A. Norton. "'Hot Spot' Contention and Combining in Multistage Interconnection Networks," IEEE Transactions on Computers, C-34, 1985, 943-948.Google ScholarGoogle Scholar
  6. 6. P. Stenstrom. "A Survey of Cache Coherency Schemes for Multiprocessors," Computer, June 1990, 12-24. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. 7. A. Wilson. "Hierarchical Cache/Bus Architecture for Shared Memory Multiprocessors," Proceedings of the 14th International Symposium on Computer Architecture, 1987, 244-252. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. 8. P.-C. Yew, N.-F. Tzeng and D. Lawrie. "Distributing Hot-Spot Addressing in Large-Scale Multiprocessors," IEEE Transactions on Computers, C-36, 1987, 388-395. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. An argument against scalable cache coherency

              Recommendations

              Comments

              Login options

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

              Sign in

              Full Access

              • Published in

                cover image ACM SIGARCH Computer Architecture News
                ACM SIGARCH Computer Architecture News  Volume 19, Issue 4
                June 1991
                184 pages
                ISSN:0163-5964
                DOI:10.1145/122576
                Issue’s Table of Contents

                Copyright © 1991 Author

                Publisher

                Association for Computing Machinery

                New York, NY, United States

                Publication History

                • Published: 1 July 1991

                Check for updates

                Qualifiers

                • article
              • Article Metrics

                • Downloads (Last 12 months)4
                • Downloads (Last 6 weeks)0

                Other Metrics

              PDF Format

              View or Download as a PDF file.

              PDF

              eReader

              View online with eReader.

              eReader