Folded FIFOs
Abstract
We present two distributed implementations of first-in first-out message buffers. The solutions presented reduce the delay between insert and delete operations on the buffer when the buffer is empty. The designs are then modified so as to offer bounded-response-time. The solutions presented use a CSP-like notation and are suitable for transformation into a VLSI circuit.
Document Details
- Document Type
- Technical Report
- Publication Date
- Jul 10, 1995
- Accession Number
- ADA444283
Entities
People
- Rajit Manohar
Organizations
- California Institute of Technology