Anthony L. Stornetta  Home/Search
Context Related
| i2.informatik.rwth...parallel_bdd.ps.gz ucsb.edu/personnel/astornet...thesis.ps ucsb.edu/personnel/astornet...thesis.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: i2.informatik.rwthaachen.d...lit (more) From: dice.ucl.ac.be/~cacau/doc/bdd (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Implementation of an Efficient Parallel BDD Package by Anthony L. Stornetta Large BDD applications are generally limited by a processor's resources, especially physical memory. In large BDD applications, virtual memory is not an attractive solution for conventional depth-first BDD algorithms. Irregular memory access patterns in the algorithm cause thrashing, which severely impairs performance. One solution to overcoming this resource limitation is to utilize the memory of multiple networked... (Update)
Context of citations to this paper: More
...parallel BDD packages for various different architectures. For space reasons, we discuss here only the work of Stornetta and Brewer [8], which is the prior work most similar to ours in that we both target distributed memory machines. We refer the interested reader to their...
...shared memory (DSM) is another way to implement BDDs on distributed memory architectures. This has been done by Parasuram et al. [8]. The results obtained running on a CM 5 look good, but it 12 is not clear how good the results actually are, as the paper compare wall...
Cited by: More
Random Walk Based Heuristic Algorithms for Distributed.. - Sivaraj, Gopalakrishnan (2003) (Correct)
Streaming BDD Manipulation for Large-Scale Combinatorial.. - Minato, Ishihara (2001) (Correct)
BDDNOW: A Parallel BDD Package - Kim Milvang-Jensen Department (Correct)
Active bibliography (related documents): More All
1.0: Parallel Breadth-First BDD Construction - Yang, O'Hallaron (1997) (Correct)
0.1: Modular Verification of Multipliers - Ravi, Pardo, Hachtel, Somenzi (1996) (Correct)
0.1: Automatic Abstraction in Model Checking - Lu (2000) (Correct)
Similar documents based on text: More All
0.4: Automata-Based Symbolic Scheduling - Haynal (2000) (Correct)
0.1: Improving the Efficiency and Reliability of Digital.. - Bayer, Haber, Stornetta (1993) (Correct)
0.1: Some Timestamping Protocol Failures - Just (1998) (Correct)
Related documents from co-citation: More All
10: Reliable hashing without collision detection - Wolper, Leroy - 1993
8: Binary decision diagrams on network of workstations - Ranjan, Sanghavi et al. - 1996
8: On limits and possibilities of automated protocol analysis - Holzmann - 1987
BibTeX entry: (Update)
T. Stornetta. Implementation of an efficient parallel BDD package. Master's thesis, UC Santa Barbara, 1995. http://citeseer.ist.psu.edu/stornetta95implementation.html More
@inproceedings{ stornetta96implementation,
author = "Tony Stornetta and Forrest Brewer",
title = "Implementation of an Efficient Parallel {BDD} Package",
booktitle = "Design Automation Conference",
pages = "641-644",
year = "1996",
url = "citeseer.ist.psu.edu/stornetta95implementation.html" }
Citations (may not include all citations):1726 Graph-Based Algorithms for Boolean Function Manipulation - Bryant - 1986
595 Active Messages: a Mechanism for Integrated Communication an.. - von Eicken, Culler et al. - 1992
531 LogP: Towards a Realistic Model of Parallel Computation - Culler - 1993
341 Parallel Programming in Split-C - Culler - 1993
316 Efficient Implementation of a BDD Package (context) - Brace, Rudell et al. - 1990
275 Dynamic Variable Ordering for Ordered Binary Decision Diagra.. (context) - Rudell - 1993
212 APRIL: A Processor Architecture for Multiprocessing - Agarwal - 1990
88 Shared Binary Decision Diagram with Attributed Edges for Eff.. (context) - Minato, Ishiura et al. - 1990
80 Zero-Suppressed BDDs for Set Manipulation in Combinatorial P.. (context) - Minato - 1993
28 Algorithms for Approximate FSM Traversal (context) - Cho, Hachtel et al. - 1993
28 Breadth-First Manipulation of Very Large Binary-Decision Dia.. (context) - Ochi, Yasuoka et al. - 1993
21 Efficient Breadth-First manipulation of Binary Decision Diag.. (context) - Ashar, Cheong - 1994
6 Residue BDD and Its Application to the Verification of Arith.. (context) - Kimura - 1995
2 A Data Parallel Algorithm for Boolean Function Manipulation - Gai, Rebaudengo et al. - 1995
2 Parallel Implementation of BDD Algorithms Using a Distribute.. (context) - Parasuram, Stabler et al. - 1994
1 Parallel Binary Decision Diagram Manipulation (context) - Kimura, Igaki et al. - 1992
1 A Vector Algorithm for Manipulating Boolean Functions Based .. (context) - Ochi, Yajima et al. - 1991
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www-i2.informatik.rwth-aachen.de/leucker/Literatur/lit.html): More
Composing the user interface with Haggis - Finne, Jones (1996) (Correct)
Model Checking and Other Games - Stirling (1996) (Correct)
Descriptive Complexity and Finite Models - Immerman, Kolaitis, (Eds.) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC