Manohar, Rajit (1995) Folded FIFOs. Computer Science Technical Reports, California Institute of Technology , Pasadena, CA. (Unpublished) https://resolver.caltech.edu/CaltechCSTR:1995.cs-tr-95-09
![]()
|
Postscript
- Submitted Version
See Usage Policy. 858kB | |
![]()
|
PDF
- Submitted Version
See Usage Policy. 677kB |
Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechCSTR:1995.cs-tr-95-09
Abstract
We present two distributed implementations of first-in first-out meassage buffers. The solutions presented reduce the delay between insert and delete operations on the bufer 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.
Item Type: | Report or Paper (Technical Report) |
---|---|
Additional Information: | © 1995 California Institute of Technology. July 10, 1995. |
Group: | Computer Science Technical Reports |
Series Name: | Computer Science Technical Reports |
DOI: | 10.7907/Z9J67DZD |
Record Number: | CaltechCSTR:1995.cs-tr-95-09 |
Persistent URL: | https://resolver.caltech.edu/CaltechCSTR:1995.cs-tr-95-09 |
Usage Policy: | You are granted permission for individual, educational, research and non-commercial reproduction, distribution, display and performance of this work in any format. |
ID Code: | 26882 |
Collection: | CaltechCSTR |
Deposited By: | Imported from CaltechCSTR |
Deposited On: | 14 May 2001 |
Last Modified: | 03 Oct 2019 03:18 |
Repository Staff Only: item control page