Skip to main content

An Efficient Test Design for CMPs Cache Coherence Realizing MESI Protocol

  • Conference paper
Progress in VLSI Design and Test

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7373))

Abstract

This work proposes an efficient test design for verification of cache coherence in CMPs (Chip Multiprocessors). It ensures data coherence more accurate and reliable in a system with thousands of on-chip processors realizing MESI protocol. The design is based on the modular structure of Cellular Automata (CA), a modeling tool invented by von Neumann. A special class of CA referred to as SACA has been introduced to identify the inconsistencies in cache line states of processors’ L1 caches. Introduction of segmented CA ensures better efficiency in the design, in terms of number of computations, to detect an inconsistency.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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. Shivakumar, P., Kistler, M., Keckler, S.W., Burger, D., Alvisi, L.: Modeling the effect of technology trends on the soft error rate of combinational logic. In: International Conference on Dependable Systems and Networks, pp. 389–398 (June 2002)

    Google Scholar 

  2. Wang, H., Baldawa, S., Sangireddy, R.: Dynamic Error Detection for Dependable Cache Coherency in Multicore Architecture. VLSI Design (January 2008)

    Google Scholar 

  3. Cheng, L., Muralimanohar, N., Ramani, K., Balasubrsmonian, R., Carter, J.B.: Interconnect-Aware Coherence Protocols for Chip Multiprocessors. In: The 33rd IEEE International Symposium on Computer Architecture, ISCA 2006 (2006)

    Google Scholar 

  4. Subramanyan, P., Singh, V., Saluja, K.K., Larsson, E.: Energy-Efficient Fault Tolerance in Chip Multiprocessors Using Critical Value Forwarding. In: 2010 IEEE/IIFIP International Conference on Dependable Systems & Networks, DSN (2010)

    Google Scholar 

  5. Pal Chaudhuri, P., Roy Chowdhury, D., Nandi, S., Chatterjee, S.: Additive Cellular Automata – Theory and Applications, vol. 1. IEEE Computer Society Press, California (1997) ISBN 0-8186-7717-1

    MATH  Google Scholar 

  6. Das, S., Naskar, N.N., Mukherjee, S., Dalui, M., Sikdar, B.K.: Characterization of CA Rules for SACA Targeting Detection of Faulty Nodes in WSN. In: Bandini, S., Manzoni, S., Umeo, H., Vizzari, G. (eds.) ACRI 2010. LNCS, vol. 6350, pp. 300–311. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  7. Dalui, M., Sikdar, B.K.: An Efficient Test Design for Verification of Cache Coherence in CMPs. In: EmbeddedCom 2011 (2011)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dalui, M., Sikdar, B.K. (2012). An Efficient Test Design for CMPs Cache Coherence Realizing MESI Protocol. In: Rahaman, H., Chattopadhyay, S., Chattopadhyay, S. (eds) Progress in VLSI Design and Test. Lecture Notes in Computer Science, vol 7373. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31494-0_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-31494-0_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-31493-3

  • Online ISBN: 978-3-642-31494-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics