R.K. Ranjan, J.V. Sanghavi, R.K. Brayton, A. Sangiovanni-Vincentelli, "Binary decision diagrams on network of workstations", in International Conference on Computer Design, pp. 358-364, 1996.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....connected by a 16Mb s token ring network. Their distributed implementation could reasonably well utilize the available memory (the overhead being close to a factor of 3) and in one case reached 35 steps in the fixed point iteration, compared to 18 steps on a uniprocessor with 768MB memory. [Stor95, SB96, RSBS96] describe implementations of parallel BDD packages developed for a distributed environment such as a network of workstations (NOW) In [GHS01] a distributed symbolic model checking algorithm for the calculus, its correctness proof, as well as sources of scalability are presented. 2.3 Random ....

R.K. Ranjan, J.V. Sanghavi, R.K. Brayton, A. Sangiovanni-Vincentelli, "Binary decision diagrams on network of workstations", in International Conference on Computer Design, pp. 358-364, 1996.

....states. Examples of the memory saving approach are, e.g. in [6, 38, 14, 15, 27, 28, 10] In an auxiliary storage approach, one tries to exploit disk storage as well as distributed processors (network storage) to enlarge the available memory (and CPU) Examples of this approach are, e.g. in [25, 26, 21, 30, 22]. In this paper we explore the possibility of trading space with time in order to reduce the amount of memory needed to complete a given veri cation task. 2 More speci cally, our goal here is to devise a Breadth First State Space Exploration (BFS) algorithm with graceful degradation. In ....

R. K. Ranjan, J. V. Sanghavi, R. K. Brayton, and A. Sangiovanni-Vincentelli. Binary decision diagrams on network of workstations. In IEEE International Conference on Computer Design, pages 358-364, 1996.

....TOSCA Corresponding Author: Enrico Tronci. Tel: 39 0862 433129. Fax: 39 0862 433180. 2 In an auxiliary storage approach one tries to exploit disk storage as well as distributed processors (network storage) to enlarge the available memory (and CPU) Examples of this approach are, e.g. in [16, 17, 13, 21, 14]. In this paper we study the possibility of exploiting statistical properties of protocol transition graphs to improve state exploration algorithms. This is quite similar to what is usually done when optimizing a CPU on the basis of program pro ling [12] Our algorithm allows us to reduce the ....

R. K. Ranjan, J. V. Sanghavi, R. K. Brayton, and A. Sangiovanni-Vincentelli. Binary decision diagrams on network of workstations. In IEEE International Conference on Computer Design, pages 358-364, 1996.

....larger MDDs on distributed architectures. Our algorithm is particularly suited for this kind of parallelization since all data structures are already split according to levels. We believe that our approach promises to avoid the run time penalties for parallelization reported in the literature [18, 23, 25], especially regarding distributed memory implementations on networks of workstations and PC clusters. Acknowledgments. We would like to thank A.S. Miner for many fruitful discussions on multi valued decision diagrams and on implementations of state space generation techniques, as well as C esar ....

R. Ranjan, J. Sanghavi, R. Brayton, and A. Sangiovanni-Vincentelli, Binary decision diagrams on network of workstations, in IEEE International Conference on Computer Design (ICCD '96), Austin, TX, USA, October 1996, IEEE Computer Society Press, pp. 358--364.

....Mur , for which the runtime was optimized. In fact, parallel Mur is based on this version of sequential Mur , which contains symmetry reduction and hash compaction. There have also been some efforts to parallelize BDD based verification methods. Stornetta and Brewer [25, 24] and Ranjan et al. [19] have presented distributed memory BDD algorithms. Both algorithms only achieve speedups in comparison to sequential versions if the sequential versions run out of memory and are forced to do swapping, but they enable the use of the total memory of the parallel machine. Kimura and Clarke [14] ....

R. K. Ranjan, J. V. Sanghavi, R. K. Brayton, and A. Sangiovanni-Vincentelli. Binary decision diagrams on network of workstations. In International Conference on Computer Design, pages 358--64, 1996.

....Mur , for which the runtime was optimized. In fact, parallel Mur is based on this version of sequential Mur , which contains symmetry reduction and hash compaction. There have also been some efforts to parallelize BDD based verification methods. Stornetta and Brewer [83, 82] and Ranjan et al. [72] have presented distributed memory BDD algorithms. Both algorithms only achieve speedups in comparison to sequential versions if the sequential versions run out of memory and are forced to do swapping, but they enable the use of the total memory of the parallel machine. Kimura and Clarke [53] ....

R. K. Ranjan, J. V. Sanghavi, R. K. Brayton, and A. SangiovanniVincentelli. Binary decision diagrams on network of workstations. In International Conference on Computer Design, pages 358--64, 1996.

....Mur , for which the runtime was optimized. In fact, parallel Mur is based on this version of sequential Mur , which contains symmetry reduction and hash compaction. There have also been some efforts to parallelize BDD based verification methods. Stornetta and Brewer [23, 22] and Ranjan et al. [19] have presented distributed memory BDD algorithms. Both algorithms only achieve speedups in comparison to sequential versions if the sequential versions run out of memory and are forced to do swapping, but they enable the use of the total memory of the parallel machine. Kimura and Clarke [14] ....

R. K. Ranjan, J. V. Sanghavi, R. K. Brayton, and A. Sangiovanni-Vincentelli. Binary decision diagrams on network of workstations. In International Conference on Computer Design, pages 358--64, 1996.

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