Introducing Computation: VLIW

A fixed-program, custom processor can be designed.

Suppose we want to implement the following specification

    N ==  D + D + D + ... q times ... + D + r

Additional adders might create a faster component.

Use heuristics to decide on the resources to allocate and wire them as a custom VLIW processor.

I/O is performed by nodes that contain I/O instead of arithmetic.

Use SAT or similar to find the programming for the VLIW scoreboard.

Try with longer and longer scoreboards until it works.