Srilatha Manne
ABSTRACT
Binary Decision Diagrams (BDDs) are efficient at manipulating large sets in a compact manner. BDDs, however, are inefficient at utilizing the memory hierarchy ofthe computer. Recent work addresses this problem by manipulating the BDDsin breath-first manner (BFS). BFS processing is quite successful at reducing the number of page faults when the BDDs do not fit in the available physical memory. When pagingdoes not take place, it is much less clear which paradigmleads to the better performance. In this paper, we perform adetailed analysis of BFS and DFS packages using simulationand direct performance monitoring ofthe memory hierarchy.We show that there is very little difference in TLB and cachemiss rates for DFS and BFS paradigms. We also show thatdifferences in execution time between carefully tuned BFSand DFS implementations are primarily a function of thelossless computed table used in BFS implementations, andnot a function of memory locality. Furthermore, we presentimplementation changes to the the Cudd package that canimprove execution times by asmuch as 26% when the problem fits in main memory, and a factor of six when paging is involved.
- 1.A. Agarwal, J. Hennessy, and M. Horowitz. Cache performance of operating system and multiprocessing workloads. A CM Transactions on Computer Systems, 6(4):393-431, November 1988. Google Scholar
Digital Library
- 2.P. Ashar and M. Cheong. Efficient breadth-first manipulation of binary decision diagrams. In Proceedings of the International Conference on Computer-Aided Design, pages 622-627, San Jose, CA, November 1994. Google ScholarDigital Library
- 3.R. K. Brayton et al. VIS: A system for verification and synthesis. Technical Report UCB/ERL M95/104, Electronics Research Lab, Univ. of California, December 1995.Google Scholar
- 4.R. E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers, C-35(8):677-691, August 1986. Google ScholarDigital Library
- 5.M. Fujita, Y. Matsunaga, and T. Kakuda. On variable ordering of binary decision diagrams for the application of multi-level logic synthesis. In Proceedings of the European Conference on Design Automation, pages 50-54, Amsterdam, February 1991. Google ScholarDigital Library
- 6.J. H. Hennessy and D. A. Patterson. Computer Architecture: A Quantitative Approach. Morgan Kaufmann, San Francisco, CA, second edition, 1996. Google ScholarDigital Library
- 7.D. E. Long. Robdd package, 1993.Google Scholar
- 8.H. Ochi, K. Yasuoka, and S. Yajima. Breadth-first manipulation of very large binary-decision diagrams. In Proceedings of the International Conference on Computer-Aided Design, pages 48- 55, Santa Clara, CA, November 1993. Google ScholarDigital Library
- 9.R. Rudell. Dynamic variable ordering for ordered binary decision diagrams. In Proceedings of the International Conference on Computer-Aided Design, pages 42-47, Santa Clara, CA, November 1993. Google ScholarDigital Library
- 10.J. V. Sanghavi, R. K. Ranjan, R. K. Brayton, and A. Sangiovanni-Vincentelli. High performance BDD package based on exploiting memory hierarchy. In Proceedings of the Design Automation Conference, Las Vegas, NV, June 1996. To appear. Google ScholarDigital Library
- 11.A. J. Smith. Cache memories. A CM Computing Surveys, 14(3):473-530, September 1982. Google ScholarDigital Library
- 12.F. Somenzi. CUDD: CU Decision Diagram Package. ftp://vlsi.colorado.e du / pub/.Google Scholar
- 13.A. Srivastava and A. Eustace. ATOM: A system for building customized program analysis tools. In Proceedings of the A CM SIGPLAN '9~ Conference on Programming Language Design and Implementation. ACM, 1994. Google ScholarDigital Library
Index Terms
- Remembrance of things past: locality and memory in BDDs
Recommendations
Value‐aware cache replacement in edge networks for Internet of Things
AbstractWith the development of Internet of Things (IoT), massive amounts of data will be brought. By offloading caching from the cloud to the edge, edge caching technology represents a promising solution in the era of IoT to meet the delay requirements ...
We develop a new model of the network edge caching system that explores the impact of the user request behavior, file popularity, and file size on the edge caching system and user request latency. We propose a network edge cache decision strategy based on ...
The future is in the past: designing for exploratory search
IIIX '12: Proceedings of the 4th Information Interaction in Context SymposiumExploratory search activities tend to span multiple sessions and involve finding, analyzing and evaluating information found through many queries. Typical search systems, on the other hand, are designed to support single query, precision-oriented search ...
Design and Optimization of Large Size and Low Overhead Off-Chip Caches
Large off-chip L3 caches can significantly improve the performance of memory-intensive applications. However, conventional L3 SRAM caches are facing two issues as those applications require increasingly large caches. First, an SRAM cache has a limited ...
Comments