论文信息 - Queueing Analysis of a Reordering Issue - 字舞流文

Queueing Analysis of a Reordering Issue

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.

Brigitte Plateau | Gilbert Harrus

[1] Leslie Lamport,et al. Time, clocks, and the ordering of events in a distributed system , 1978, CACM.

[2] Erol Gelenbe,et al. Analysis of Update Synchronization for Multiple Copy Data Bases , 1979, IEEE Transactions on Computers.

[3] Farouk Kamoun,et al. Queueing Analysis of the Ordering Issue in a Distributed Database Concurrency Control Mechanism , 1981, ICDCS.

[4] David J. DeWitt,et al. The Impact of Run-Time Schema Interpretation in a Network Data Model DBMS , 1982, IEEE Transactions on Software Engineering.

[5] Guy Bernard. A Non-Persistent CSMA-Abort Access Protocol for a Local Computer Network , 1981, ICDCS.