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.
PAFAS at Work: Comparing the Worst-Case Efficiency of Three Buffer Implementations.
CORRADINI, Flavio;DI BERARDINI, Maria Rita;
2001-01-01
Abstract
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.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
