Filters








32,557 Hits in 4.5 sec

Transactional lock-free execution of lock-based programs

Ravi Rajwar, James R. Goodman
2002 Tenth international conference on architectural support for programming languages and operating systems on Proceedings of the 10th international conference on architectural support for programming languages and operating systems (ASPLOS-X) - ASPLOS '02  
We propose Transactional Lock Removal (TLR) and show how a program that uses lock-based synchronization can be executed by the hardware in a lock-free manner, even in the presence of conflicts, without  ...  We seek to improve multithreaded programming trade-offs by providing architectural support for optimistic lock-free execution.  ...  Acknowledgements We would like to especially thank Maurice Herlihy for extensive discussions regarding the ideas in the paper and comments on drafts of the paper.  ... 
doi:10.1145/605398.605399 fatcat:ktj45ddok5hubceeyp4f47e7vq

Transactional lock-free execution of lock-based programs

Ravi Rajwar, James R. Goodman
2002 ACM SIGOPS Operating Systems Review  
We propose Transactional Lock Removal (TLR) and show how a program that uses lock-based synchronization can be executed by the hardware in a lock-free manner, even in the presence of conflicts, without  ...  We seek to improve multithreaded programming trade-offs by providing architectural support for optimistic lock-free execution.  ...  Acknowledgements We would like to especially thank Maurice Herlihy for extensive discussions regarding the ideas in the paper and comments on drafts of the paper.  ... 
doi:10.1145/635508.605399 fatcat:tqajaw76mndoviogkdlctdeqpi

Transactional lock-free execution of lock-based programs

Ravi Rajwar, James R. Goodman
2002 SIGARCH Computer Architecture News  
We propose Transactional Lock Removal (TLR) and show how a program that uses lock-based synchronization can be executed by the hardware in a lock-free manner, even in the presence of conflicts, without  ...  We seek to improve multithreaded programming trade-offs by providing architectural support for optimistic lock-free execution.  ...  Acknowledgements We would like to especially thank Maurice Herlihy for extensive discussions regarding the ideas in the paper and comments on drafts of the paper.  ... 
doi:10.1145/635506.605399 fatcat:xuxd4t7vxzfvbf7pgt3phmghbi

Transactional lock-free execution of lock-based programs

Ravi Rajwar, James R. Goodman
2002 Tenth international conference on architectural support for programming languages and operating systems on Proceedings of the 10th international conference on architectural support for programming languages and operating systems (ASPLOS-X) - ASPLOS '02  
We propose Transactional Lock Removal (TLR) and show how a program that uses lock-based synchronization can be executed by the hardware in a lock-free manner, even in the presence of conflicts, without  ...  We seek to improve multithreaded programming trade-offs by providing architectural support for optimistic lock-free execution.  ...  Acknowledgements We would like to especially thank Maurice Herlihy for extensive discussions regarding the ideas in the paper and comments on drafts of the paper.  ... 
doi:10.1145/605397.605399 dblp:conf/asplos/RajwarG02 fatcat:xyehpp674ffxdolrqmqoox62em

Transactional lock-free execution of lock-based programs

Ravi Rajwar, James R. Goodman
2002 SIGPLAN notices  
We propose Transactional Lock Removal (TLR) and show how a program that uses lock-based synchronization can be executed by the hardware in a lock-free manner, even in the presence of conflicts, without  ...  We seek to improve multithreaded programming trade-offs by providing architectural support for optimistic lock-free execution.  ...  Acknowledgements We would like to especially thank Maurice Herlihy for extensive discussions regarding the ideas in the paper and comments on drafts of the paper.  ... 
doi:10.1145/605432.605399 fatcat:k7j2qiu2m5butopikgfmozuq5i

Transactional execution: toward reliable, high-performance multithreading

R. Rajwar, J. Goodman
2003 IEEE Micro  
TLR treats a lock-based critical section as a lock-free, optimistic transaction, using SLE to elide the lock, which in turn lets multiple threads enter a critical section protected by the same lock and  ...  As hardware support for shared-memory applications, we have proposed the use of Transactional Lock Removal (TLR), 1 which ensures high performance while simplifying error-free programming and providing  ...  I n the transactional execution scheme we propose, SLE provides the mechanism to extract a lock-free execution from a lock-based execution and guarantees such an execution in the absence of data conflicts  ... 
doi:10.1109/mm.2003.1261395 fatcat:xebtil52yvec3e6ffe6kw3smqe

Towards transactional memory semantics for C++

Tatiana Shpeisman, Ali-Reza Adl-Tabatabai, Robert Geva, Yang Ni, Adam Welc
2009 Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures - SPAA '09  
We show that lock-based semantics, such as Single Global Lock Atomicity (SLA) or Disjoint Lock Atomicity (DLA), do not actually guarantee atomicity for race-free programs and propose a new semantics, Race-Free  ...  Transactional memory (TM) eliminates many problems associated with lock-based synchronization.  ...  At the same time, lock-based semantics have been criticized for reducing the transactional semantics to that of lock-based synchronization [22, 32] .  ... 
doi:10.1145/1583991.1584012 dblp:conf/spaa/ShpeismanAGNW09 fatcat:pbyg2wgevbfofi5rgzku55bzha

STM: Lock-Free Synchronization

Ryan Saptarshi Ray
2014 International journal of computer and communication technology  
A programmer can reason about the correctness of code within a transaction and need not worry about complex interactions with other, concurrently executing parts of the program.  ...  It allows portions of a program to execute in isolation, without regard to other, concurrently executing tasks.  ...  TRANSACTIONAL MEMORY Transactional memory (TM) is an alternative paradigm to lock-based concurrent programming which does not suffer from the drawbacks of lock-based concurrent programming.  ... 
doi:10.47893/ijcct.2014.1245 fatcat:fcnqpwdlxbdbfdo5zgyqlrmwnu

Transactions as the Foundation of a Memory Consistency Model [chapter]

Luke Dalessandro, Michael L. Scott, Michael F. Spear
2010 Lecture Notes in Computer Science  
can allow the implementation of transaction-based locks to be as efficient as conventional locks.  ...  In an explicit analogy to the DRF 0 of Adve and Hill, we demonstrate that SS provides the appearance of transactional sequential consistency (TSC) for programs that are transactional data-race free (TDRF  ...  A program is said to be transactional data-race free (TDRF) if none of its TSC executions has a data race. It is easy to show that any execution of a TDRF program on an SS implementation will be TSC.  ... 
doi:10.1007/978-3-642-15763-9_4 fatcat:z4fqo7ovgvbr5ammnmxwk437ba

Single global lock semantics in a weakly atomic STM

Vijay Menon, Steven Balensiefer, Tatiana Shpeisman, Ali-Reza Adl-Tabatabai, Richard L. Hudson, Bratin Saha, Adam Welc
2008 SIGPLAN notices  
In contrast to database transactions, transaction memory (TM) semantics are complicated by the fact that programs may access the same memory locations both inside and outside transactions.  ...  As an alternative, many in the community have informally proposed that a single global lock semantics [16, 9] , where transaction semantics are mapped to those of regions protected by a single global lock  ...  [9] . 3 Intuitively, under DLA, any transactional execution has a semantically equivalent lock-based one where each transaction is protected by some minimal set of locks such that two transactions  ... 
doi:10.1145/1402227.1402235 fatcat:hqnarklutvhgvb3gkpajtqvm2i

A survey on optimizations towards best-effort hardware transactional memory

Zhenwei Wu, Kai Lu, Ruibo Wang, Wenzhe Zhang
2020 CCF Transactions on High Performance Computing  
The rapid development and wide adoption of transactional memory make this programming paradigm promising for achieving breakthroughs in massively parallel computing.  ...  There has been a large number of discussions towards transactional memory systems, which aimed at providing relatively simple and intuitive synchronization construction for shared-memory parallel programs  ...  This work is supported by National High-level Personnel for Defense Technology Program (2017-JCJQ-ZQ-013), NSF 61902405.  ... 
doi:10.1007/s42514-020-00049-2 fatcat:lf5s3agulfhpzgxcjgjk2msqfy

Practical weak-atomicity semantics for java stm

Vijay Menon, Steven Balensiefer, Tatiana Shpeisman, Ali-Reza Adl-Tabatabai, Richard L. Hudson, Bratin Saha, Adam Welc
2008 Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures - SPAA '08  
In contrast to database transactions, transaction memory (TM) semantics are complicated by the fact that programs may access the same memory locations both inside and outside transactions.  ...  As an alternative, many in the community have informally proposed that a single global lock semantics [18, 10] , where transaction semantics are mapped to those of regions protected by a single global  ...  If an execution has no data race on any location, it is a race-free execution. A program is considered data-race free if and only if every valid sequential consistent execution is data-race free.  ... 
doi:10.1145/1378533.1378588 dblp:conf/spaa/MenonBSAHSW08 fatcat:ilu7my5az5afhlainaabwvn2tu

Transactional Locking II [chapter]

Dave Dice, Ori Shalev, Nir Shavit
2006 Lecture Notes in Computer Science  
The transactional memory programming paradigm is gaining momentum as the approach of choice for replacing locks in concurrent programming.  ...  This paper introduces the transactional locking II (TL2) algorithm, a software transactional memory (STM) algorithm based on a combination of commit-time locking and a novel global version-clock based  ...  concurrent copies of a transaction based on their associated execution intervals.  ... 
doi:10.1007/11864219_14 fatcat:xcnoqu6fmjhldpgoto3jdwyoau

Transactional Memory Today [chapter]

Maurice Herlihy
2010 Lecture Notes in Computer Science  
TM itself can encompass hardware, software, speculative lock elision, and other mechanisms.  ...  The term "Transactional Memory" was coined back in 1993, but even today, there is a vigorous debate about what it means and what it should do.  ...  This claim is supported by the evidence, described above, that it is not always easy to convert lock-based programs to use transactions because lock-based programs often contain gratuitous data conflicts  ... 
doi:10.1007/978-3-642-11659-9_1 fatcat:cihqs2idzzamdegkk7xn662cpy

ASF: AMD64 Extension for Lock-Free Data Structures and Transactional Memory

Jaewoong Chung, Luke Yen, Stephan Diestelhorst, Martin Pohlack, Michael Hohmuth, David Christie, Dan Grossman
2010 2010 43rd Annual IEEE/ACM International Symposium on Microarchitecture  
Advanced Synchronization Facility (ASF) is an AMD64 hardware extension for lock-free data structures and transactional memory.  ...  Transactional programs with high-level TM language constructs can either be compiled directly to the ASF code or be linked to software TM systems that use ASF to accelerate transactional execution.  ...  Programming with ASF ASF supports three programming styles: transactional programming, lock-free programming, and collaboration with traditional lock-based programming.  ... 
doi:10.1109/micro.2010.40 dblp:conf/micro/ChungYDPHCG10 fatcat:ujplokdepvdbjcsqefva3nkvwa
« Previous Showing results 1 — 15 out of 32,557 results