Sciweavers

    49 search results - page 1 / 10
    » An Omega (n log n) lower bound on the cost of mutual exclusi...
    Sort
    View
    PODC
    2006
    ACM
    93views Distributed And Parallel Com...» more  PODC 2006»
    An Omega (n log n) lower bound on the cost of mutual exclusion
    14 years 1 months ago
    An Omega (n log n) lower bound on the cost of mutual exclusion
    Download  dspace.mit.edu
    Rui Fan, Nancy A. Lynch
    claim paper
    Read More »
    PODC
    2009
    ACM
    107views Distributed and Parallel Com...» more  PODC 2009»
    Randomized mutual exclusion in O(log N / log log N) RMRs
    14 years 8 months ago
    Randomized mutual exclusion in O(log N / log log N) RMRs
    Download  www.cs.bgu.ac.il
    d Abstract] Danny Hendler Department of Computer-Science Ben-Gurion University hendlerd@cs.bgu.ac.il Philipp Woelfel Department of Computer-Science University of Calgary woelfel@cp...
    Danny Hendler, Philipp Woelfel
    claim paper
    Read More »
    PODC
    2010
    ACM
    165views Distributed and Parallel Com...» more  PODC 2010»
    Group mutual exclusion in O(log n) RMR
    13 years 11 months ago
    Group mutual exclusion in O(log n) RMR
    Download  www.mpi-inf.mpg.de
    We present an algorithm to solve the GROUP MUTUAL EXCLUSION problem in the cache-coherent (CC) model. For the same problem in the distributed shared memory (DSM) model, Danek and ...
    Vibhor Bhatt, Chien-Chung Huang
    claim paper
    Read More »
    DC
    2010
    152views Internet Technology» more  DC 2010»
    Closing the complexity gap between FCFS mutual exclusion and mutual exclusion
    13 years 2 months ago
    Closing the complexity gap between FCFS mutual exclusion and mutual exclusion
    Download  www.cs.toronto.edu
    First-Come-First-Served (FCFS) mutual exclusion (ME) is the problem of ensuring that processes attempting to concurrently access a shared resource do so one by one, in a fair order...
    Robert Danek, Wojciech M. Golab
    claim paper
    Read More »
    SIROCCO
    2008
    79views Information Technology» more  SIROCCO 2008»
    On the Performance of Beauquier and Debas' Self-stabilizing Algorithm for Mutual Exclusion
    13 years 9 months ago
    On the Performance of Beauquier and Debas' Self-stabilizing Algorithm for Mutual Exclusion
    Download  www.cs.technion.ac.il
    In [Dij74] Dijkstra introduced the notion of self-stabilizing algorithms and presented an algorithm with three states for the problem of mutual exclusion on a ring of processors. ...
    Viacheslav Chernoy, Mordechai Shalom, Shmuel Zaks
    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.