BDD Algortihms and Cache Misses

Forfattere

  • Nils Klarlund
  • Theis Rauhe

DOI:

https://doi.org/10.7146/brics.v3i26.20007

Resumé

Within the last few years, CPU speed has greatly overtaken memory speed. For this reason, implementation of symbolic algorithms - with their extensive use of pointers and hashing - must be reexamined. In this paper, we introduce the concept of cache miss complexity
as an analytical tool for evaluating algorithms depending on pointer chasing. Such algorithms are typical of symbolic computation found in verification. We show how this measure suggests new data structures and algorithms
for multi-terminal BDDs. Our ideas have been implemented in
a BDD package, which is used in a decision procedure for the Monadic Second-order Logic on strings.
Experimental results show that on large examples involving e.g the verification of concurrent programs, our implementation runs 4 to 5 times faster than a widely used BDD implementation.
We believe that the method of cache miss complexity is of general interest to any implementor of symbolic algorithms used in verification.

Downloads

Publiceret

1996-01-26

Citation/Eksport

Klarlund, N., & Rauhe, T. (1996). BDD Algortihms and Cache Misses. BRICS Report Series, 3(26). https://doi.org/10.7146/brics.v3i26.20007

Nummer

Nr. 26 (1996): RS-26 BDD Algortihms and Cache Misses

Sektion

Artikler

Licens

Authors who publish with this journal agree to the following terms:

    1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.

    1. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.

  1. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).