Queueing Analysis of a Reordering Issue
- 1 March 1982
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering
- Vol. SE-8 (2) , 113-123
- https://doi.org/10.1109/tse.1982.234954
Abstract
In this paper an M/G/∞queue is considered that receives a stream of numbered tasks. Results are derived concerning the probabilistic properties of the reordering done by the queue.Keywords
This publication has 2 references indexed in Scilit:
- Analysis of Update Synchronization for Multiple Copy Data BasesIEEE Transactions on Computers, 1979
- Time, clocks, and the ordering of events in a distributed systemCommunications of the ACM, 1978