Skip to main content

Multiprocessor Consistency and Synchronization through Transient Cache States

  • Chapter
Scalable Shared Memory Multiprocessors

Abstract

A transient state can be used to mark a cache lines for which an access have started, but not yet completed. It can be used to implement cache-coherence protocols for split transaction buses.

Transient states can also be used to implement nonblocking writes, i.e. the processor never stalls on a write, while providing processor consistency for a certain class of networks. This has earlier only been achieved for looser forms of consistency at an extra hardware cost.

The same technique can be used to resolve data dependencies at runtime, implementing a functionality similar to that of Dataflow’s I-structure memory, at no extra hardware cost.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.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. S. Adve and M. Hill. Implementing sequential consistency in cache-based systems. In Proceedings of the 1990 International Conference on Parallel Processing, pages 47–50, 1990.

    Google Scholar 

  2. James K. Archibald and Jean-Loup Baer. An evaluation of cache coherence solutions in shared-bus multiprocessors. ACM Transactions on Computer Systems, 4(4):273–298, November 1986.

    Article  Google Scholar 

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

    Google Scholar 

  4. Arvind and R. S. Nikhil. A dataflow approach to general-pupose parallel computing. Laboratory for Computer Science, MIT, SCG Memo 302, July 1989.

    Google Scholar 

  5. [Dubois et al., 1986] M. Dubois, C. Scheurich, and F.A. Briggs. Memory access buffering in multiprocessors. In Proceedings of the 13th Annual International Symposium on Computer Architecture, pages 434–442, 1986.

    Google Scholar 

  6. [Gharachorloo et al., 1990] K. Gharachorloo, D. Lanoski, J. Laudon, P. Gibbons, A. Gupta, and J. Hennessy. Memory consistency and event ordering in scalable shared-memory multiprocessors. In Proceedings of the nth Annual International Symposium on Computer Architecture, pages 15–26, 1990.

    Google Scholar 

  7. [Gharachorloo et al., 1991] K. Gharachorloo, A. Gupta, and J. Hennessy. Performance evaluation of memory consistency models. In Proceedings of the 4th Annual ASPLOS, 1991.

    Google Scholar 

  8. J. R. Goodman. Using cache memory to reduce processor-memory traffic. In Proceedings of the 10th Annual International Symposium on Computer Architecture, pages 124–131, 1983.

    Google Scholar 

  9. J. R. Goodman. Cache consistency and sequential consistency. Technical Report 61, SCI Commitee, 1989.

    Google Scholar 

  10. [Hagersten et al., 1990] E. Hagersten, S. Haridi, and D.H.D. Warren. The cache-coherence protocol of the data diffusion machine. In Proc. Cache and Interconnect Workshop. Kluwer Academic Publisher, Nor-well, Mass, 1990.

    Google Scholar 

  11. [Hagersten et al., 1991] E. Hagersten, A. Landin, and S. Haridi. A processor-consistent protocol for a hierarchical architecture. Swedish Institute of Computer Science, DDM-memo, 1991.

    Google Scholar 

  12. L. Lamport. How to make a multiprocessor computer that correctly executes multiprocess programs. IEEE Transactions on Computers, 28(9):690–691, September 1979.

    Article  MATH  Google Scholar 

  13. [Landin et al., 1991] A. Landin, E. Hagersten, and S. Haridi. Race-free interconnection networks and multiprocessor consistency. In To appear in Proceedings of the 18th Annual International Symposium on Computer Architecture, 1991.

    Google Scholar 

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

    Google Scholar 

  15. C. Scheurich and M. Dubois. Correct memory operation of cache-based multiprocessors. In Proceedings of the 14th Annual International Symposium on Computer Architecture, pages 234–243, 1987.

    Google Scholar 

  16. 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 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer Science+Business Media New York

About this chapter

Cite this chapter

Hagersten, E., Landin, A., Haridi, S. (1992). Multiprocessor Consistency and Synchronization through Transient Cache States. In: Dubois, M., Thakkar, S. (eds) Scalable Shared Memory Multiprocessors. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-3604-8_10

Download citation

  • DOI: https://doi.org/10.1007/978-1-4615-3604-8_10

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4613-6601-0

  • Online ISBN: 978-1-4615-3604-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics