Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Data races are among the most difficult software bugs to discover. They arise from multiple threads accessing the same memory… 
2009
2009
A. H. Criss and R. M. Shiffrin (2004) argued against the composite context noise explanation of recognition memory introduced by… 
2008
2008
In this paper, we evaluate the effects of a partitioned global address space (PGAS) versus aflat, randomized distributed global… 
2007
2007
Summary of Memory Ordering When it comes to how memory ordering works on dif-ferent CPUs, there is good news and bad news.The bad… 
2006
2006
Conventional relaxed memory ordering techniques follow a proactive model: at a synchronization point, a processor makes its own… 
2006
2006
Summary. Using the system architects’ specified memory ordering as a function of execution, a multiprocessing system can be veri… 
2005
2005
A medical timer apparatus being suitable for use with both integral and non-integral medication containers, and having a… 
2004
2004
A store queue (SQ) is a critical component of the load execution machinery. High ILP processors require high load execution…