Distributed Computing [[electronic resource] ] : 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010, Proceedings / / edited by Nancy A. Lynch, Alexander A. Shvartsman
| Distributed Computing [[electronic resource] ] : 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010, Proceedings / / edited by Nancy A. Lynch, Alexander A. Shvartsman |
| Edizione | [1st ed. 2010.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
| Descrizione fisica | 1 online resource (XV, 532 p. 85 illus.) |
| Disciplina | 004.6 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer networks
Software engineering Application software Algorithms Computer programming Computer Communication Networks Software Engineering Computer and Information Systems Applications Programming Techniques |
| ISBN | 3-642-15763-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | The 2010 Edsger W. Dijkstra Prize in Distributed Computing -- The 2010 Edsger W. Dijkstra Prize in Distributed Computing -- Invited Lecture I: Consensus (Session 1a) -- The Power of Abstraction -- Fast Asynchronous Consensus with Optimal Resilience -- Transactions (Session 1b) -- Transactions as the Foundation of a Memory Consistency Model -- The Cost of Privatization -- A Scalable Lock-Free Universal Construction with Best Effort Transactional Hardware -- Window-Based Greedy Contention Management for Transactional Memory -- Shared Memory Services and Concurrency (Session 1c) -- Scalable Flat-Combining Based Synchronous Queues -- Fast Randomized Test-and-Set and Renaming -- Concurrent Computing and Shellable Complexes -- Brief Announcements I (Session 1d) -- Brief Announcement: Hybrid Time-Based Transactional Memory -- Brief Announcement: Quasi-Linearizability: Relaxed Consistency for Improved Concurrency -- Brief Announcement: Fast Local-Spin Abortable Mutual Exclusion with Bounded Space -- Wireless Networks (Session 1e) -- What Is the Use of Collision Detection (in Wireless Networks)? -- Deploying Wireless Networks with Beeps -- Distributed Contention Resolution in Wireless Networks -- A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks -- Brief Announcements II (Session 1f) -- Brief Announcement: Simple Gradecast Based Algorithms -- Brief Announcement: Decentralized Network Bandwidth Prediction -- Brief Announcement: Synchronous Las Vegas URMT Iff Asynchronous Monte Carlo URMT -- Invited Lecture II: Best Student Paper (Session 2a) -- Foundations of Speculative Distributed Computing -- Anonymous Asynchronous Systems: The Case of Failure Detectors -- Consensus and Leader Election (Session 2b) -- The Computational Structure of Progress Conditions -- Scalable Quantum Consensus for Crash Failures -- How Much Memory Is Needed for Leader Election -- Leader Election Problem versus Pattern Formation Problem -- Mobile Agents (Session 2c) -- Rendezvous of Mobile Agents in Directed Graphs -- Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids -- Exclusive Perpetual Ring Exploration without Chirality -- Drawing Maps with Advice -- Invited Lecture III: Wireless Networks (Session 3a) -- Network-Aware Distributed Algorithms: Challenges and Opportunities in Wireless Networks -- Connectivity Problem in Wireless Networks -- Computing in Wireless and Mobile Networks (Session 3b) -- Trusted Computing for Fault-Prone Wireless Networks -- Opportunistic Information Dissemination in Mobile Ad-hoc Networks: The Profit of Global Synchrony -- Brief Announcements III (Session 3c) -- Brief Announcement: Failure Detectors Encapsulate Fairness -- Brief Announcement: Automated Support for the Design and Validation of Fault Tolerant Parameterized Systems - A Case Study -- Brief Announcement: On Reversible and Irreversible Conversions -- Brief Announcement: A Decentralized Algorithm for Distributed Trigger Counting -- Brief Announcement: Flash-Log – A High Throughput Log -- Brief Announcement: New Bounds for Partially Synchronous Set Agreement -- Modeling Issues and Adversity (Session 3d) -- It’s on Me! The Benefit of Altruism in BAR Environments -- Beyond Lamport’s Happened-Before: On the Role of Time Bounds in Synchronous Systems -- On the Power of Non-spoofing Adversaries -- Implementing Fault-Tolerant Services Using State Machines: Beyond Replication -- Self-stabilizing and Graph Algortihms (Session 3e) -- Low Communication Self-stabilization through Randomization -- Fast Self-stabilizing Minimum Spanning Tree Construction -- The Impact of Topology on Byzantine Containment in Stabilization -- Minimum Dominating Set Approximation in Graphs of Bounded Arboricity -- Brief Announcements IV (Session 3f) -- Brief Announcement: Sharing Memory in a Self-stabilizing Manner -- Brief Announcement: Stabilizing Consensus with the Power of Two Choices. |
| Record Nr. | UNISA-996466273403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Principles of Distributed Systems [[electronic resource] ] : 10th International Conference, OPODIS 2006, Bordeaux, France, December 12-15, 2006, Proceedings / / edited by Alexander A. Shvartsman
| Principles of Distributed Systems [[electronic resource] ] : 10th International Conference, OPODIS 2006, Bordeaux, France, December 12-15, 2006, Proceedings / / edited by Alexander A. Shvartsman |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
| Descrizione fisica | 1 online resource (XIV, 450 p.) |
| Disciplina | 005.4/476 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer systems
Computer networks Software engineering Computer programming Operating systems (Computers) Computers, Special purpose Computer System Implementation Computer Communication Networks Software Engineering Programming Techniques Operating Systems Special Purpose and Application-Based Systems |
| ISBN | 3-540-49991-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Lazy and Speculative Execution in Computer Systems -- In Search of the Holy Grail: Looking for the Weakest Failure Detector for Wait-Free Set Agreement -- A Topological Treatment of Early-Deciding Set-Agreement -- Renaming with k-Set-Consensus: An Optimal Algorithm into n + k – 1 Slots -- When Consensus Meets Self-stabilization -- On the Cost of Uniform Protocols Whose Memory Consumption Is Adaptive to Interval Contention -- Optimistic Algorithms for Partial Database Replication -- Optimal Clock Synchronization Revisited: Upper and Lower Bounds in Real-Time Systems -- Distributed Priority Inheritance for Real-Time and Embedded Systems -- Safe Termination Detection in an Asynchronous Distributed System When Processes May Crash and Recover -- Lock-Free Dynamically Resizable Arrays -- Distributed Spanner Construction in Doubling Metric Spaces -- Verification Techniques for Distributed Algorithms -- Mobile Agent Algorithms Versus Message Passing Algorithms -- Incremental Construction of k-Dominating Sets in Wireless Sensor Networks -- Of Malicious Motes and Suspicious Sensors: On the Efficiency of Malicious Interference in Wireless Networks -- Empire of Colonies Self-stabilizing and Self-organizing Distributed Algorithms -- Glance: A Lightweight Querying Service for Wireless Sensor Networks -- On Many-to-Many Communication in Packet Radio Networks -- Robust Random Number Generation for Peer-to-Peer Systems -- About the Lifespan of Peer to Peer Networks -- Incentive-Based Robust Reputation Mechanism for P2P Services -- Searching for Black-Hole Faults in a Network Using Multiple Agents -- Gathering Asynchronous Mobile Robots with Inaccurate Compasses -- Gathering Few Fat Mobile Robots in the Plane -- Hop Chains: Secure Routing and the Establishment of Distinct Identities -- Computing on a Partially Eponymous Ring -- Self-stabilizing Leader Election in Networks of Finite-State Anonymous Agents -- Robust Self-stabilizing Clustering Algorithm -- Self-stabilizing Wireless Connected Overlays. |
| Record Nr. | UNISA-996466011903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Principles of distributed systems : 10th international conference, OPODIS 2006, Bordeaux, France, December 12-15, 2006 : proceedings / / Alexander A. Shvartsman (ed.)
| Principles of distributed systems : 10th international conference, OPODIS 2006, Bordeaux, France, December 12-15, 2006 : proceedings / / Alexander A. Shvartsman (ed.) |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin ; ; New York, : Springer, 2006 |
| Descrizione fisica | 1 online resource (XIV, 450 p.) |
| Disciplina | 005.4/476 |
| Altri autori (Persone) | ShvartsmanAlexander A |
| Collana |
Lecture notes in computer science
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
| Soggetto topico |
Electronic data processing - Distributed processing
Distributed operating systems (Computers) |
| ISBN | 3-540-49991-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Lazy and Speculative Execution in Computer Systems -- In Search of the Holy Grail: Looking for the Weakest Failure Detector for Wait-Free Set Agreement -- A Topological Treatment of Early-Deciding Set-Agreement -- Renaming with k-Set-Consensus: An Optimal Algorithm into n + k – 1 Slots -- When Consensus Meets Self-stabilization -- On the Cost of Uniform Protocols Whose Memory Consumption Is Adaptive to Interval Contention -- Optimistic Algorithms for Partial Database Replication -- Optimal Clock Synchronization Revisited: Upper and Lower Bounds in Real-Time Systems -- Distributed Priority Inheritance for Real-Time and Embedded Systems -- Safe Termination Detection in an Asynchronous Distributed System When Processes May Crash and Recover -- Lock-Free Dynamically Resizable Arrays -- Distributed Spanner Construction in Doubling Metric Spaces -- Verification Techniques for Distributed Algorithms -- Mobile Agent Algorithms Versus Message Passing Algorithms -- Incremental Construction of k-Dominating Sets in Wireless Sensor Networks -- Of Malicious Motes and Suspicious Sensors: On the Efficiency of Malicious Interference in Wireless Networks -- Empire of Colonies Self-stabilizing and Self-organizing Distributed Algorithms -- Glance: A Lightweight Querying Service for Wireless Sensor Networks -- On Many-to-Many Communication in Packet Radio Networks -- Robust Random Number Generation for Peer-to-Peer Systems -- About the Lifespan of Peer to Peer Networks -- Incentive-Based Robust Reputation Mechanism for P2P Services -- Searching for Black-Hole Faults in a Network Using Multiple Agents -- Gathering Asynchronous Mobile Robots with Inaccurate Compasses -- Gathering Few Fat Mobile Robots in the Plane -- Hop Chains: Secure Routing and the Establishment of Distinct Identities -- Computing on a Partially Eponymous Ring -- Self-stabilizing Leader Election in Networks of Finite-State Anonymous Agents -- Robust Self-stabilizing Clustering Algorithm -- Self-stabilizing Wireless Connected Overlays. |
| Altri titoli varianti | OPODIS 2006 |
| Record Nr. | UNINA-9910483183703321 |
| Berlin ; ; New York, : Springer, 2006 | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Structural information and communication complexity : 15th international colloquium, SIRCCO 2008, Villars-sur-Ollon, Switzerland, June 17-20, 2008 : proceedings / / Alexander A. Shvartsman, Pascal Felber (eds.)
| Structural information and communication complexity : 15th international colloquium, SIRCCO 2008, Villars-sur-Ollon, Switzerland, June 17-20, 2008 : proceedings / / Alexander A. Shvartsman, Pascal Felber (eds.) |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin, : Springer, 2008 |
| Descrizione fisica | 1 online resource (X, 310 p.) |
| Disciplina | 004.6 |
| Altri autori (Persone) |
ShvartsmanAlexander A
FelberPascal |
| Collana |
Lecture notes in computer science
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
| Soggetto topico |
Electronic data processing - Distributed processing
Computer algorithms Computer networks |
| ISBN | 3-540-69355-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Mobile Entities Computing: Models and Problems -- Reputation, Trust and Recommendation Systems in Peer-to-Peer Systems -- Regular Papers -- Gathering Problem of Two Asynchronous Mobile Robots with Semi-dynamic Compasses -- Locating and Repairing Faults in a Network with Mobile Agents -- Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots -- Average Binary Long-Lived Consensus: Quantifying the Stabilizing Role Played by Memory -- Distributed Approximation Algorithm for Resource Clustering -- Sharpness: A Tight Condition for Scalability -- Discovery of Network Properties with All-Shortest-Paths Queries -- Recovering the Long-Range Links in Augmented Graphs -- Computing Frequent Elements Using Gossip -- Maintaining Consistent Transactional States without a Global Clock -- Equal-Area Locus-Based Convex Polygon Decomposition -- On the Power of Local Orientations -- Best Effort and Priority Queuing Policies for Buffered Crossbar Switches -- Word of Mouth: Rumor Dissemination in Social Networks -- Non-preemptive Coordination Mechanisms for Identical Machine Scheduling Games -- Computing Approximate Nash Equilibria in Network Congestion Games -- On the Performance of Beauquier and Debas’ Self-stabilizing Algorithm for Mutual Exclusion -- Self-stabilizing Cuts in Synchronous Networks -- Quiescence of Self-stabilizing Gossiping among Mobile Agents in Graphs -- Gathering with Minimum Delay in Tree Sensor Networks -- Centralized Communication in Radio Networks with Strong Interference -- Fast Radio Broadcasting with Advice. |
| Altri titoli varianti | SIROCCO 2008 |
| Record Nr. | UNINA-9910484022803321 |
| Berlin, : Springer, 2008 | ||
| Lo trovi qui: Univ. Federico II | ||
| ||