The search functionality is under construction.

IEICE TRANSACTIONS on Fundamentals

Efficient Linearizable Implementation of Shared FIFO Queues and General Objects on a Distributed System

Michiko INOUE, Toshimitsu MASUZAWA, Nobuki TOKURA

  • Full Text Views

    0

  • Cite this

Summary :

We consider linearizable implementations of shared FIFO queues and general deterministic objects on a distributed message-passing system which provides a real-time timer. The efficiency of an implementation is measured by the worst-case response time res_time(op) for each operation op of the implemented objects. We show the following results under the assumption that all message delays are in the range [d-u,d] for some constants d and u (0 u d). We first present an implementation of deterministic objects with res_time(opa)=u for any ack-type operation opa and res_time(opv)=2d for any val-type operation opv, where an ack-type operation is an operation which always returns a unique response and a val-type operation is an operation which is not ack-type. We also consider an implementation of FIFO queues, which have two kinds of operations, enq(v) and deq. We show that, for any implementation of FIFO queues, (1) res_time(enq(v)) u(n-1)/n holds for some v where n is the number of processes, and (2) res_time(deq) d+u/2 holds in the case of u (2/3)d.

Publication
IEICE TRANSACTIONS on Fundamentals Vol.E81-A No.5 pp.768-775
Publication Date
1998/05/25
Publicized
Online ISSN
DOI
Type of Manuscript
Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category

Authors

Keyword