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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1984-2018
02419842018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Recent advances in Symbolic Dynamic Programming (SDP) combined with the extended algebraic decision diagram (XADD) have provided… (More)
  • figure 1
  • figure 2
  • figure 4
  • table 1
  • figure 3
Is this relevant?
2013
2013
Recent advances in symbolic dynamic programming (SDP) combined with the extended algebraic decision diagram (XADD) data structure… (More)
Is this relevant?
2013
2013
Conventional wisdom in designing concurrent data structures is to use the most powerful synchronization primitive, namely compare… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2012
2012
Probabilistic reasoning in the real-world often requires inference in continuous variable graphical models, yet there are few… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2012
2012
Qa := ∫ Qa ⊗ P (xj|b,b ′,x, a,y) dxj [Symbolic Substitution] For all bi in Qa Qa := [ Qa ⊗ P (bi|b,x, a,y) ] |b′i=1 ⊕ [ Qa ⊗ P… (More)
Is this relevant?
2011
2011
In this thesis we design algorithms for three problems: snapshot, consensus, and fetch-and-add modulo k. Our solutions for… (More)
  • figure 1
  • figure 4
Is this relevant?
2011
2011
Many real-world decision-theoretic planning problems can be naturally modeled with discrete and continuous state Markov decision… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
1991
1991
The fetch-and-add (F&A) operation has been used effectively in a number of pr-occss coordination algorithms. In dris paper we… (More)
  • figure 3
  • figure 4
Is this relevant?
1988
1988
An efficient fetch-and-op circuit is described. A bit-serial circuit-switched implementation requires only 5 gates per node in a… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • figure 5
Is this relevant?
Highly Cited
1988
Highly Cited
1988
A wait-free implementation of a concurrent data object is one that guarantees that any process can complete any operation in a… (More)
  • figure 1-1
  • figure 2
  • figure 2-3
  • figure 4-3
  • figure 4-4
Is this relevant?