Second Asia-Pacific Conference on Quality Software (APAQS'01) PAFAS at Work: Comparing the Worst-Case Efficiency of Three Buffer Implementations Hong Kong December 10-December 11 ISBN: 0-7695-1287-9
In this paper, we use PAFAS (Process Algebra for Faster Asynchronous Systems) to compare the worst-case efficiency of three bounded-buffer implementations: Fifo, Pipe and Buff. Fifo implements the buffer as a first-in-first-out queue, Pipe implements the buffer as a pipeline queue and Buff implements the buffer as circular queue in an array. We contrast our results with those in [2] and [10] which also aim at comparing the three implementations of the bounded buffer according to some efficiency measure.
Citation:
F. Corradini, M. Di Berardini, W. Vogler, "PAFAS at Work: Comparing the Worst-Case Efficiency of Three Buffer Implementations," apaqs, pp.0231, Second Asia-Pacific Conference on Quality Software (APAQS'01), 2001 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb