Skip to search formSkip to main contentSkip to account menu

Fetch-and-add

Known as: Fetch and add, Fetch-and-increment, XADD 
In computer science, the fetch-and-add CPU instruction that atomically modifies the contents of a memory location. That is, fetch-and-add performs… 
Wikipedia (opens in a new tab)

Related topics

Related topics

31 relations
Application binary interfaceAtomicity (database systems)C++11Central processing unit

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Brief Announcement: Towards Reduced Instruction Sets for Synchronization
Contrary to common belief, a recent work by Ellen, Gelashvili, Shavit, and Zhu has shown that computability does not require… 
2011
2011
Efficient loop-level parallelism in Ada
Parallelism in scientific applications can most often be found at the loop level. Although Ada supports parallelism via the task… 
2007
2007
A generic local-spin fetch-and-phi-based mutual exclusion algorithm
2006
2006
"MAMA!": a memory allocator for multithreaded architectures
While the high-performance computing world is dominated by distributed memory computer systems, applications that require random… 
2003
2003
Local-spin mutual exclusion using fetch-and-/spl phi/ primitives
We present a generic fetch-and-/spl phi/-based local-spin mutual exclusion algorithm with O(1) time complexity under the RMR… 
1997
1997
Reactive Diiracting Trees
A shared counter is a concurrent object that provides a fetch-and-increment operation in a distributed system. Recently… 
Review
1995
Review
1995
Parallel Loop Scheduling for High Performance Computers
1995
1995
Fetch Some Soupmeat
Review
1988
Review
1988
Operating system data structures for shared memory MIMD machines with fetch-and-add
Ideally, procedures and data structures on a shared-memory MIMD machine should be serialization-free and concurrently accessible… 
Review
1988
Review
1988
Comparing shared and distributed memory computers
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)