M. Herlihy and J. E. B. Moss. Transactional memory: Architectural support for highly concurrent data structures. Technical Report ?, Digital Equipment Corp., Cambridge Research Laboratory, Apr. 1992. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Optimistic Parallelization - Morrisett, Herlihy (1993) Self-citation (Herlihy) (Correct)
....processes. If it fails, all changes to the write set are discarded. Either way, Commit returns an indication of success or failure. ffl Abort discards all updates to the write set. This architecture is a simplified version of transactional memory, a cache structure proposed by Herlihy and Moss [8]. A complete description of the transactional memory implementation is beyond the scope of this abstract (see [8] for details) For now, we remark that transactional memory is implemented by modifying standard ownership based cache consistency protocols. It requires a small, fully associative ....
....success or failure. ffl Abort discards all updates to the write set. This architecture is a simplified version of transactional memory, a cache structure proposed by Herlihy and Moss [8] A complete description of the transactional memory implementation is beyond the scope of this abstract (see [8] for details) For now, we remark that transactional memory is implemented by modifying standard ownership based cache consistency protocols. It requires a small, fully associative transactional cache in addition to the regular cache. Non transactional operations use the same caches, cache ....
M. Herlihy and J. E. B. Moss. Transactional memory: Architectural support for highly concurrent data structures. Technical Report ?, Digital Equipment Corp., Cambridge Research Laboratory, Apr. 1992.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC