Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
research-article

Unbounded Transactional Memory

Published: 01 January 2006 Publication History

Abstract

Transactional memory should be virtualized to support transactions of arbitrary footprint and duration. The unbounded transactional memory (UTM) architecture achieves high performance in the common case of small transactions, without sacrificing correctness in large transactions.

References

[1]
T. Knight, "An Architecture for Mostly Functional Languages," Proc. ACM Conf. LISP and Functional Programming (LFP 86), ACM Press, 1986, pp. 105-112.
[2]
M. Herlihy, J. Eliot, and B. Moss, "Transactional Memory: Architectural Support for Lock-Free Data Structures," Proc. 20th Ann. Int'l Symp. Computer Architecture (ISCA 93), IEEE Press, 1993, pp. 289-300.
[3]
J.M. Stone et al., "Multiple Reservations and the Oklahoma Update," IEEE Parallel and Distributed Technology, vol. 1, no. 4, Nov. 1993, pp. 58-71.
[4]
R. Rajwar and J.R. Goodman, "Transactional Lock-Free Execution of Lock-Based Programs," Proc. 10th Int'l Conf. Architectural Support for Programming Languages and Operating Systems (ASPLOS 02), ACM Press, 2002, pp. 5-17.
[5]
N. Shavit and D. Touitou, "Software Transactional Memory," Proc. 14th Ann. Symp. Principles of Distributed Computing (PODC 95), ACM Press, 1995, pp. 204-213.
[6]
M. Herlihy et al., "Software Transactional Memory for Dynamic-Sized Data Structures," Proc. 22nd Ann. Symp. Principles of Distributed Computing (PODC 03), ACM Press, 2003, pp. 92-101.
[7]
C.S. Ananian et al., "Unbounded Transactional Memory," Proc. 11th Int'l Symp. High-Performance Computer Architecture (HPCA 05), IEEE CS Press, 2005, pp. 316-327.
[8]
S. Lie, Hardware Support for Unbounded Transactional Memory, master's thesis, Electrical Eng. and Computer Science Dept., MIT, 2004.
[9]
M. Prvulovic et al., "Removing Architectural Bottlenecks to the Scalability of Speculative Parallelization," Proc. 28th Ann. Int'l Symp. Computer Architecture (ISCA 01), ACM Press, 2001, pp. 204-215.
[10]
C.J. Hughes et al., "Rsim: Simulating Shared-Memory Multiprocessors with ILP Processors," Computer, vol. 35, no. 2, Feb. 2002, pp. 40-49.
[11]
H.T. Kung and J.T. Robinson, "On Optimistic Methods for Concurrency Control," ACM Trans. Database Systems, vol. 6, no. 2, June 1981, pp. 213-226.

Cited By

View all
  • (2017)Restart Optimization for Transactional Memory with Lazy Conflict DetectionInternational Journal of Parallel Programming10.1007/s10766-016-0411-z45:3(482-507)Online publication date: 1-Jun-2017
  • (2013)Consistent, durable, and safe memory management for byte-addressable non volatile main memoryProceedings of the First ACM SIGOPS Conference on Timely Results in Operating Systems10.1145/2524211.2524216(1-17)Online publication date: 3-Nov-2013
  • (2010)Efficient transaction nesting in hardware transactional memoryProceedings of the 23rd international conference on Architecture of Computing Systems10.1007/978-3-642-11950-7_13(138-149)Online publication date: 22-Feb-2010
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image IEEE Micro
IEEE Micro  Volume 26, Issue 1
January 2006
136 pages

Publisher

IEEE Computer Society Press

Washington, DC, United States

Publication History

Published: 01 January 2006

Author Tags

  1. Transactional memory
  2. unbounded transactional memory

Qualifiers

  • Research-article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 15 Oct 2024

Other Metrics

Citations

Cited By

View all
  • (2017)Restart Optimization for Transactional Memory with Lazy Conflict DetectionInternational Journal of Parallel Programming10.1007/s10766-016-0411-z45:3(482-507)Online publication date: 1-Jun-2017
  • (2013)Consistent, durable, and safe memory management for byte-addressable non volatile main memoryProceedings of the First ACM SIGOPS Conference on Timely Results in Operating Systems10.1145/2524211.2524216(1-17)Online publication date: 3-Nov-2013
  • (2010)Efficient transaction nesting in hardware transactional memoryProceedings of the 23rd international conference on Architecture of Computing Systems10.1007/978-3-642-11950-7_13(138-149)Online publication date: 22-Feb-2010
  • (2009)Limited early value communication to improve performance of transactional memoryProceedings of the 23rd international conference on Supercomputing10.1145/1542275.1542334(421-429)Online publication date: 8-Jun-2009
  • (2009)Extending concurrency of transactional memory programs by using value predictionProceedings of the 6th ACM conference on Computing frontiers10.1145/1531743.1531748(11-20)Online publication date: 18-May-2009
  • (2008)Nested parallelism in transactional memoryProceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programming10.1145/1345206.1345232(163-174)Online publication date: 20-Feb-2008
  • (2007)A Study of a Transactional Parallel Routing AlgorithmProceedings of the 16th International Conference on Parallel Architecture and Compilation Techniques10.5555/1299042.1299062(388-398)Online publication date: 15-Sep-2007

View Options

View options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media