Amanote Research

Amanote Research

    RegisterSign In

Mechanisms for Store-Wait-Free Multiprocessors

doi 10.1145/1250662.1250696
Full Text
Open PDF
Abstract

Available in full text

Date

January 1, 2007

Authors
Thomas F. WenischAnastasia AilamakiBabak FalsafiAndreas Moshovos
Publisher

ACM Press


Related search

Mechanisms for Store-Wait-Free Multiprocessors

ACM SIGARCH Computer Architecture News
2007English

Dynamic Incentives in Wait List Mechanisms

AEA Papers and Proceedings
2018English

Fault-Tolerant Wait-Free Shared Objects

Journal of the ACM
ControlSystems EngineeringInformation SystemsHardwareArchitectureArtificial IntelligenceSoftware
1998English

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

Wait-Free Consensus With Infinite Arrivals

2002English

Adaptive Mechanisms and Policies for Managing Cache Hierarchies in Chip Multiprocessors

2005English

Wait-Free Programming for General Purpose Computations on Graphics Processors

IEEE Transactions on Computers
HardwareArchitectureMathematicsComputational TheoryTheoretical Computer ScienceSoftware
2017English

A Lower Bound on Wait-Free Counting

Journal of Algorithms
1997English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy