Amanote Research

Amanote Research

    RegisterSign In

The Weakest Failure Detector for Wait-Free Dining Under Eventual Weak Exclusion

doi 10.1145/1583991.1584021
Full Text
Open PDF
Abstract

Available in full text

Date

January 1, 2009

Authors
Srikanth SastryScott M. PikeJennifer L. Welch
Publisher

ACM Press


Related search

On the Weakest Failure Detector Ever

Distributed Computing
Computer NetworksHardwareCommunicationsArchitectureComputational TheoryMathematicsTheoretical Computer Science
2009English

Revisiting the Weakest Failure Detector for Uniform Reliable Broadcast

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1999English

Mechanisms for Store-Wait-Free Multiprocessors

ACM SIGARCH Computer Architecture News
2007English

Mechanisms for Store-Wait-Free Multiprocessors

2007English

Early Consensus in an Asynchronous System With a Weak Failure Detector

Distributed Computing
Computer NetworksHardwareCommunicationsArchitectureComputational TheoryMathematicsTheoretical Computer Science
1997English

Fault-Tolerant Wait-Free Shared Objects

Journal of the ACM
ControlSystems EngineeringInformation SystemsHardwareArchitectureArtificial IntelligenceSoftware
1998English

Evidence of Weak Conscious Experiences in the Exclusion Task

Frontiers in Psychology
Psychology
2014English

Wait-Free Handshaking Using Rainbow Colouring

Computer Journal
Computer Science
2000English

Wait-Free Shared-Memory Irradiance Caching

IEEE Computer Graphics and Applications
Computer GraphicsComputer-Aided DesignSoftware
2011English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy