Transactional Memory: Architectural Support For Lock-Free Data Structures

@inproceedings{citeulike:2085352, abstract = {A 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...}, author = {Herlihy, M. and Moss, J. E. B. }, booktitle = {Proceedings of theTwentiethAnnual International Symposium on Computer Architecture}, citeulike-article-id = {2085352}, keywords = {cs533}, posted-at = {2008-04-10 05:50:15}, priority = {2}, title = {Transactional Memory: Architectural Support For Lock-Free Data Structures}, url = {http://citeseer.ist.psu.edu/herlihy93transactional.html}, year = {1993} }

TY - CONF ID - citeulike:2085352 L3 - citeulike-article-id:2085352 TI - Transactional Memory: Architectural Support For Lock-Free Data Structures T2 - Proceedings of theTwentiethAnnual International Symposium on Computer Architecture N2 - A 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... KW - cs533 AU - Herlihy, M AU - Moss, JEB PY - 1993/// UR - http://citeseer.ist.psu.edu/herlihy93transactional.html ER -