Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 11 - 20
of
692
Taxonomy for Transactional Memory Systems
"... Abstract-The emergence of multi-core systems has given rise to the need of developing multi-threaded applications. To ensure synchronization between concurrent operations lock based mechanisms are used. Nevertheless, conventional lock based synchronization techniques lead to problems such as deadloc ..."
Abstract
- Add to MetaCart
Abstract-The emergence of multi-core systems has given rise to the need of developing multi-threaded applications. To ensure synchronization between concurrent operations lock based mechanisms are used. Nevertheless, conventional lock based synchronization techniques lead to problems
Conditional must not aliasing for static race detection
- In POPL
, 2007
"... Abstract Race detection algorithms for multi-threaded programs using thecommon lock-based synchronization idiom must correlate locks with the memory locations they guard. The heart of a proof ofrace freedom is showing that if two locks are distinct, then the memory locations they guard are also dist ..."
Abstract
-
Cited by 102 (4 self)
- Add to MetaCart
Abstract Race detection algorithms for multi-threaded programs using thecommon lock-based synchronization idiom must correlate locks with the memory locations they guard. The heart of a proof ofrace freedom is showing that if two locks are distinct, then the memory locations they guard are also
A hardware/software framework for supporting transactional memory in a mpsoc environment
- SIGARCH Comput. Archit. News
"... Manufacturers are focusing on multiprocessorsystem-on-a-chip (MPSoC) architectures in order to provide increased concurrency, rather than increased clock speed, for both large-scale as well as embedded systems. Traditionally lock-based synchronization is provided to support concurrency; however, man ..."
Abstract
-
Cited by 9 (3 self)
- Add to MetaCart
Manufacturers are focusing on multiprocessorsystem-on-a-chip (MPSoC) architectures in order to provide increased concurrency, rather than increased clock speed, for both large-scale as well as embedded systems. Traditionally lock-based synchronization is provided to support concurrency; however
Why The Grass May Not Be Greener On The Other Side: A Comparison of Locking vs. Transactional Memory
- In Proc. of the 4th ACM SIGOPS Workshop on Programming Languages and Operating Systems
, 2007
"... The advent of multi-core and multi-threaded processor architectures highlights the need to address the well-known shortcomings of the ubiquitous lock-based synchronization mechanisms. To this end, transactional memory has been viewed by many as a promising alternative to locking. This paper therefor ..."
Abstract
-
Cited by 10 (4 self)
- Add to MetaCart
The advent of multi-core and multi-threaded processor architectures highlights the need to address the well-known shortcomings of the ubiquitous lock-based synchronization mechanisms. To this end, transactional memory has been viewed by many as a promising alternative to locking. This paper
McRT-STM: a High Performance Software Transactional Memory System for a Multi-Core Runtime
- In Proc. of the 11th ACM Symp. on Principles and Practice of Parallel Programming
, 2006
"... Applications need to become more concurrent to take advantage of the increased computational power provided by chip level multiprocessing. Programmers have traditionally managed this concurrency using locks (mutex based synchronization). Unfortunately, lock based synchronization often leads to deadl ..."
Abstract
-
Cited by 241 (14 self)
- Add to MetaCart
Applications need to become more concurrent to take advantage of the increased computational power provided by chip level multiprocessing. Programmers have traditionally managed this concurrency using locks (mutex based synchronization). Unfortunately, lock based synchronization often leads
Compiler and Runtime Support for Efficient Software Transactional Memory
, 2006
"... Programmers have traditionally used locks to synchronize concurrent access to shared data. Lock-based synchronization, however, has well-known pitfalls: using locks for fine-grain synchronization and composing code that already uses locks are both difficult and prone to deadlock. Transactional memor ..."
Abstract
-
Cited by 159 (10 self)
- Add to MetaCart
Programmers have traditionally used locks to synchronize concurrent access to shared data. Lock-based synchronization, however, has well-known pitfalls: using locks for fine-grain synchronization and composing code that already uses locks are both difficult and prone to deadlock. Transactional
Hybrid transactional memory to accelerate safe lock-based transactions
- WORKSHOP ON TRANSACTIONAL COMPUTING (TRANSACT 2008)
, 2008
"... To reduce the overhead of Software Transactional Memory (STM) there are many recent proposals to build hybrid systems that use architectural support either to accelerate parts of a particular STM algorithm (Ha-TM), or to form a hybrid system allowing hardwaretransactions and software-transactions to ..."
Abstract
-
Cited by 6 (1 self)
- Add to MetaCart
-transactions to inter-operate in the same address space (Hy-TM). In this paper we introduce a Hy-TM design based on multi-reader, single-writer locking when a transaction tries to commit. This approach is the first Hy-TM to combine three desirable features: (i) execution whether or not the architectural support
Transactions for Software Model Checking Abstract
"... This paper presents a software model checking algorithm that combats state explosion by decomposing each thread’s execution into a sequence of transactions that execute atomically. Our algorithm infers transactions using the theory of reduction, and supports both left and right movers, thus yielding ..."
Abstract
- Add to MetaCart
yielding larger transactions and fewer context switches than previous methods. Our approach uses access predicates to support a wide variety of synchronization mechanisms. In addition, we automatically infer these predicates for programs that use lock-based synchronization.
Configurable Transactional Memory
, 2007
"... Programming efficiency of heterogeneous concurrent systems is limited by the use of lock-based synchronization mechanisms. Transactional memories can greatly improve the programming efficiency of such systems. In fieldprogrammable computing machines, a conventional fixed transactional memory becomes ..."
Abstract
-
Cited by 9 (0 self)
- Add to MetaCart
Programming efficiency of heterogeneous concurrent systems is limited by the use of lock-based synchronization mechanisms. Transactional memories can greatly improve the programming efficiency of such systems. In fieldprogrammable computing machines, a conventional fixed transactional memory
Transactions for software model checking
- In Proceedings of the Workshop on Software Model Checking
, 2003
"... Abstract This paper presents a software model checking algorithm that combats state explosion by decomposing each thread's execution into a sequence of transactions that execute atomically. Our algorithm infers transactions using the theory of reduction, and supports both left and right movers, ..."
Abstract
-
Cited by 19 (8 self)
- Add to MetaCart
, thus yielding larger transactions and fewer context switches than previous methods. Our approach uses access predicates to support a wide variety of synchronization mechanisms. In addition, we automatically infer these predicates for programs that use lock-based synchronization.
Results 11 - 20
of
692
