This paper presents several new asynchronous FIFO designs. While most existing FIFO's trade higher throughput for higher latency, our goal is to achieve very low latency while maintaining good throughput. The designs are implemented as circular arrays of cells connected to common data buses. Data items are not moved around the array once they are enqueued. Each cell's input and output behavior is dictated by the flow of two tokens around the ring: one that allows enqueuing data and one that allows dequeuing data. Two novel protocols are introduced with various degrees of parallelism, as well as four different implementations. The best simulation results, in 0.6 /spl mu/, have a latency of 1.73 ns and throughput of 454 MegaOperations/second for a 4-place FIFO.
['Tiberiu Chelcea', 'Steven M. Nowick']
Low-latency asynchronous FIFO's using token rings