Transparent concurrent atomic execution

Details Transparent concurrent atomic execution Transparent concurrent atomic execution

2005-09-14

2010-11-23

Chan, Eddie P (Department: 2183)

Electrical computers and digital processing systems: processing

Processing control

C712S029000

Reexamination Certificate

active

07840785

ABSTRACT:
Executing a block of code is disclosed. Executing includes receiving an indication that the block of code is to be executed using a synchronization mechanism and speculatively executing the block of code on a virtual machine. The block of code may include application code. The block of code does not necessarily indicate that the block of code should be speculatively executed.

REFERENCES:
patent: 5860017 (1999-01-01), Sharangpani et al.
patent: 6370625 (2002-04-01), Carmean et al.
patent: 6487652 (2002-11-01), Gomes et al.
patent: 6662360 (2003-12-01), Hay et al.
patent: 6732363 (2004-05-01), Chaudhry et al.
patent: 6748496 (2004-06-01), Scarpino
patent: 6862664 (2005-03-01), Tremblay et al.
patent: 6938130 (2005-08-01), Jacobson et al.
patent: 7120762 (2006-10-01), Rajwar et al.
patent: 2003/0014602 (2003-01-01), Shibayama et al.
patent: 2003/0079094 (2003-04-01), Rajwar et al.
patent: 2003/0084271 (2003-05-01), Lindwer
patent: 2003/0167292 (2003-09-01), Ross
patent: 2003/0208673 (2003-11-01), Chaudhry et al.
patent: 2004/0117573 (2004-06-01), Sutanto et al.
patent: 2004/0162948 (2004-08-01), Tremblay et al.
patent: 2004/0162967 (2004-08-01), Tremblay et al.
patent: 2004/0162968 (2004-08-01), Tremblay et al.
patent: 2004/0163082 (2004-08-01), Tremblay et al.
patent: 2004/0187115 (2004-09-01), Tremblay et al.
patent: 2004/0187116 (2004-09-01), Tremblay et al.
patent: 2004/0187123 (2004-09-01), Tremblay et al.
patent: 2005/0204119 (2005-09-01), Saha
patent: 2005/0268073 (2005-12-01), Karp
“Annual Review of Scalable Computing” edited by Yuen Chung Kwong (National University of Singapore); Pub. date. 2000.
“Dynamic speculation and synchronization of data dependences” Moshovos, A. Breach, S.E. Vijaykumar, T.N. Sohi, G.S. University of Wisconsin-Madison;This paper appears in: Computer Architecture, 1997. Conference Proceedings. The 24th Annual International Symposium on; Publication Date: Jun. 2-4, 1997; On pp. 181-193.
“TEST: A Tracer for Extracting Speculative Threads”; Mike Chen and Kunle Olukotun; The 2003 International Symposium on Code Generation and Optimization, San Francisco, CA, Mar. 2003.
Eliminating squashes through learning cross-thread violations in speculative parallelization for multiprocessors; Cintra, M. Torrellas, J. Div. of Informatics, Edinburgh Univ., UK; This paper appears in: High-Performance Computer Architecture, 2002. Proceedings. Eighth International Symposium on Publication Date: Feb. 2-6, 2002 on pp. 43-54.
Improving value communication for thread-level speculation; Steffan, J.G. Colohan, C.B. Zhai, A. Mowry, T.C. Dept. of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA; This paper appears in: High-Performance Computer Architecture, 2002. Proceedings. Eighth International Symposium on Publication Date: Feb. 2-6, 2002; On pp. 65-75.
Speculative lock elision: enabling highly concurrent multithreaded execution; Rajwar, R. Goodman, J.R. Dept. of Comput. Sci., Wisconsin Univ., Madison, WI, USA; This paper appears in: Microarchitecture, 2001. MICRO-34. Proceedings. 34th ACM/IEEE International Symposium on; Publication Date: Dec. 1-5, 2001; On pp. 294- 305.
Jose F. Martinez and Josep Torrellas “Speculative Synchronization in Shared Memory Multiprocessors”, Technical Report UIUCDCS-R-2001-2255, University of Illinois at Urbana-Champaign, Nov. 2001.
Rajwar et al, Improving the Throughput of Synchronization by Insertion of Delays, (HPCA), Jan. 2000.
Hammond et al., Programming with Transactional Coherence and Consistency (TCC), 2004.
Hammond et al., Transactional Memory Coherence and Consistency, Stanford University.
Hammond et al., Transactional Memory Coherence and Consistency, “all transactions, all the time”, Stanford University, Jun. 21, 2004.
Sean Lie, Hardware Support for Unbounded Transactional Memory, Massachusetts Institute of Technology, May 7, 2004.
Herlihy et al., Transactional Memory: Architectural Support for Lock-Free Data Structures, University of Massachusetts.
Rajwar et al., Transactional Lock-Free Execution of Lock-Based Programs, University of Wisconsin-Madison, (ASPLOS), Oct. 2002.
Ravi Rajwar, Speculation-Based Techniques for Lock-Free Execution of Lock-Based Programs, University of Wisconsin-Madison, 2002.
Ananian et al., Unbounded Transactional Memory, Feb. 2005.
Hammond et al, Transactional Memory Coherence and Consistency, Stanford University, 2004.
Jose F. Martinez and Josep Torrellas, Speculative Locks for Concurrent Execution of Critical Sections in Shared-Memory Multiprocessors, Jose F. Martinez and Josep Torrellas, Workshop on Memory Performance Issues, Intl. Symposium on Computer Architecture, Jun. 2001 (“Speculative Locks 2001”).
Jose F. Martinez and Josep Torrellas, Speculative Locks for Concurrent Execution of Critical Sections in Shared-Memory Multiprocessors, Jose F. Martinez and Josep Torrellas, Technical Report, UIUCCS-R-2001-2202, UILU-Eng-2001-1706, Department of Computer Science, University of Illinois, Feb. 2001 (“Speculative Locks Tech. Report 2001”).
Jose F. Martinez and Josep Torrellas, Speculative Synchronization: Applying Thread-Level Speculation to Explicitly Parallel Applications, Advanced Symposium on Programming Languages and Operating Systems, Oct. 2002, San Jose, CA (“Speculative Synch. 2002”).
Janice M. Stone, Harold S. Stone, Philip Heidelberger, and John Turek, Multiple Reservations and the Oklahoma Update, IEEE Parallel and Distributed Technology, 1993 (“Oklahoma Update 1993”).
Steven S. Lumetta, Detection of Synchronization Errors through Speculative Lock Elision, Supplement of the International Conference on Dependable Systems and Networks, Bethesda, Maryland, Jun. 2002 (“Synchronization Errors 2002”).
Rajwar et al. “Speculative Lock Elision: Enabling Highly Concurrent Multithreaded Execution.” University of Wisconsin-Madison, 2001.

Affiliated with

Also associated with

Rating

Transparent concurrent atomic execution does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Transparent concurrent atomic execution, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Transparent concurrent atomic execution will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4208795