12. OPODIS 2008:
Luxor, Egypt
Theodore P. Baker, Alain Bui, Sébastien Tixeuil (Eds.):
Principles of Distributed Systems, 12th International Conference, OPODIS 2008, Luxor, Egypt, December 15-18, 2008. Proceedings.
Lecture Notes in Computer Science 5401 Springer 2008, ISBN 978-3-540-92220-9
Invited Talks
Regular Papers
- Michael G. Merideth, Michael K. Reiter:
Write Markers for Probabilistic Quorum Systems.
5-21

- Eduardo Adílio Pelinson Alchieri, Alysson Neves Bessani, Joni da Silva Fraga, Fabíola Greve:
Byzantine Consensus with Unknown Participants.
22-40

- Carole Delporte-Gallet, Stéphane Devismes, Hugues Fauconnier, Franck Petit, Sam Toueg:
With Finite Memory Consensus Is Easier Than Reliable Broadcast.
41-57

- Yehuda Afek, Iftah Gamzu, Irit Levy, Michael Merritt, Gadi Taubenfeld:
Group Renaming.
58-72

- Björn Andersson:
Global Static-Priority Preemptive Multiprocessor Scheduling with Utilization Bound 38%.
73-88

- Sanjoy K. Baruah, Joël Goossens:
Deadline Monotonic Scheduling on Uniform Multiprocessors.
89-104

- Björn B. Brandenburg, James H. Anderson:
A Comparison of the M-PCP, D-PCP, and FMLPon LITMUSRT.
105-124

- Yuichi Asahiro, Satoshi Fujita, Ichiro Suzuki, Masafumi Yamashita:
A Self-stabilizing Marching Algorithm for a Group of Oblivious Robots.
125-144

- Samia Souissi, Yan Yang, Xavier Défago:
Fault-Tolerant Flocking in a k-Bounded Asynchronous System.
145-163

- Antonio Fernández Anta, Alessia Milani:
Bounds for Deterministic Reliable Geocast in Mobile Ad-Hoc Networks.
164-183

- Marcin Bienkowski, André Brinkmann, Miroslaw Korzeniowski:
Degree 3 Suffices: A Large-Scale Overlay for P2P Networks.
184-196

- Dan Dobre, Matthias Majuntke, Neeraj Suri:
On the Time-Complexity of Robust and Amnesic Storage.
197-216

- Emmanuelle Lebhar, Nicolas Schabanel:
Graph Augmentation via Metric Embedding.
217-225

- Damien Imbs, Michel Raynal:
A Lock-Based STM Protocol That Satisfies Opacity and Progressiveness.
226-245

- Eli Gafni:
The 0-1-Exclusion Families of Tasks.
246-258

- Paulo Sérgio Almeida, Carlos Baquero, Victor Fonte:
Interval Tree Clocks.
259-274

- Michael F. Spear, Luke Dalessandro, Virendra J. Marathe, Michael L. Scott:
Ordering-Based Semantics for Software Transactional Memory.
275-294

- Shouwen Lai, Bo Zhang, Binoy Ravindran, Hyeonjoong Cho:
CQS-Pair: Cyclic Quorum System Pair for Wakeup Scheduling in Wireless Sensor Networks.
295-310

- Tiziana Calamoneri, Emanuele G. Fusco, Andrzej Pelc:
Impact of Information on the Complexity of Asynchronous Radio Broadcasting.
311-330

- Boaz Patt-Shamir, Dror Rawitz, Gabriel Scalosub:
Distributed Approximation of Cellular Coverage.
331-345

- Thomas Clouser, Mark Miyashita, Mikhail Nesterenko:
Fast Geometric Routing with Concurrent Face Traversal.
346-362

- Heinrich Moser, Ulrich Schmid:
Optimal Deterministic Remote Clock Estimation in Real-Time Systems.
363-387

- Joël Goossens, Dragomir Milojevic, Vincent Nélis:
Power-Aware Real-Time Scheduling upon Dual CPU Type Multiprocessor Platforms.
388-407

- Borzoo Bonakdarpour, Sandeep S. Kulkarni:
Revising Distributed UNITY Programs Is NP-Complete.
408-427

- Roberto Baldoni, François Bonnet, Alessia Milani, Michel Raynal:
On the Solvability of Anonymous Partial Grids Exploration by Mobile Robots.
428-445

- Ralf Klasing, Adrian Kosowski, Alfredo Navarra:
Taking Advantage of Symmetries: Gathering of Asynchronous Oblivious Robots on a Ring.
446-462

- Shantanu Das, Matús Mihalák, Rastislav Srámek, Elias Vicari, Peter Widmayer:
Rendezvous of Mobile Agents When Tokens Fail Anytime.
463-480

- Nicolas Schiper, Fernando Pedone:
Solving Atomic Multicast When Groups Crash.
481-495

- Sayaka Kamei, Hirotsugu Kakugawa:
A Self-stabilizing Approximation for the Minimum Connected Dominating Set with Safe Convergence.
496-511

- Stefan Dobrev, Rastislav Kralovic, Dana Pardubská:
Leader Election in Extremely Unreliable Rings and Complete Networks.
512-526

- Vincent Gramoli, Derin Harmanci, Pascal Felber:
Toward a Theory of Input Acceptance for Transactional Memories.
527-533

- Matthieu Roy, François Bonnet, Leonardo Querzoni, Silvia Bonomi, Marc-Olivier Killijian, David Powell:
Geo-registers: An Abstraction for Spatial-Based Distributed Computing.
534-537

- Nikola Trcka, Wil M. P. van der Aalst, Carmen Bratosin, Natalia Sidorova:
Evaluating a Data Removal Strategy for Grid Environments Using Colored Petri Nets.
538-541

- Hyeong Seog Kim, Eunjin Jung, Heon Young Yeom:
Load-Balanced and Sybil-Resilient File Search in P2P Networks.
542-545

- David Coudert, Florian Huc, Dorian Mazauric:
Computing and Updating the Process Number in Trees.
546-550

- André Brinkmann, Sascha Effert:
Redundant Data Placement Strategies for Cluster Storage Environments.
551-554

- Pierre Sens, Luciana Arantes, Mathieu Bouillaguet, Véronique Simon, Fabíola Greve:
An Unreliable Failure Detector for Unknown and Mobile Networks.
555-559

- Andrew Lutomirski, Victor Luchangco:
Efficient Large Almost Wait-Free Single-Writer Multireader Atomic Registers.
560-563

- Olivier Beaumont, Nicolas Bonichon, Philippe Duchon, Lionel Eyraud-Dubois, Hubert Larchevêque:
A Distributed Algorithm for Resource Clustering in Large Scale Platforms.
564-567

- Hyon-Young Choi, Kwang-Ryoul Kim, Hyo-Beom Lee, Sung-Gi Min:
Reactive Smart Buffering Scheme for Seamless Handover in PMIPv6.
568-571

- Björn Andersson:
Uniprocessor EDF Scheduling with Mode Change.
572-577

Last update Mon May 20 15:44:22 2013
CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page