Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Algorithms and Computation

ISAAC 1995: Algorithms and Computations pp 82–91Cite as

The I/O-complexity of Ordered Binary-Decision Diagram manipulation

Extended abstract

  • Session 3A
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1004))

Abstract

We analyze the I/O-complexity of existing Ordered Binary-Decision Diagram manipulation algorithms and develop new efficient algorithms. We show that these algorithms are optimal in all realistic I/O-systems.

This work was partially supported by the ESPRIT II Basic Research Actions Program of the EC under contract No. 7141 (project ALCOM II). Part of the work was done while a Visiting Scholar at Duke University.

Acronym for Basic Research in Computer Science, a Center of the Danish National Research Foundation.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Aggarwal, J.S. Vitter: The Input/Output Complexity of Sorting and Related Problems. Communications of the ACM, 31 (9), 1988.

    Google Scholar 

  2. L. Arge: The Buffer Tree: A New Technique for Optimal I/O-Algorithms. In Proc. of 4th Workshop on Algorithms and Data Structures, 1995.

    Google Scholar 

  3. L. Arge, D.E. Vengroff, J.S. Vitter: External-Memory Algorithms for Processing Line Segments in Geographic Information Systems. In Proc. of 3rd Annual European Symposium on Algorithms, 1995.

    Google Scholar 

  4. P. Ashar, M. Cheong: Efficient Breadth-First Manipulation of Binary Decision Diagrams. In Proc. of 1994 IEEE International Conference on CAD.

    Google Scholar 

  5. S.K. Brace, R.L. Rudell, R.E. Bryant: Efficient Implementation of a BDD Package. In Proc. of 27'th ACM/IEEE Design Automation Conference, 1990.

    Google Scholar 

  6. R. Bryant: Graph-Based Algorithms for Boolean Function Manipulation. IEEE Transactions on computers, C-35 (8), 1986.

    Google Scholar 

  7. R. Bryant: Symbolic Boolean Manipulation with Ordered Binary-Decision Diagrams. ACM Computing Surveys, 24 (3), 1992.

    Google Scholar 

  8. Y.-J. Chiang: Experiments on the Practical I/O Efficiency of Geometric Algorithms: Distribution Sweep vs. Plane Sweep. In Proc. of 4th Workshop on Algorithms and Data Structures, 1995.

    Google Scholar 

  9. Y.-J. Chiang, M.T. Goodrich, E.F. Grove, R. Tamassia, D.E. Vengroff, J.S. Vitter: External-Memory Graph Algorithms. In Proc. of 6th ACM/SIAM Symposium on Discrete Algorithms, 1995.

    Google Scholar 

  10. J. Gergov, C. Meinel: Frontiers of Feasible and Probabilistic Feasible Boolean Manipulation with Branching Programs. In Proc. of 10th Symposium on Theoretical Aspects of Computer Science, LNCS 665, 1993.

    Google Scholar 

  11. M.T. Goodrich, M.H. Nodine, J.S. Vitter: Blocking for External Graph Searching. In Proc. of 1993 ACM Symposium on Principles of Database Systems.

    Google Scholar 

  12. M.T. Goodrich, J.-J. Tsay, D.E. Vengroff, J.S. Vitter: External-Memory Computational Geometry. In Proc. of 34th IEEE Foundations of Computer Science, 1993.

    Google Scholar 

  13. S. Malik, A.R. Wang, R.K. Brayton, A. Sangiovanni-Vincentelli: Logic Verification using Binary Decision Diagrams in a Logic Synthesis Environment. In Proc. of 1988 IEEE International Conference on CAD.

    Google Scholar 

  14. H. Ochi, N. Ishiura, S. Yajima: Breadth-First Manipulation of SBDD of Boolean Functions for Vector Processing. In Proc. of 28'th ACM/IEEE Design Automation Conference, 1991.

    Google Scholar 

  15. H. Ochi, K. Yasuoka, S. Yajima: Breadth-First manipulation of Very Large Binary-Decision Diagrams. In Proc. of 1993 IEEE International Conference on CAD.

    Google Scholar 

  16. R. Rudell: Dynamic Variable Ordering for Ordered Binary Decision Diagrams. In Proc. of 1993 IEEE International Conference on CAD.

    Google Scholar 

  17. C. Ruemmler, J. Wilkes: An introduction to disk drive modeling. IEEE Computer, 27 (3), 1994.

    Google Scholar 

  18. D. Sieling, I. Wegener: Reduction of OBDDs in linear time. Information Processing Letters, 48, 1993.

    Google Scholar 

  19. D.E. Vengroff, J.S. Vitter: I/O-Efficient Scientific Computation Using TPIE. In Proc. of 7th IEEE Symposium on Parallel and Distributed Processing, 1995.

    Google Scholar 

  20. J.S. Vitter, E.A.M Shrive: Algorithms for Parallel Memory I: Two-level Memories. Algoritmica, 12 (2), 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. BRICS, Department of Computer Science, University of Aarhus, Aarhus, Denmark

    Lars Arge

Authors
  1. Lars Arge
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

John Staples Peter Eades Naoki Katoh Alistair Moffat

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Arge, L. (1995). The I/O-complexity of Ordered Binary-Decision Diagram manipulation. In: Staples, J., Eades, P., Katoh, N., Moffat, A. (eds) Algorithms and Computations. ISAAC 1995. Lecture Notes in Computer Science, vol 1004. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0015411

Download citation

  • DOI: https://doi.org/10.1007/BFb0015411

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60573-7

  • Online ISBN: 978-3-540-47766-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation