Are wait-free algorithms fast?

This publication has 16 references indexed in Scilit:

• Asynchronous PRAMs are (almost) as good as synchronous PRAMs
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• Fast randomized consensus using shared memory
  Journal of Algorithms, 1990
• Sharing memory robustly in message-passing systems
  Published by Association for Computing Machinery (ACM) ,1990
• Efficient robust parallel computations
  Published by Association for Computing Machinery (ACM) ,1990
• On interprocess communication
  Distributed Computing, 1986
• Impossibility of distributed consensus with one faulty process
  Journal of the ACM, 1985
• Hints for computer system design
  Published by Association for Computing Machinery (ACM) ,1983
• On describing the behavior and implementation of distributed systems
  Theoretical Computer Science, 1981
• Economical solutions for the critical section problem in a distributed system (Extended Abstract)
  Published by Association for Computing Machinery (ACM) ,1977
• The synchronization of independent processes
  Acta Informatica, 1976