Assertion-Based verification for the SpaceCAKE multiprocessor – a case study

  • Authors:
  • Milind Kulkarni;Benita Bommi J.

  • Affiliations:
  • Philips Research India, Bangalore, India;Philips Research India, Bangalore, India

  • Venue:
  • HVC'05 Proceedings of the First Haifa international conference on Hardware and Software Verification and Testing
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents a case study of the application of assertion-based verification to a multi-million-gate design of the SpaceCAKE architecture with shared L2 cache. SpaceCAKE L2 cache is highly configurable and implements Distributed Shared Memory (DSM) architecture. This paper discusses the issues faced during the functional verification of this architecture. A number of techniques are employed to verify the design. The paper serves as a case study for verification of such a complex architecture. A description of the different techniques that were used to verify this architecture and an assessment of using a comprehensive coverage-driven verification plan that exploits the benefits of the traditional simulation techniques through the use of assertions is presented. We have found that the tools, currently provided by the market, for assertion-based static verification approach need more maturity. A 50% reduction in debug time has been achieved through the use of assertions.