Principles of Distributed Systems - new book

EAN (ISBN-13): 9783540922209
ISBN (ISBN-10): 3540922202
Hardcover
Paperback
Publishing year: 2008
Publisher: Baker, Theodore P. Springer
580 Pages
Weight: 0,875 kg
Language: eng/Englisch

Book in our database since 2009-01-11T18:50:31+00:00 (London)
Detail page last modified on 2024-01-28T09:44:25+00:00 (London)
ISBN/EAN: 9783540922209

ISBN - alternate spelling:
3-540-92220-2, 978-3-540-92220-9
Alternate spelling and related search-keywords:
Book author: baker, bui, bastien, sébastien, thibault
Book title: luxor, principles distributed systems, egypt, principles systems science, principles system science

---

Information from Publisher

Author: Theodore P. Baker; Alain Bui; Sebastien Tixeuil
Title: Lecture Notes in Computer Science; Theoretical Computer Science and General Issues; Principles of Distributed Systems - 12th International Conference, OPODIS 2008, Luxor, Egypt, December 15-18, 2008. Proceedings
Publisher: Springer; Springer Berlin
580 Pages
Publishing year: 2008-12-02
Berlin; Heidelberg; DE
Printed / Made in
Weight: 0,902 kg
Language: English
53,49 € (DE)
54,99 € (AT)
59,00 CHF (CH)
POD
XIV, 580 p.

BC; Information Systems and Communication Service; Hardcover, Softcover / Informatik, EDV/Informatik; Netzwerk-Hardware; Verstehen; Informatik; Broadcast; Overlay; Quorum; Roadcasting; algorithms; cluster computing; complexity; distributed computing; distributed systems; networks; performance; petri net; robot; routing; verification; Computer Systems Organization and Communication Networks; Management of Computing and Information Systems; Artificial Intelligence; Computer Communication Networks; Computer Engineering and Networks; IT Operations; Artificial Intelligence; Computerhardware; Wirtschaftsmathematik und -informatik, IT-Management; Künstliche Intelligenz; EA

Invited Talks.- The Next 700 BFT Protocols.- On Replication of Software Transactional Memories.- Regular Papers.- Write Markers for Probabilistic Quorum Systems.- Byzantine Consensus with Unknown Participants.- With Finite Memory Consensus Is Easier Than Reliable Broadcast.- Group Renaming.- Global Static-Priority Preemptive Multiprocessor Scheduling with Utilization Bound 38%.- Deadline Monotonic Scheduling on Uniform Multiprocessors.- A Comparison of the M-PCP, D-PCP, and FMLP on LITMUSRT.- A Self-stabilizing Marching Algorithm for a Group of Oblivious Robots.- Fault-Tolerant Flocking in a k-Bounded Asynchronous System.- Bounds for Deterministic Reliable Geocast in Mobile Ad-Hoc Networks.- Degree 3 Suffices: A Large-Scale Overlay for P2P Networks.- On the Time-Complexity of Robust and Amnesic Storage.- Graph Augmentation via Metric Embedding.- A Lock-Based STM Protocol That Satisfies Opacity and Progressiveness.- The 0–1-Exclusion Families of Tasks.- Interval Tree Clocks.- Ordering-Based Semantics for Software Transactional Memory.- CQS-Pair: Cyclic Quorum System Pair for Wakeup Scheduling in Wireless Sensor Networks.- Impact of Information on the Complexity of Asynchronous Radio Broadcasting.- Distributed Approximation of Cellular Coverage.- Fast Geometric Routing with Concurrent Face Traversal.- Optimal Deterministic Remote Clock Estimation in Real-Time Systems.- Power-Aware Real-Time Scheduling upon Dual CPU Type Multiprocessor Platforms.- Revising Distributed UNITY Programs Is NP-Complete.- On the Solvability of Anonymous Partial Grids Exploration by Mobile Robots.- Taking Advantage of Symmetries: Gathering of Asynchronous Oblivious Robots on a Ring.- Rendezvous of Mobile Agents When Tokens Fail Anytime.- Solving Atomic Multicast When Groups Crash.- A Self-stabilizing Approximation for the Minimum Connected Dominating Set with Safe Convergence.- Leader Election in Extremely Unreliable Rings and Complete Networks.- Toward a Theory of Input Acceptance for Transactional Memories.- Geo-registers: An Abstraction for Spatial-Based Distributed Computing.- Evaluating a Data Removal Strategy for Grid Environments Using Colored Petri Nets.- Load-Balanced and Sybil-Resilient File Search in P2P Networks.- Computing and Updating the Process Number in Trees.- Redundant Data Placement Strategies for Cluster Storage Environments.- An Unreliable Failure Detector for Unknown and Mobile Networks.- Efficient Large Almost Wait-Free Single-Writer Multireader Atomic Registers.- A Distributed Algorithm for Resource Clustering in Large Scale Platforms.- Reactive Smart Buffering Scheme for Seamless Handover in PMIPv6.- Uniprocessor EDF Scheduling with Mode Change.