Tags
Language
Tags
<<
May 2024
Su Mo Tu We Th Fr Sa
28 29 30 1 2 3 4
5 6 7 8 9 10 11
12 13 14 15 16 17 18
19 20 21 22 23 24 25
26 27 28 29 30 31 1
  1. Home
  2. eBooks & eLearning
  3. Computing Theory

Impossibility Results for Distributed Computing

Posted By: AvaxGenius
Date: 28 Oct 2022 15:12:03
Impossibility Results for Distributed Computing

Impossibility Results for Distributed Computing by Hagit Attiya
English | PDF(True) | 2014 | 162 Pages | ISBN : 1627051708 | 1 MB

To understand the power of distributed systems, it is necessary to understand their inherent limitations: what problems cannot be solved in particular systems, or without sufficient resources (such as time or space). This book presents key techniques for proving such impossibility results and applies them to a variety of different problems in a variety of different system models. Insights gained from these results are highlighted, aspects of a problem that make it difficult are isolated, features of an architecture that make it inadequate for solving certain problems efficiently are identified, and different system models are compared.
Details

Quorum Systems: With Applications to Storage and Consensus

Posted By: AvaxGenius
Date: 28 Oct 2022 15:07:40
Quorum Systems: With Applications to Storage and Consensus

Quorum Systems: With Applications to Storage and Consensus by Marko Vukolić
English | PDF(True) | 2012 | 148 Pages | ISBN : 1608456838 | 1.46 MB

A quorum system is a collection of subsets of nodes, called quorums, with the property that each pair of quorums have a non-empty intersection. Quorum systems are the key mathematical abstraction for ensuring consistency in fault-tolerant and highly available distributed computing. Critical for many applications since the early days of distributed computing, quorum systems have evolved from simple majorities of a set of processes to complex hierarchical collections of sets, tailored for general adversarial structures. The initial non-empty intersection property has been refined many times to account for, e.g., stronger (Byzantine) adversarial model, latency considerations or better availability. This monograph is an overview of the evolution and refinement of quorum systems, with emphasis on their role in two fundamental applications: distributed read/write storage and consensus.
Details

Distributed Graph Coloring: Fundamentals and Recent Developments

Posted By: AvaxGenius
Date: 28 Oct 2022 15:04:52
Distributed Graph Coloring: Fundamentals and Recent Developments

Distributed Graph Coloring: Fundamentals and Recent Developments by Leonid Barenboim
English | PDF(True) | 2013 | 173 Pages | ISBN : 1627050183 | 1.41 MB

The focus of this monograph is on symmetry breaking problems in the message-passing model of distributed computing. In this model a communication network is represented by a n-vertex graph G = (V,E), whose vertices host autonomous processors. The processors communicate over the edges of G in discrete rounds. The goal is to devise algorithms that use as few rounds as possible.
Details

Link Reversal Algorithms

Posted By: AvaxGenius
Date: 25 Oct 2022 17:59:56
Link Reversal Algorithms

Link Reversal Algorithms by Jennifer L. Welch
English | PDF(True) | 2011 | 105 Pages | ISBN : 1608450414 | 0.7 MB

Link reversal is a versatile algorithm design technique that has been used in numerous distributed algorithms for a variety of problems. The common thread in these algorithms is that the distributed system is viewed as a graph, with vertices representing the computing nodes and edges representing some other feature of the system (for instance, point-to-point communication channels or a conflict relationship). Each algorithm assigns a virtual direction to the edges of the graph, producing a directed version of the original graph. As the algorithm proceeds, the virtual directions of some of the links in the graph change in order to accomplish some algorithm-specific goal. The criterion for changing link directions is based on information that is local to a node (such as the node having no outgoing links) and thus this approach scales well, a feature that is desirable for distributed algorithms.
Details
UPWARDS