Memory ordering

Memory ordering describes the order of accesses to computer memory by a CPU. The term can refer either to the memory ordering generated by the… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1995-2018
024619952018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
GPU programming models such as CUDA and OpenCL are starting to adopt a weaker data-race-free (DRF-0) memory model, which does not… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2014
Highly Cited
2014
Emerging byte-addressable, non-volatile memory technologies offer performance within an order of magnitude of DRAM, prompting… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2011
2011
We propose and document a new concurrent programming model, relativistic programming. This model allows readers to run… (More)
Is this relevant?
Highly Cited
2010
Highly Cited
2010
We address the verification problem of finite-state concurrent programs running under weak memory models. These models capture… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2009
Highly Cited
2009
A multiprocessor's memory consistency model imposes ordering constraints among loads, stores, atomic operations, and memory… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2009
2009
Most research into high-performance software transactional memory (STM) assumes that transactions will run on a processor with a… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 4
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Concurrency libraries can facilitate the development of multi-threaded programs by providing concurrent implementations of… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2006
2006
Conventional relaxed memory ordering techniques follow a proactive model: at a synchronization point, a processor makes its own… (More)
  • table 1
  • figure 3
  • figure 1
  • figure 4
  • figure 2
Is this relevant?
2005
2005
Memory accesses are among the slowest of a CPU’s operations, due to the fact that Moore’s law has increased CPU instruction… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Conventional out-of-order processors employ a multi-ported,fully-associative load queue to guarantee correctmemory reference… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
  • figure 3
Is this relevant?