Skip to main content

The Cache Coherence Protocol of the Data Diffusion Machine

  • Chapter
Cache and Interconnect Architectures in Multiprocessors

Abstract

The Data Diffusion Machine (DDM) is a scalable shared address space multiprocessor in which the location of a datum in the machine is completely decoupled from its address. In particular, there is no distinguished home location where a datum must normally reside. Instead data migrates automatically to where it is needed, reducing access times and traffic.

The hardware organisation consists of a hierarchy of buses and data controllers linking an arbitrary number of processors each having a large set-associative memory. Each data controller has a set-associative directory containing status bits for data under its control The controller supports remote data access by “snooping” on the buses above it and below it. The data access protocol it uses provides for the automatic migration, duplication and replacement of data while maintaining data coherency.

The machine is scalable in that there may be any number of levels in the hierarchy. Only a few levels are necessary in practice for a very large number of processors. Most memory requests are satisfied locally. Requests requiring remote access cause only a limited amount of traffic over a limited part of the machine, and are satisfied within a small time that is logarithmic to the number of processors. Although designed particularly to provide good support for the parallel execution of logic programs, the architecture is very general in that it does not assume any particular processor, language or class of application.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Masatoshi Sato Akira Matsumoto, Takayuki Nakagawa. Locally parallel cache design. TR 327, ICOT, 1988.

    Google Scholar 

  2. Robert A Iannucci Arvind. Two fundamental issues in multiprocessing: the dataflow solution. MIT/LCS/TM 241, MIT, 1983.

    Google Scholar 

  3. J.R. Goodman and P.J. Woest. The Wisconsin Multicube: a new largescale cache-coherent multiprocessor. In Proceedings of the 15th Annual International Symposium on Computer Architecture, Honolulu, Hawaii, pages 442–431. IEEE, 1988.

    Google Scholar 

  4. Seif Haridi and Per Brand. Andorra Prolog-an integration of Prolog and committed choice languages. In International Conference on Fifth Generation Computer Systems 1988. ICOT, 1988.

    Google Scholar 

  5. M. Hermenegildo and P. McGehearty. Address escaping and reference classification in the design of a cached, multiple cluster, shared-memory architecture. PP-SRS-Technical Memo 12, MCC, 1987.

    Google Scholar 

  6. Ewing Lusk, David H. D. Warren, Seif Haridi, et al. The Aurora or-parallel Prolog system. In International Conference on Fifth Generation Computer Systems 1988. ICOT, 1988.

    Google Scholar 

  7. Gurindar S Sohi Mary K Venon, Rajeev Jog. Performance analysis of hierarchical cache-consistent multiprocessors. In Conference Proceedings of International Seminar on Performance of Distributed and Parallel Systems, pages 111–126, 1988.

    Google Scholar 

  8. G.F. Pfister et al. The IBM Research Parallel Processor Prototype (RP3). In Proceedings of the 1985 International Conference on Parallel Processing, Chigago. IEEE, 1985.

    Google Scholar 

  9. David H. D. Warren and Seif Haridi. Data Diffusion Machine-a scalable shared virtual memory multiprocessor. In International Conference on Fifth Generation Computer Systems 1988. ICOT, 1988.

    Google Scholar 

  10. A. Wilson. Hierarchical cache/bus architecture for shared memory multiprocessor. Technical report ETR 86-006, Encore Computer Corporation, 1986.

    Google Scholar 

  11. Andrew W Wilson. Organization and Statistical Simulation of Hierarchical Multiprocessors. PhD thesis, CMU, 1985.

    Google Scholar 

  12. Rong Yang. Programming in Andorra-I. Internal Report, Gigalips Project, August 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Kluwer Academic Publishers

About this chapter

Cite this chapter

Hagersten, E., Haridi, S., Warren, D.H.D. (1990). The Cache Coherence Protocol of the Data Diffusion Machine. In: Dubois, M., Thakkar, S.S. (eds) Cache and Interconnect Architectures in Multiprocessors. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-1537-7_9

Download citation

  • DOI: https://doi.org/10.1007/978-1-4613-1537-7_9

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4612-8824-4

  • Online ISBN: 978-1-4613-1537-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics