• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

DMCA

Tolerating latency in replicated state machines through client speculation

Cached

  • Download as a PDF

Download Links

  • [www.pmg.lcs.mit.edu]
  • [pmg.csail.mit.edu]
  • [people.csail.mit.edu]
  • [pmg.lcs.mit.edu]
  • [www.pmg.csail.mit.edu]
  • [lirone.lcs.mit.edu]
  • [www.thor.lcs.mit.edu]
  • [www.usenix.org]
  • [www.eecs.umich.edu]
  • [web.eecs.umich.edu]
  • [www.usenix.org]
  • [www.usenix.org]
  • [www.usenix.org]
  • [www.eecs.umich.edu]
  • [www.eecs.umich.edu]
  • [web.eecs.umich.edu]
  • [web.eecs.umich.edu]
  • [web.eecs.umich.edu]
  • [web.eecs.umich.edu]
  • [web.eecs.umich.edu]
  • [notrump.eecs.umich.edu]
  • [research.microsoft.com]
  • [research.microsoft.com]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Benjamin Wester , Peter M. Chen , James Cowling , Jason Flinn , Edmund B. Nightingale , Barbara Liskov
Citations:14 - 0 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Wester_toleratinglatency,
    author = {Benjamin Wester and Peter M. Chen and James Cowling and Jason Flinn and Edmund B. Nightingale and Barbara Liskov},
    title = {Tolerating latency in replicated state machines through client speculation},
    year = {}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

Replicated state machines are an important and widelystudied methodology for tolerating a wide range of faults. Unfortunately, while replicas should be distributed geographically for maximum fault tolerance, current replicated state machine protocols tend to magnify the effects of high network latencies caused by geographic distribution. In this paper, we examine how to use speculative execution at the clients of a replicated service to reduce the impact of network and protocol latency. We first give design principles for using client speculation with replicated services, such as generating early replies and prioritizing throughput over latency. We then describe a mechanism that allows speculative clients to make new requests through replica-resolved speculation and predicated writes. We implement a detailed case study that applies this approach to a standard Byzantine fault tolerant protocol (PBFT) for replicated NFS and counter services. Client speculation trades in 18 % maximum throughput to decrease the effective latency under light workloads, letting us speed up run time on singleclient micro-benchmarks 1.08–19 × when the client is co-located with the primary. On a macro-benchmark, reduced latency gives the client a speedup of up to 5×. 1

Keyphrases

client speculation    replicated state machine    replicated service    reduced latency    counter service    effective latency    speculative execution    protocol latency    wide range    state machine protocol    standard byzantine fault tolerant protocol    replica-resolved speculation    singleclient micro-benchmarks    speculative client    maximum throughput    new request    state machine    client speculation trade    maximum fault tolerance    design principle    geographic distribution    widelystudied methodology    run time    early reply    detailed case study    high network latency    light workload   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University