Sciweavers

    SPAA
    2009
    ACM
    132views Distributed And Parallel Com...» more  SPAA 2009»
    The weakest failure detector for wait-free dining under eventual weak exclusion
    16 years 3 months ago
    The weakest failure detector for wait-free dining under eventual weak exclusion
    Download  srikanth.sastry.name
    Dining philosophers is a classic scheduling problem for local mutual exclusion on arbitrary conflict graphs. We establish necessary conditions to solve wait-free dining under even...
    Srikanth Sastry, Scott M. Pike, Jennifer L. Welch
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.