The SALADIN project: summary report
ACM SIGSOFT Software Engineering Notes
Bisimulation on speed: worst-case efficiency
Information and Computation
Fairness of components in system computations
Theoretical Computer Science - Expressiveness in concurrency
Bisimulation on speed: a unified approach
Theoretical Computer Science
Bisimulation on speed: a unified approach
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
| Hi-index | 0.00 |
In this paper, we use PAFAS (Process Algebra for FasterAsynchronous Systems) to compare the worst-case efficiency of three bounded-buffer implementations: Fifo, Pipeand Buff. Fifo implements the buffer as a first-in-first-outqueue, Pipe implements the buffer as a pipeline queue andBuff implements the buffer as circular queue in an array.We contrast our results with those in [2] and [10] whichalso aim at comparing the three implementations of thebounded buffer according to some efficiency measure.