Using Elimination and Delegation to Implement a Scalable {NUMA-Friendly} Stack
Emerging cache-coherent non-uniform memory access (cc-NUMA) architectures provide
cache coherence across hundreds of cores. These architectures change how applications …
cache coherence across hundreds of cores. These architectures change how applications …
Sandboxing transactional memory
L Dalessandro, ML Scott - … of the 21st international conference on …, 2012 - dl.acm.org
Correct transactional memory systems (TMs) must address the possibility that a speculative
transaction may read mutually inconsistent values from memory and then perform an …
transaction may read mutually inconsistent values from memory and then perform an …
SystemC-VHDL co-simulation and synthesis in the HW domain
M Bombana, F Bruschi - 2003 Design, Automation and Test in …, 2003 - ieeexplore.ieee.org
Embedded systems design requires the development of complex HW modules to cope with
the most stringent timing constraints of the specifications. This implies the need to update …
the most stringent timing constraints of the specifications. This implies the need to update …
Remote invalidation: Optimizing the critical path of memory transactions
A Hassan, R Palmieri… - 2014 IEEE 28th …, 2014 - ieeexplore.ieee.org
Software Transactional Memory (STM) systems are increasingly emerging as a promising
alternative to traditional locking algorithms for implementing generic concurrent applications …
alternative to traditional locking algorithms for implementing generic concurrent applications …
[PDF][PDF] Transactional Semantics with Zombies
ML Scott - Invited keynote address, 6th Wkshp. on the …, 2014 - anon.cs.rochester.edu
Different formal models of transactional memory are required at different levels of the system
stack. This paper focuses on the run-time level, where the semantics of individual operations …
stack. This paper focuses on the run-time level, where the semantics of individual operations …
Parv: Parallelizing runtime detection and prevention of concurrency errors
We present the PaRV tool for runtime detection of and recovery from data races in multi-
threaded C and C++ programs. PaRV uses transactional memory technology for …
threaded C and C++ programs. PaRV uses transactional memory technology for …
TRADE: Precise dynamic race detection for scalable transactional memory systems
As other multithreaded programs, transactional memory (TM) programs are prone to race
conditions. Previous work focuses on extending existing definitions of data race for lock …
conditions. Previous work focuses on extending existing definitions of data race for lock …
[PDF][PDF] On justifying and verifying relaxed detection of conflicts in concurrent programs
Transactional Memory (TM) simplifies concurrent programming by providing atomic,
compositional blocks within which programmers can reason sequentially. Many transactions …
compositional blocks within which programmers can reason sequentially. Many transactions …
Remote transaction commit: Centralizing software transactional memory commits
A Hassan, R Palmieri… - IEEE Transactions on …, 2015 - ieeexplore.ieee.org
Software Transactional Memory (STM) has recently emerged as a promising
synchronization abstraction for multicore architectures. State-of-the-art STM algorithms …
synchronization abstraction for multicore architectures. State-of-the-art STM algorithms …
Efficient runtime systems for speculative parallelization
C Hammacher - 2017 - publikationen.sulb.uni-saarland.de
Manual parallelization is time consuming and error-prone. Automatic parallelization on the
other hand is often unable to extract substantial parallelism. Using speculation, however …
other hand is often unable to extract substantial parallelism. Using speculation, however …