default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID13th OPODIS 2009: Nîmes, France
- Tarek F. Abdelzaher, Michel Raynal, Nicola Santoro:
Principles of Distributed Systems, 13th International Conference, OPODIS 2009, Nîmes, France, December 15-18, 2009. Proceedings. Lecture Notes in Computer Science 5923, Springer 2009, ISBN 978-3-642-10876-1
Invited Talks
- Maurice Herlihy:
Transactional Memory Today: A Status Report. 1 - Anne-Marie Kermarrec:
Navigating the Web 2.0 with Gossple. 2
Distributed Scheduling
- Hagit Attiya
, Alessia Milani:
Transactional Scheduling for Read-Dominated Workloads. 3-17 - Jonatha Anselmi, Bruno Gaujal:
Performance Evaluation of Work Stealing for Streaming Applications. 18-32 - Ioannis Chatzigiannakis, Shlomi Dolev, Sándor P. Fekete, Othon Michail, Paul G. Spirakis:
Not All Fair Probabilistic Schedulers Are Equivalent. 33-47 - Bo Zhang, Binoy Ravindran:
Brief Announcement: Relay: A Cache-Coherence Protocol for Distributed Transactional Memory. 48-53
Distributed Robotics
- Zohir Bouzid, Maria Gradinariu Potop-Butucaru, Sébastien Tixeuil:
Byzantine Convergence in Robot Networks: The Price of Asynchrony. 54-70 - Yoann Dieudonné, Shlomi Dolev, Franck Petit, Michael Segal:
Deaf, Dumb, and Chatting Asynchronous Robots. 71-85 - Adrian Kosowski, Alfredo Navarra, Maria Cristina Pinotti:
Synchronization Helps Robots to Detect Black Holes in Directed Graphs. 86-98
Fault and Failure Detection
- Andreas Haeberlen, Petr Kuznetsov:
The Fault Detection Problem. 99-114 - Carole Delporte-Gallet, Hugues Fauconnier, Sam Toueg:
The Minimum Information about Failures for Solving Non-local Tasks in Message-Passing Systems. 115-128 - Rida A. Bazzi, Maurice Herlihy:
Enhanced Fault-Tolerance through Byzantine Failure Detection. 129-143
Wireless and Social Networks
- Rachid Guerraoui, Kévin Huguenin, Anne-Marie Kermarrec, Maxime Monod:
Decentralized Polling with Respectable Participants. 144-158 - Roy Friedman, Alex Kogan:
Efficient Power Utilization in Multi-radio Wireless Ad Hoc Networks. 159-173 - Lakshmi Anantharamu, Bogdan S. Chlebus, Mariusz A. Rokicki:
Adversarial Multiple Access Channel with Individual Injection Rates. 174-188
Synchronization
- Phuong Hoai Ha, Philippas Tsigas, Otto J. Anshus:
NB-FEB: A Universal Scalable Easy-to-Use Synchronization Primitive for Manycore Architectures. 189-203 - Fabian Kuhn, Rotem Oshman:
Gradient Clock Synchronization Using Reference Broadcasts. 204-218 - Toshimitsu Masuzawa, Taisuke Izumi, Yoshiaki Katayama, Koichi Wada:
Brief Announcement: Communication-Efficient Self-stabilizing Protocols for Spanning-Tree Construction. 219-224
Storage Systems
- Tomer Heber, Danny Hendler, Adi Suissa:
On the Impact of Serializing Contention Management on STM Performance. 225-239 - Burkhard Englert, Chryssis Georgiou, Peter M. Musial, Nicolas C. Nicolaou, Alexander A. Shvartsman:
On the Efficiency of Atomic Multi-reader, Multi-writer Distributed Memory. 240-254 - Matthias Majuntke, Dan Dobre, Marco Serafini, Neeraj Suri:
Abortable Fork-Linearizable Storage. 255-269
Distributed Agreement
- Gadi Taubenfeld:
On the Computational Power of Shared Objects. 270-284 - Martin Biely, Peter Robinson, Ulrich Schmid:
Weak Synchrony Models and Failure Detectors for Message Passing (k-)Set Agreement. 285-299 - Zarko Milosevic, Martin Hutle, André Schiper:
Unifying Byzantine Consensus Algorithms with Weak Interactive Consistency. 300-314
Distributed Algorithms
- Sylvie Delaët, Shlomi Dolev, Olivier Peres:
Safe and Eventually Safe: Comparing Self-stabilizing and Non-stabilizing Algorithms on a Common Ground. 315-329 - Paul D. Ezhilchelvan, Dylan Clarke, Isi Mitrani, Santosh K. Shrivastava:
Proactive Fortification of Fault-Tolerant Services. 330-344 - Evangelos Bampas, Leszek Gasieniec, Ralf Klasing, Adrian Kosowski, Tomasz Radzik:
Robustness of the Rotor-router Mechanism. 345-358 - Yves Métivier, John Michael Robson, Nasser Saheb-Djahromi, Akka Zemmari:
Brief Annoucement: Analysis of an Optimal Bit Complexity Randomised Distributed Vertex Colouring Algorithm. 359-364 - Linda Pagli, Giuseppe Prencipe:
Brief Annoucement: Distributed Swap Edges Computation for Minimum Routing Cost Spanning Trees. 365-371
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-10-31 20:22 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
