C. Siva Ram Murthy

Mainak Chatterjee

Prasad Jayanti

Shrisha Rao

Sanjoy Kumar Saha

This book constitutes the fully refereed proceedings of the 9th International Conference on Distributed Computing and Networking, ICDCN 2008 - formerly known as IWDC (International Workshop on Distributed Computing), held in Kolkata, India, in January 2008. The 30 revised full papers and 27 revised short papers presented together with 3 keynote talks and 1 invited lecture were carefully reviewed and selected from 185 submissions. The papers are organized in topical sections.

9th International Conference, ICDCN 2008, Kolkata, India, January 5-8, 2008, Proceedings

Distributed Computing and Networking

G. Goos

J. Hartmanis

Jan Van Leeuwen

This book constitutes the refereed proceedings of the 13th International Symposium on Distributed Computing, DISC'99, held in Bratislava, Slovak Republic, in September 1999. The 23 revised full papers presented with an invited paper were carefully reviewed and selected from a total of 75 submissions. The papers address a variety of current issues in distributed algorithms, systems, and programming, in particular failure detectors, broadcasting, group communication services, quorum systems, cryptography, randomness, mutual exclusion, networking, protocols, scheduling algorithms, and self-stabilization.

13th International Symposium, DISC'99, Bratislava, Slovak Republic, September 27-29, 1999, Proceedings

Distributed Computing

DISC, the International Symposium on DIStributed Computing, is an annual forum for research presentations on all facets of distributed computing. This volume includes 23 contributed papers and an invited lecture, all presented at DISC ’99, held on September 27-29, 1999 in Bratislava, Slovak Republic. In addition to regular submissions, the call for papers for DISC ’99 also - licited Brief Announcements (BAs). We received 60 regular submissions and 15 brief announcement submissions. These were read and evaluated by the p- gramcommittee, with the additional help of external reviewerswhen needed. At the program committee meeting on June 10-11 at Dartmouth College, Hanover, USA, 23 regular submissions and 4 BAs were selected for presentation at DISC ’99. The extended abstracts of these 23 regular papers appear in this volume, while the four BAs appear as a special publication of Comenius Univ- sity, Bratislava– the hostof DISC ’99.It is expected that the regularpapers will be submitted later, in more polished form, to fully refereed scienti?c journals. Of the 23 regular papers selected for the conference, 12 quali?ed for the Best Student Paper award. The program committee awarded this honor to the paper entitled “Revisiting the Weakest Failure Detector for Uniform Reliable Broadcast” by Marcos Aguilera, Sam Toueg, and Borislav Deianov. Marcos and Borislav, who are both students, share this award.

CORNELL UNIV ITHACA NY Dept. of COMPUTER SCIENCE.

A wait-free hierarchy maps object types to levels in $Z[superscript]{+} \cup \{ \infty \}$, and has the following property: if a type $T$ is at level $N$, and $T'$ is an arbitrary type, then there is a wait-free implementation of an object of type $T'$, for $N$ processes, using only registers and objects of type $T$. The infinite hierarchy defined by Herlihy is an example of a wait-free hierarchy. A wait-free hierarchy is robust if it has the following property: if $T$ is at level $N$, and $\cal S$ is a finite set of types belonging to levels $N$ -- 1 or lower, then there is no wait-free implementation of an object of type $T$, for $N$ processes, using any number and any combination of objects belonging to the types in $\cal S$. Robustness implies that there are no clever ways of combining weak shared objects to obtain stronger ones.

Prasad Jayanti

Books

Your next favorite book is out there