Concurrency libraries can facilitate the development of multi-threaded programs by
providing concurrent implementations of familiar data types such as queues or sets. There …

We addresses the problem of automatic verification and fence inference in concurrent
programs running under relaxed memory models. Modern architectures implement relaxed …

Store misses cause significant delays in shared-memory multiprocessors because of limited
store buffering and ordering constraints required for proper synchronization. Today …

A multiprocessor's memory consistency model imposes ordering constraints among loads,
stores, atomic operations, and memory fences. Even for consistency models that relax …

Providing deterministic execution significantly simplifies the debugging, testing, replication,
and deployment of multithreaded programs. Recent work has developed deterministic …

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 …

Several recent efforts aim to simplify coherence and its associate costs (eg, directory size,
complexity) in multicores. The bulk of these efforts rely on program data-race-free (DRF) …

Many multithreaded programs employ concurrent data types to safely share data among
threads. However, highly-concurrent algorithms for even seemingly simple data types are …

Current approaches to script identification rely on hand-selected features and often require
processing a significant part of the document to achieve reliable identification. We present …

We observe that fence instructions used by programmers are usually only intended to order
memory accesses within a limited scope. Based on this observation, we propose the …