Amazon cover image
Image from Amazon.com

Principles of Distributed Systems [electronic resource] : 11th International Conference, OPODIS 2007, Guadeloupe, French West Indies, December 17-20, 2007. Proceedings / edited by Eduardo Tovar, Philippas Tsigas, Hacène Fouchal.

By: Contributor(s): Material type: TextTextSeries: Lecture Notes in Computer Science ; 4878Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2007Description: XIII, 466 p. online resourceContent type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9783540770961
Subject(s): Additional physical formats: Printed edition:: No titleDDC classification:
  • 004.6 23
LOC classification:
  • TK5105.5-5105.9
Online resources:
Contents:
A Decentralized, Scalable, and Autonomous Grid Monitoring System -- A Formal Analysis of the Deferred Update Technique -- ASAP: A Camera Sensor Network for Situation Awareness -- Asynchronous Active Recommendation Systems -- Brute-Force Determination of Multiprocessor Schedulability for Sets of Sporadic Hard-Deadline Tasks -- Byzantine Consensus with Few Synchronous Links -- Clock Synchronization in the Byzantine-Recovery Failure Model -- Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots -- Deterministic Communication in the Weak Sensor Model -- Deterministic Leader Election in Anonymous Sensor Networks Without Common Coordinated System -- Distance Sensitive Snapshots in Wireless Sensor Networks -- Distributed Approximation Algorithms for Finding 2-Edge-Connected Subgraphs -- Does Clock Precision Influence ZigBee’s Energy Consumptions? -- From an Intermittent Rotating Star to a Leader -- Global Deadline-Monotonic Scheduling of Arbitrary-Deadline Sporadic Task Systems -- LFthreads: A Lock-Free Thread Library -- Making Distributed Applications Robust -- Maximizing the Number of Broadcast Operations in Static Random Geometric Ad-Hoc Networks -- N-Consensus is the Second Strongest Object for N?+?1 Processes -- Non-Searchability of Random Power-Law Graphs -- O(logn)-Time Overlay Network Construction from Graphs with Out-Degree 1 -- On the Self-stabilization of Mobile Robots in Graphs -- Peer to Peer Multidimensional Overlays: Approximating Complex Structures -- Secretive Birds: Privacy in Population Protocols -- Self-stabilizing and Byzantine-Tolerant Overlay Network -- Separability to Help Parallel Simulation of Distributed Computations -- Small-World Networks: From Theoretical Bounds to Practical Systems -- The Anonymous Consensus Hierarchy and Naming Problems -- The Baskets Queue -- The Cost of Monotonicity in Distributed Graph Searching -- Timed Quorum Systems for Large-Scale and Dynamic Environments -- Worm Versus Alert: Who Wins in a Battle for Control of a Large-Scale Network?.
In: Springer eBooks
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Call number Status Date due Barcode
E-Book E-Book Central Library Available E-44854

A Decentralized, Scalable, and Autonomous Grid Monitoring System -- A Formal Analysis of the Deferred Update Technique -- ASAP: A Camera Sensor Network for Situation Awareness -- Asynchronous Active Recommendation Systems -- Brute-Force Determination of Multiprocessor Schedulability for Sets of Sporadic Hard-Deadline Tasks -- Byzantine Consensus with Few Synchronous Links -- Clock Synchronization in the Byzantine-Recovery Failure Model -- Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots -- Deterministic Communication in the Weak Sensor Model -- Deterministic Leader Election in Anonymous Sensor Networks Without Common Coordinated System -- Distance Sensitive Snapshots in Wireless Sensor Networks -- Distributed Approximation Algorithms for Finding 2-Edge-Connected Subgraphs -- Does Clock Precision Influence ZigBee’s Energy Consumptions? -- From an Intermittent Rotating Star to a Leader -- Global Deadline-Monotonic Scheduling of Arbitrary-Deadline Sporadic Task Systems -- LFthreads: A Lock-Free Thread Library -- Making Distributed Applications Robust -- Maximizing the Number of Broadcast Operations in Static Random Geometric Ad-Hoc Networks -- N-Consensus is the Second Strongest Object for N?+?1 Processes -- Non-Searchability of Random Power-Law Graphs -- O(logn)-Time Overlay Network Construction from Graphs with Out-Degree 1 -- On the Self-stabilization of Mobile Robots in Graphs -- Peer to Peer Multidimensional Overlays: Approximating Complex Structures -- Secretive Birds: Privacy in Population Protocols -- Self-stabilizing and Byzantine-Tolerant Overlay Network -- Separability to Help Parallel Simulation of Distributed Computations -- Small-World Networks: From Theoretical Bounds to Practical Systems -- The Anonymous Consensus Hierarchy and Naming Problems -- The Baskets Queue -- The Cost of Monotonicity in Distributed Graph Searching -- Timed Quorum Systems for Large-Scale and Dynamic Environments -- Worm Versus Alert: Who Wins in a Battle for Control of a Large-Scale Network?.

There are no comments on this title.

to post a comment.

Maintained by VTU Library