Assertion-based verification for the SpaceCAKE multiprocessor - A case study

0Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

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-bused static verification approach need more maturity. A 50% reduction in debug time has been achieved through the use of assertions. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Kulkarni, M., & Benita Bommi, J. (2006). Assertion-based verification for the SpaceCAKE multiprocessor - A case study. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3875 LNCS, pp. 43–55). Springer Verlag. https://doi.org/10.1007/11678779_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free