On the Complexity and Optimization of Branching Programs for Decision Diagram Machines

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F12%3APU98162" target="_blank" >RIV/00216305:26230/12:PU98162 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
On the Complexity and Optimization of Branching Programs for Decision Diagram Machines
Original language description
Decision Diagram Machines (DDMs) are special purpose processors that evaluate decision diagrams. First, this paper derives upper bounds on the cost of multi-terminal binary decision diagrams (MTBDDs) for sparse multiple-output logic functions. From thesebounds we can estimate the size of branching programs running on various DDMs. Second, optimization of heterogeneous branching programs is undertaken that makes a space-time trade-off between the amount of memory required for a branching program and itsexecution time. As a case study, optimal architectures of branching programs are found for a set of benchmark tasks. Beside DDMs, the technique can also be used for micro-controllers with a support for multi-way branching running logic-intensive embedded firmware.
Czech name
—
Czech description
—

Project
<a href="/en/project/GAP103%2F10%2F1517" target="_blank" >GAP103/10/1517: Natural Computing on Unconventional Platforms</a><br>
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year
2012
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection
Programmable Devices and Embedded Systems PDeS 2012
ISBN
978-3-902823-21-2
ISSN
—
e-ISSN
—
Number of pages
6
Pages from-to
84-89
Publisher name
Faculty of Electrical Engineering and Communication BUT
Place of publication
Brno
Event location
Brno
Event date
May 23, 2012
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—

Similar results(10)