![]() |
CiteULike | ![]() |
rblake's CiteULike | ![]() |
![]() |
|
![]() |
Register | ![]() |
Log in | ![]() |
Transactional Memory: Architectural Support For Lock-Free Data Structuresby: M. Herlihy, J. E. B. Moss
In Proceedings of theTwentiethAnnual International Symposium on Computer Architecture (1993)
|
Reviews
[Write a review of this article]
Find related articles from these CiteULike users
Find related articles with these CiteULike tags
Posting History
AbstractA shared data structure is lock-free if its operations do not require mutual exclusion. If one process is interrupted in the middle of an operation, other processes will not be prevented from operating on that object. In highly concurrent systems, lock-free data structures avoid common problems associated with conventional locking techniques, including priority inversion, convoying, and difficulty of avoiding deadlock. This paper introduces transactional memory, a new multiprocessor...
BibTeX record
RIS record