Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
The I/O-Complexity of Ordered Binary-Decision Diagram Manipulation
 

Summary: The I/O-Complexity of Ordered Binary-Decision Diagram
Manipulation
Lars Arge
BRICS
Department of Computer Science
University of Aarhus
Aarhus, Denmark
August 1996
Abstract
Ordered Binary-Decision Diagrams (OBDD) are the state-of-the-art data structure for
boolean function manipulation and there exist several software packages for OBDD ma-
nipulation. OBDDs have been successfully used to solve problems in e.g. digital-systems
design, verification and testing, in mathematical logic, concurrent system design and in
artificial intelligence. The OBDDs used in many of these applications quickly get larger
than the avaliable main memory and it becomes essential to consider the problem of min-
imizing the Input/Output (I/O) communication. In this paper we analyze why existing
OBDD manipulation algorithms perform poorly in an I/O environment and develop new
I/O-efficient algorithms.
1 Introduction
Many problems in digital-systems design, verification and testing, mathematical logic, concur-

  

Source: Arge, Lars - Department of Computer Science, Aarhus Universitet

 

Collections: Computer Technologies and Information Sciences