By Topic

PAFAS at work: comparing the worst-case efficiency of three buffer implementations

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Corradini, F. ; Dipt. di Informatica, L''Aquila Univ., Italy ; Di Berardini, M.R. ; Vogler, W.

The authors 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 by S. Arun-Kumar and M. Hennessy (1992) and l. Jenner and W. Vogler (1996) which also aim at comparing the three implementations of the bounded buffer according to some efficiency measure

Published in:

Quality Software, 2001. Proceedings.Second Asia-Pacific Conference on

Date of Conference:

2001