Portal de Periódicos da CAPES

The Unison algorithm

1996; Association for Computing Machinery; Volume: 1; Issue: 4 Linguagem: Inglês

10.1145/238997.239009

1557-7309

Rok Sosič, Jun Gu, Robert R. Johnson,

Logic, programming, and type systems

We present a Unison algorithm to evaluate arbitrarily complex Boolean expressions. This novel algorithm, based on the total differential of a Boolean function, enables fast evaluation of Boolean expressions in software. Any combination of Boolean operations can be packed into the bits of one computer word and evaluated in parallel by bitwise logical operations. Sample runs of the Unison algorithm show that many Boolean operations can evaluated in one clock cycle. The Unison algorithm is able to evaluate Boolean expressions at an execution speed that is comparable to compiled evaluation while retaining the flexibility of interpreted approaches. The algorithm lends itself well to many practical applications.