The Average Case Performance of an Algorithm for Demand-Driven Evaluation of Boolean Formulae
| dc.creator | Dunne,Paul | |
| dc.creator | Leng,Paul | |
| dc.date | 1999 | |
| dc.date.accessioned | 2024-02-06T12:50:00Z | |
| dc.date.available | 2024-02-06T12:50:00Z | |
| dc.description | Demand-driven simulation is an approach to the simulation of digital logic circuits that was proposed, independently, in the work of several authors. Experimental studies of the paradign have indicated that this approach may reduce the time required for simulation, when compared with event-driven techniques. In this paper we present some analytic support for these experimental results by analysing the average number of gates evaluated with a naive demand-driven algorithm for formula evaluation. | |
| dc.format | text/html | |
| dc.identifier | https://doi.org/10.3217/jucs-005-05-0288 | |
| dc.identifier | https://lib.jucs.org/article/27558/ | |
| dc.identifier.uri | https://openrepository.mephi.ru/handle/123456789/7558 | |
| dc.language | en | |
| dc.publisher | Journal of Universal Computer Science | |
| dc.relation | info:eu-repo/semantics/altIdentifier/eissn/0948-6968 | |
| dc.relation | info:eu-repo/semantics/altIdentifier/pissn/0948-695X | |
| dc.rights | info:eu-repo/semantics/openAccess | |
| dc.rights | J.UCS License | |
| dc.source | JUCS - Journal of Universal Computer Science 5(5): 288-306 | |
| dc.subject | simulation | |
| dc.subject | logic design | |
| dc.subject | average-case analysis of algorithms | |
| dc.title | The Average Case Performance of an Algorithm for Demand-Driven Evaluation of Boolean Formulae | |
| dc.type | Research Article |