Timing Optimizations Sample Clauses

Timing Optimizations. The throughput of a hardware design always depends on two factors. The first is the number of data items that can be processed in one cycle and the second is the clock frequency at which the design can be run. Since this tool introduces new abstraction layers it is actually quite hard, if not impossible, to improve the timing characteristics of a design manually. For this reason, a functionality was added to the tool which tries to improve the timing characteristics automatically. If the same output has to be connected to many other nodes it is often hard to meet timing since it may not be possible to place all the nodes in close proximity which means that the wire length will increase. In order to avoid this problem, it is possible to automatically insert registers. This is done in a tree like fashion where each register has a maximum number of outputs. This is especially needed for the signal that decides which kernel has to be executed currently, since it can be connected to hundreds of MUXs. For this reason the tool automatically inserts registers after each node that has a large fanout.