Principles of Distributed Systems 14th International Conference, OPODIS 2010, Tozeur, Tunisia, December 14-17, 2010. Proceedings /

The 14th International Conference on Principles of Distributed Systems (OPODIS 2010) took place during December 14-17, 2010 in Tozeur, Tunisia. It continued a tradition of successful conferences; Chantilly (1997), Amiens (1998), Hanoi (1999), Paris (2000), Mexico (2001), Reims (2002), La Martinique...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor Corporativo: SpringerLink (Online service)
Otros Autores: Lu, Chenyang (Editor ), Masuzawa, Toshimitsu (Editor ), Mosbah, Mohamed (Editor )
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2010.
Edición:1st ed. 2010.
Colección:Theoretical Computer Science and General Issues, 6490
Temas:
Computer networks .
Algorithms.
Computer science-Mathematics.
Discrete mathematics.
Software engineering.
Artificial intelligence.
Computer Communication Networks.
Discrete Mathematics in Computer Science.
Software Engineering.
Artificial Intelligence.
Symbolic and Algebraic Manipulation.
Acceso en línea:Texto Completo
Tabla de Contenidos:
  • Robots
  • Pattern Formation through Optimum Matching by Oblivious CORDA Robots
  • RoboCast: Asynchronous Communication in Robot Networks
  • Randomization in Distributed Algorithms
  • Biased Selection for Building Small-World Networks
  • Application of Random Walks to Decentralized Recommender Systems
  • Uniform and Ergodic Sampling in Unstructured Peer-to-Peer Systems with Malicious Nodes
  • Brief Announcements I
  • Self-stabilizing (k,r)-Clustering in Wireless Ad-hoc Networks with Multiple Paths
  • Self-stabilizing Byzantine Asynchronous Unison,
  • Graph Algorithms
  • Reliably Detecting Connectivity Using Local Graph Traits
  • Distributed Game-Theoretic Vertex Coloring
  • Constructing a Map of an Anonymous Graph: Applications of Universal Sequences
  • Brief Announcements II
  • Effect of Fairness in Model Checking of Self-stabilizing Programs
  • A Formal Framework for Conformance Testing of Distributed Real-Time Systems
  • Fault-Tolerance
  • Signature-Free Broadcast-Based Intrusion Tolerance: Never Decide a Byzantine Value
  • A Fault Avoidance Strategy Improving the Reliability of the EGI Production Grid Infrastructure
  • Failure Detectors Encapsulate Fairness
  • -Based k-Set Agreement Algorithms
  • Distributed Programming
  • Distributed Programming with Tasks
  • SkewCCC+: A Heterogeneous Distributed Hash Table
  • On the Automated Implementation of Time-Based Paxos Using the IOA Compiler
  • Real-Time
  • Partitioning Real-Time Systems on Multiprocessors with Shared Resources
  • On Best-Effort Utility Accrual Real-Time Scheduling on Multiprocessors
  • Tardiness Bounds for Global EDF with Deadlines Different from Periods
  • Shared Memory
  • Cache-Aware Lock-Free Queues for Multiple Producers/Consumers and Weak Memory Consistency
  • An Adaptive Technique for Constructing Robust and High-Throughput Shared Objects
  • Efficient Lock Free Privatization
  • A Competitive Analysis for Balanced Transactional Memory Workloads
  • Concurrency
  • Fast Local-Spin Abortable Mutual Exclusion with Bounded Space
  • Turning Adversaries into Friends: Simplified, Made Constructive, and Extended
  • Quasi-Linearizability: Relaxed Consistency for Improved Concurrency
  • A Token-Based Distributed Algorithm for the Generalized Resource Allocation Problem
  • On the Message Complexity of Global Computations
  • Optimizing Regenerator Cost in Traffic Grooming
  • On Minimizing Average End-to-End Delay in P2P Live Streaming Systems
  • Monotonic Stabilization
  • Upper and Lower Bounds of Space Complexity of Self-Stabilizing Leader Election in Mediated Population Protocol
  • Improving Space Complexity of Self-stabilizing Counting on Mobile Sensor Networks.

Ejemplares similares