caa a22 4500 465742343 CHVBK 20180323111811.0 cr unu---uuuuu 170327e19901101xx s 000 0 eng 10.1007/BF00935211 doi (NATIONALLICENCE)springer-10.1007/BF00935211 Bubbles can make self-timed pipelines fast [Elektronische Daten] [Mark Greenstreet, Kenneth Steiglitz] We explore the practical limits on throughput imposed by timing in a long, self-timed, circulating pipeline (ring). We consider models with both fixed and random delays and derive exact results for pipelines where these delays are fixed or exponentially distributed random variables. We also give relationships that provide upper and lower bounds on throughput for any pipeline where the delays are independent random variables. In each of these cases, we show that the asymptotic processor utilization is independent of the length of the pipeline; thus, linear speedup is achieved. We present conditions under which this utilization approaches 100%. Kluwer Academic Publishers, 1990 Greenstreet Mark Department of Computer Science, Princeton University, 08544, Princeton, NJ aut Steiglitz Kenneth Department of Computer Science, Princeton University, 08544, Princeton, NJ aut Journal of VLSI signal processing systems for signal, image and video technology Springer Netherlands 2/3(1990-11-01), 139-148 0922-5773 2:3<139 1990 2 11265 https://doi.org/10.1007/BF00935211 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1007/BF00935211 text/html Onlinezugriff via DOI NATIONALLICENCE 700 1- Greenstreet Mark Department of Computer Science, Princeton University, 08544, Princeton, NJ aut NATIONALLICENCE 700 1- Steiglitz Kenneth Department of Computer Science, Princeton University, 08544, Princeton, NJ aut NATIONALLICENCE 773 0- Journal of VLSI signal processing systems for signal, image and video technology Springer Netherlands 2/3(1990-11-01), 139-148 0922-5773 2:3<139 1990 2 11265 Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer