Toggle Main Menu Toggle Search

Open Access padlockePrints

Brief announcement: Building responsive TMR-based servers in presence of timing constraints

Lookup NU author(s): Dr Paul Ezhilchelvan

Downloads

Full text for this publication is not currently held within this repository. Alternative links are provided below where available.


Abstract

The problem of designing a server subsystem in an application allowing an arbitrary large number of geographically dispersed clients to remotely access the server to which they are connected through a network is addressed. Two results are discussed. The first one is a Σ-ordering protocol, built above an Ordered Timed Atomic Broadcast protocol (OTAB) implemented on top of the TMR subsystem. The second result is an impossibility theorem: "Let-Δ be the minimum timeliness of any reliable broadcast protocol implemented on top of the TM server. If Σ


Publication metadata

Author(s): Ezhilchelvan PD, Helary J-M, Raynal M

Publication type: Conference Proceedings (inc. Abstract)

Publication status: Published

Conference Name: Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Year of Conference: 2002

Pages: 127-

Publisher: Association for Computing Machinery


Actions

Find at Newcastle University icon    Link to this publication


Share