DVCLUB: ARMv8 Cache Coherency Verification with TrekSoC Portable Stimulus Models 2017-02-08T06:13:06+00:00
Conference:DVCLUB Europe: Cache Verification (Feb 2017)
Speaker:Adnan Hamid (CEO), Breker Verification Systems, Inc.
Presentation Title:ARMv8 Cache Coherency Verification with TrekSoC Portable Stimulus Models
Abstract:Verification of cache coherency used to be purely the domain of CPU providers. In modern ARM-based system-on-chip (SoC) designs, coherency is now a system-level challenge.  Problems to solve include custom fabric/fabric configuration/memory controllers, exclusive/acquire/release mechanics, I/O coherent IP, System MMUs and IP virtualization, and page tables to exercise all of the above.

This talk describes a novel method for automatically generating self-checking test cases that intensely stress SoC-level cache coherency. With these pushbutton test cases, SoC verification teams can verify coherency without having to become experts. These test cases are portable across all verification platforms, from simulation to silicon.

  • Using graph-based portable stimulus models to capture cache coherency protocols
  • Importance of scheduling tasks and memory addresses to hit coherency scenarios
  • Vertical and horizontal reuse of portable stimulus models
Speaker Bio:Adnan Hamid is the founder and CEO of Breker Verification Systems, and inventor of its core technology. He has more than 25 years of experience in functional verification automation and is a pioneer in bringing to market the first commercially available solution for Portable Stimulus. Prior to Breker, Hamid managed AMD’s System Logic Division and led its verification group to create the first test case generator providing 100% coverage for an x86-class microprocessor. Hamid holds 12 patents in test case generation and synthesis. He received Bachelor of Science degrees in Electrical Engineering and Computer Science from Princeton University, and an MBA from the University of Texas at Austin.

View the Presentation Materials:

  • At the request of the speaker Presentation Slides will not be available post-event.
  • At the request of the speaker recording Slides will not be available post-event.
T&VS NEWSLETTER SIGN-UP
The T&VS newsletters inform you about industry news, events and information from T&VS. No spam, we promise and it is always easy to unsubscribe.
We never share your information. Read our Privacy Statement
Interested in Formal Verification?
Then why not attend the TVS Formal
Verification Bootcamp training?
The 2-day Formal Verification Bootcamp is for design and verification engineers looking to enhance their knowledge of formal verification and to learn how to write effective assertions to find and fix bugs. The course is a mix of presentations and hands-on development exercises.
Bootcamp Enquiry Form
If you are interested in receiving additional information on the course then simply email Mike Bartley (TVS CEO and Course Leader) by entering your details below.
Interested in SystemC?
FREE SystemC UVM Library Now Available
The TVS SystemC UVM library closely mimics UVM but gives users a license free UVM-based verification environment.
Have your product requirements been successfully tested and implemented?
Find out how asureSIGN can help you implement a successful Requirements Driven Verification and Test Strategy by visiting asureSIGN or enter your details and we will be in touch.
Course Dates and Pricing
To receive additional information, including course dates and pricing, please contact our training team who will be happy to help.
Download Request
Please complete the following form then click 'submit' to access the download.
Presentation Request
Please complete the following form then click 'submit' to gain access to the presentations.
DOWNLOAD REQUEST
Please complete the following form and then click 'submit' to gain access to the download.
FREE QA ASSESSMENTS
Did you get what you were looking?

Let the testing experts help. We will run a FREE QA assessment which will include our top 5 recommendations to help maximise your testing.