Results 1 - 10 of 119

Truly Non-blocking Writes

by Luis Useche, Ricardo Koller, Raju Rangaswami, Akshat Verma
"... Writing data within user or operating system memory often encounters the classic read-before-write problem whereby the page written to must first be read from the backing store, effectively blocking the writing process before modifications are made. Unfortunately, the large gap between memory and st ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
Writing data within user or operating system memory often encounters the classic read-before-write problem whereby the page written to must first be read from the backing store, effectively blocking the writing process before modifications are made. Unfortunately, the large gap between memory

An Efficient Non-Blocking Data Cache for Soft Processors

by Kaveh Aasaraai, Andreas Moshovos
"... Abstract—Soft processors often use data caches to reduce the gap between processor and main memory speeds. To achieve high efficiency, simple, blocking caches are used. Such caches are not appropriate for processor designs such as runahead and out-of-order execution that require non-blocking caches ..."
Abstract - Cited by 3 (1 self) - Add to MetaCart
Abstract—Soft processors often use data caches to reduce the gap between processor and main memory speeds. To achieve high efficiency, simple, blocking caches are used. Such caches are not appropriate for processor designs such as runahead and out-of-order execution that require non-blocking caches

Efficient Nonblocking Software Transactional Memory

by Virendra J. Marathe, Mark Moir
"... The current state of the art seems to favour blocking software transactional memory (STM) implementations over nonblocking ones, and a common belief is that nonblocking STMs fundamentally cannot be made to perform as well as blocking ones. But this belief is based on experience, intuition, and anecd ..."
Abstract - Cited by 4 (2 self) - Add to MetaCart
right, as well as to inform research aimed at determining whether a fundamental gap exists between blocking and nonblocking STMs. We describe a novel nonblocking copyback mechanism for a word-based software transactional memory (STM), which closely follows simple and efficient blocking mechanisms

Semantics of transactional memory and automatic mutual exclusion

by Martín Abadi, Andrew Birrell, Tim Harris, Michael Isard - In Proceedings of the 35th ACM SIGPLANSIGACT Symposium on Principles of Programming Languages (POPL , 2008
"... Software Transactional Memory (STM) is an attractive basis for the development of language features for concurrent programming. However, the semantics of these features can be delicate and problematic. In this paper we explore the tradeoffs between semantic simplicity, the viability of efficient imp ..."
Abstract - Cited by 88 (6 self) - Add to MetaCart
Software Transactional Memory (STM) is an attractive basis for the development of language features for concurrent programming. However, the semantics of these features can be delicate and problematic. In this paper we explore the tradeoffs between semantic simplicity, the viability of efficient

An effective hybrid transactional memory system with strong isolation guarantees

by Chi Cao Minh, Martin Trautmann, Jaewoong Chung, Austen Mcdonald, Nathan Bronson, Jared Casper, Christos Kozyrakis, Kunle Olukotun - In ISCA , 2007
"... We propose signature-accelerated transactional memory (SigTM), a hybrid TM system that reduces the overhead of software transactions. SigTM uses hardware signatures to track the read-set and write-set for pending transactions and perform conflict detection between concurrent threads. All other trans ..."
Abstract - Cited by 89 (7 self) - Add to MetaCart
the first hybrid TM system to provide strong isolation guarantees between transactional blocks and nontransactional accesses without additional read and write barriers in non-transactional code. Using a set of parallel programs that make frequent use of coarsegrain transactions, we show that Sig

Transparent Support for Wait-Free Transactions

by Mark Moir - In Proceedings of the 11th International Workshop on Distributed Algorithms , 1997
"... . This paper concerns software support for non-blocking transactions in shared-memory multiprocessors. We present mechanisms that convert sequential transactions into lock-free or wait-free ones. In contrast to some previous mechanisms, ours support transactions for which the set of memory locations ..."
Abstract - Cited by 57 (7 self) - Add to MetaCart
. This paper concerns software support for non-blocking transactions in shared-memory multiprocessors. We present mechanisms that convert sequential transactions into lock-free or wait-free ones. In contrast to some previous mechanisms, ours support transactions for which the set of memory

Schemes to Improve the Efficiency of Hardware Transactional Memory Systems

by M. M. Waliullah, M. M. Waliullah, M. M. Waliullah, Chalmers Reproservice, M. M. Waliullah
"... Thesis for the degree of Licentiate of Engineering, a Swedish degree between M.Sc. and Ph.D. In today’s ubiquitous multiprocessor environment parallel programming becomes an important tool to reap the maximum gain. But the traditional lock-based parallel programming model is not attracting average p ..."
Abstract - Add to MetaCart
transactional memory that promises to simplify parallel programming as well as to offer non-blocking synchronization. In transactional memory systems, critical sections are executed in transactions where

Transient Blocking Synchronization

by Nir Shavit, Ori Shalev, Nir Shavit , 2005
"... We introduce Transient Blocking Synchronization (TBS), a new approach to hardware synchronization for mega-scale distributed-memory multiprocessor machines. Such machines, with thousands of processors and controller based memory modules, are essentially distributed networks, and one must search for ..."
Abstract - Add to MetaCart
, and blocking ones such as Full/Empty-bits on the other, will introduce high communication and space costs when implemented on large scale machines. TBS is a novel hardware synchronization paradigm resting between the classic blocking and non-blocking approaches to synchronization. It is an example of how

D 2 STM: Dependable Distributed Software Transactional Memory ∗

by Maria Couceiro, Paolo Romano, Luis Rodrigues, Nuno Carvalho
"... Software Transactional Memory (STM) systems have emerged as a powerful paradigm to develop concurrent applications. At current date, however, the problem of how to build distributed and replicated STMs to enhance both dependability and performance is still largely unexplored. This paper fills this g ..."
Abstract - Cited by 10 (8 self) - Add to MetaCart
node, avoiding any replica inter-communication during transaction execution, and without incurring in deadlocks. Strong consistency is enforced at transaction commit time by a non-blocking distributed certification scheme, which we name BFC (Bloom Filter Certification). BFC exploits a novel Bloom

Atomic Quake: Using Transactional Memory in an Interactive Multiplayer Game Server

by Ferad Zyulkyarov, Vladimir Gajinov, Osman S. Unsal, Adrián Cristal, Eduard Ayguadé, Tim Harris, Mateo Valero
"... Transactional Memory (TM) is being studied widely as a new technique for synchronizing concurrent accesses to shared memory data structures for use in multi-core systems. Much of the initial work on TM has been evaluated using microbenchmarks and application kernels; it is not clear whether conclusi ..."
Abstract - Cited by 15 (3 self) - Add to MetaCart
it to use transactions. In doing so we have encountered examples where transactions simplify the structure of the program. We have also encountered cases where using transactions occludes the structure of the existing code. Compared with existing TM benchmarks, our workload exhibits non-block
Results 1 - 10 of 119