Speaker: Nicolaos Nicolaou
 
Day:  Wednesday, 10/27/2004
Room: ITE 336
Time:  3:30pm-4:30pm 

Title: How Fast can a Distributed Atomic Read be?
----------------------------------------------------------------------------

Abstract: This paper addresses the problem of designing
an efficient implementation of a basic atomic read/write
register over an asynchronous message passing system.
In particular, they consider time-efficient implementations of this
abstraction in the case of a single writer, multiple readers 
(also called a SWMR atomic register)
 and S servers: the writer, the readers, and t out of the S
 servers may fail by crashing. They investigate the 
possibility of fast implementations,
namely, implementations that complete both reads and
writes in one round-trip. They show that, interestingly, the
existence of a fast implementation depends on the maximum
number of readers considered. More precisely, they show that
a fast implementation is possible if and only if the number
of readers is less than (S/t) -2.

The presentation is based on the paper:
[P. Dutta, R. Gerraoui, R. R. Levy and A. Chakraborty, How Fast can a
Distributed Atomic Read be, Proceedings of  the 23rd annual ACM Symposium
on Principles of distributed computing (PODC 2004), pp. 236- 245, ACM press
2004.]


back to CSE-TS page