Sciweavers

    7 search results - page 2 / 2
    » Tight bounds for asynchronous randomized consensus
    Sort
    View
    PODC
    2004
    ACM
    103views Distributed And Parallel Com...» more  PODC 2004»
    Byzantine disk paxos: optimal resilience with byzantine shared memory
    13 years 10 months ago
    Byzantine disk paxos: optimal resilience with byzantine shared memory
    Download  webee.technion.ac.il
    We present Byzantine Disk Paxos, an asynchronous shared-memory consensus algorithm that uses a collection of n > 3t disks, t of which may fail by becoming non-responsive or arb...
    Ittai Abraham, Gregory Chockler, Idit Keidar, Dahl...
    claim paper
    Read More »
    ISTCS
    1992
    Springer
    115views Applied Computing» more  ISTCS 1992»
    Concurrent Timestamping Made Simple
    13 years 8 months ago
    Concurrent Timestamping Made Simple
    Download  groups.csail.mit.edu
    Concurrent Time-stamp Systems (ctss) allow processes to temporally order concurrent events in an asynchronous shared memorysystem, a powerful tool for concurrency control, serving...
    Rainer Gawlick, Nancy A. Lynch, Nir Shavit
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.