Skip to main content

Challenges in Verifying Communication Fabrics

  • Conference paper
  • 671 Accesses

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

Abstract

Functional and performance correctness of on-die communication fabrics is critical for the design of modern computer systems. In this talk we will examine some challenges and open problems in functional verification communication fabrics and in their quality of service analysis and optimization. We will also review some progress that has been done in liveness verification of communication fabrics.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Boudec, J.Y.L., Thiran, P.: Network Calculus: A Theory of Deterministic Queuing Systems for the Internet. LNCS, vol. 2050. Springer, Heidelberg (2001)

    MATH  Google Scholar 

  2. Bufistov, D., Júlvez, J., Cortadella, J.: Performance optimization of elastic systems using buffer resizing and buffer insertion. In: Proc. International Conf. Computer-Aided Design (ICCAD), pp. 442–448 (November 2008)

    Google Scholar 

  3. Bufistov, D.E., Cortadella, J., Galceran-Oms, M., Júlvez, J., Kishinevsky, M.: Retiming and recycling for elastic systems with early evaluation. In: DAC 2009: Proceedings of the 46th Annual Design Automation Conference, pp. 288–291. ACM, New York (2009)

    Chapter  Google Scholar 

  4. Burns, S.M., Hulgaard, H., Amon, T., Borriello, G.: An algorithm for exact bounds on the time separation of events in concurrent systems. IEEE Trans. Comput. 44, 1306–1317 (1995), http://dx.doi.org/10.1109/12.475126

  5. Chatterjee, S., Kishinevsky, M.: Automatic generation of inductive invariants from high-level microarchitectural models of communication fabrics. In: Touili, T., Cook, B., Jackson, P. (eds.) CAV 2010. LNCS, vol. 6174, pp. 321–338. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  6. Chatterjee, S., Kishinevsky, M., Ogras, U.Y.: Quick formal modeling of communication fabrics to enable verification. In: Proc. IEEE High Level Design Validation and Test Workshop (HLDVT), pp. 42–49 (2010)

    Google Scholar 

  7. Gotmanov, A., Chatterjee, S., Kishinevsky, M.: Verifying deadlock-freedom of communication fabrics. In: Jhala, R., Schmidt, D. (eds.) VMCAI 2011. LNCS, vol. 6538, pp. 214–231. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  8. Manohar, R., Martin, A.J.: Slack elasticity in concurrent computing. In: Jeuring, J. (ed.) MPC 1998. LNCS, vol. 1422, pp. 272–285. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  9. Verbeek, F., Schmaltz, J.: Formal specification of networks-on-chips: deadlock and evacuation. In: DATE 2010, pp. 1701–1706 (2010)

    Google Scholar 

  10. Wilhelm, R.: Timing analysis and timing predictability. In: de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, W.-P. (eds.) FMCO 2004. LNCS, vol. 3657, pp. 317–323. Springer, Heidelberg (2005), http://dx.doi.org/10.1007/11561163_14

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kishinevsky, M., Gotmanov, A., Viktorov, Y. (2011). Challenges in Verifying Communication Fabrics. In: van Eekelen, M., Geuvers, H., Schmaltz, J., Wiedijk, F. (eds) Interactive Theorem Proving. ITP 2011. Lecture Notes in Computer Science, vol 6898. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22863-6_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22863-6_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22862-9

  • Online ISBN: 978-3-642-22863-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics