Program

Regular presentations are 25 minutes long,
Brief announcements (BA) are 10 minutes long.

Monday, October 28th

08:00 - 09:00

Registration

09:00 - 09:15

Opening remarks

09:15 - 10:10 Keynote Presentation

Building a Bridge Between Distributed Systems Theory and Commercial Practice
Brian Whetten

10:10 - 10:40

Break

10:40 - 11:55 Session 1 chair: Dahlia Malkhi

• Assignment-Based Partitioning in a Condition Monitoring System
  Yongqiang Huang and Hector Garcia-Molina
  Winner of best student paper award
• Minimal Byzantine Storage
  Jean-Philippe Martin, Lorenzo Alvisi and Michael Dahlin
• Tight Bounds for Shared Memory Systems Accessed by Byzantine Processes
  Michael Merritt, Omer Reingold, Gadi Taubenfeld and Rebecca N. Wright

11:55 - 13:30

Lunch

13:30 - 14:45 Session 2 chair: Faith Fich

• Distributed Agreement and its Relation with Error-Correcting Codes
  Roy Friedman, Achour Mostéfaoui, Sergio Rajsbaum and Michel Raynal
• Condition-Based Protocols for Set Agreement Problems
  Achour Mostéfaoui, Sergio Rajsbaum, Michel Raynal and Matthieu Roy
  and
  Wait-Free n-set Consensus when Inputs are Restricted
  Hagit Attiya and Zvi Avidor
• An Efficient Universal Construction for Message-Passing Systems
  Partha Dutta, Svend Frølund, Rachid Guerraoui and Bastian Pochon

14:45 - 15:15

Break

15:15 - 16:40 Session 3 chair: Michael Merritt

• Clock Synchronization using Packet Streams (BA)
  Philipp Blum and Lothar Thiele
• Secure Computation Without Agreement
  Shafi Goldwasser and Yehuda Lindell
• Ruminations on Domain-Based Reliable Broadcast
  Svend Frølund and Fernando Pedone
• Early-Delivery Dynamic Atomic Broadcast
  Ziv Bar-Joseph, Idit Keidar and Nancy Lynch

16:40 - 17:30

Business meeting

18:15

Reception at the City hall

19:00

Dinner (on your own)

Tuesday, October 29th

09:00 - 10:15 Session 4 chair: Roy Friedman

• Simple Wait-free Multireader Registers
  Paul Vitányi
• A Practical Multi-Word Compare-and-Swap Operation
  Timothy L. Harris, Keir Fraser and Ian A. Pratt
• The Repeat Offender Problem: A Mechanism for Supporting Dynamic-Sized, Lock-Free Data Structures
  Maurice Herlihy, Victor Luchangco and Mark Moir

10:15 - 10:45

Break

10:45 - 12:10 Session 4 chair: Nancy Lynch

• Shifting Arguments Without Global Time (BA)
  Jerry James, Jed Miadowicz, Sivaprasath Murugeshan and Mangal Singh
• On the Stability of Compositions of Universally Stable, Greedy Contention-Resolution Protocols
  D. Koukopoulos, M. Mavronicolas, S. Nikoletseas and P. Spirakis
• Transformations of Self-Stabilizing Algorithms
  Kleoni Ioannidou
• Stateless Termination Detection
  Gideon Stupp

12:10 - 14:00

Lunch

14:00 - 15:15 Session 5 chair: Mark Yamashita

• RAMBO: A Reconfigurable Atomic Memory Service
  Nancy Lynch and Alex Shvartsman
• Ad Hoc Membership for Scalable Applications
  Tal Anker, Danny Dolev and Ilya Shnayderman
• The Lord of the Rings: Efficient Maintenance of Views at Data Warehouses
  D. Agrawal, A. El Abbadi, A. Mostéfaoui, M. Raynal and M. Roy

15:15 - 15:45

Break

15:45 - 16:45 Session 6 chair: Michel Raynal

• Subscription Partitioning and Routing in Content-based Publish/Subscribe Networks (BA)
  Yi-Min Wang, Lili Qiu, Dimitris Achlioptas, Gautam Das, Paul Larson and Helen J. Wang
• Improved Compact Routing Scheme for Chordal Graphs
  Yon Dourisboure and Cyril Gavoille
• Bounding Work and Communication in Robust Cooperative Computation
  Bogdan S. Chlebus, Leszek Gçasieniec, Dariusz R. Kowalski and Alex A. Shvartsman

16:45 - 17:15 special talk

IST and Future and Emerging Technologies in the VI EC Framework Programme of Research
Leonardo Flores Añover, The European Commission
(special address by EC on FP6)

18:30

Bus leaves from ENSEEIHT for the Banquet

19:00

Visit and banquet at the Cité de l'Espace (City of Space)

Wednesday, October 30th

09:00 - 10:25 Session 7 chair: Alex Shvartsman

• A Sufficient Condition to Transform <>S into <>P in Asynchronous Systems (BA)
  Antonio Fernández, Mikel Larrea and Sergio Arévalo
• Failure Detection Lower Bounds on Registers and Consensus
  Carole Delporte-Gallet, Hugues Fauconnier and Rachid Guerraoui
• Failure Detection Sequencers: Necessary and Sufficient Information about Failures to Solve Predicate Detection
  Felix C. Gärtner and Stefan Pleisch
• On the Impact of Fast Failure Detectors on Real-Time Fault-Tolerant Systems
  Marcos K. Aguilera, Gérard Le Lann and Sam Toueg
• Closing remarks.

10:30 - 10:50

Break

Regular presentations are 25 minutes long,
Brief announcements (BA) are 10 minutes long.