Among the various memory consistency models, the sequential consistency (SC) model, in
which memory operations appear to take place in the order specified by the program, is the …

Although fences are designed for low-overhead concurrency coordination, they can be
expensive in current machines. If fences were largely free, faster fine-grained concurrent …

Past work has focused on detecting data races as proxies for Sequential Consistency (SC)
violations. However, most data races do not violate SC. In addition, lock-free data structures …

Sequential Consistency (SC) is the most intuitive memory model, and SC Violations (SCVs)
produce unintuitive, typically incorrect executions. Most prior SCV detection schemes have …

Many modern multicore architectures support shared memory for ease of programming and
relaxed memory models to deliver high performance. With relaxed memory models, memory …

There have been several recent efforts to improve the performance of fences. The most
aggressive designs allow post-fence accesses to retire and complete before the fence …

Sequential Consistency (SC) is the most intuitive memory model for parallel programs.
However, modern architectures aggressively reorder and overlap memory accesses …

With the ubiquitous availability of parallel architectures, the burden falls on programmers'
shoulders to write correct parallel programs that have high performance and portability …

Modern many-core architectures such as GPUs aggressively reorder and buffer memory
accesses. Updates to shared and global data are not guaranteed to be visible to concurrent …

Efficient routing in large-scale P2P applications over mobile networks is a challenge. Such
networks are formed by clusters of nodes, representing a community of interest, joining with …