Improvements to the ETS dynamic dataflow architecture

This paper discusses an enhancement to on Explicit Token Store (ETS) dataflow architecture by a variation in token format. As a hypothetical machine model, the experiment shows that the proposed variation achieved better performance by reducing the number of instruction references while maintaining same fine grained parallism of ETS architecture. The ability of the token formation unit to form two tokens for every matched token is exploited by using multiple fetch units. The results of the simulation demonstrate the ability of multiple fetch units in increasing the throughput and reducing pipeline bubbles through the ALU. Our results indicate that it is possible to implement dataflow model of execution and achieve RISC-like "one instruction per cycle" performance.<>