menu
{ "item_title" : "Quorum Systems", "item_author" : [" Marko Vukolic "], "item_description" : "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. Table of Contents: Introduction / Preliminaries / Classical Quorum Systems / Classical Quorum-Based Emulations / Byzantine Quorum Systems / Latency-efficient Quorum Systems / Probabilistic Quorum Systems", "item_img_path" : "https://covers4.booksamillion.com/covers/bam/3/03/100/879/3031008790_b.jpg", "price_data" : { "retail_price" : "37.99", "online_price" : "37.99", "our_price" : "37.99", "club_price" : "37.99", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
Quorum Systems|Marko Vukolic

Quorum Systems : With Applications to Storage and Consensus

local_shippingShip to Me
In Stock.
FREE Shipping for Club Members help

Overview

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. Table of Contents: Introduction / Preliminaries / Classical Quorum Systems / Classical Quorum-Based Emulations / Byzantine Quorum Systems / Latency-efficient Quorum Systems / Probabilistic Quorum Systems

This item is Non-Returnable

Details

  • ISBN-13: 9783031008795
  • ISBN-10: 3031008790
  • Publisher: Springer
  • Publish Date: January 2012
  • Dimensions: 9.25 x 7.5 x 0.32 inches
  • Shipping Weight: 0.59 pounds
  • Page Count: 130

Related Categories

You May Also Like...

    1

BAM Customer Reviews