Speculative multiaddress atomicity

Details Speculative multiaddress atomicity Speculative multiaddress atomicity

2008-05-20

2008-05-20

Elmore, Stephen (Department: 2185)

Electrical computers and digital processing systems: memory

Storage accessing and control

Shared memory area

C711S130000, C711S141000, C711S144000, C711S145000, C711S148000, C711S156000

Reexamination Certificate

active

11117657

ABSTRACT:
A technique for performing a plurality of operations in a shared memory system having a plurality of addresses is disclosed. The technique includes entering into a speculative mode, speculatively performing each of the plurality of operations on addresses in the shared memory system, marking addresses in the shared memory system that have been operated on speculatively as being in a speculative state, and exiting the speculative mode, wherein exiting the speculative mode includes marking the addresses in the shared memory system that have been operated on as being in a non-speculative state.

REFERENCES:
patent: 6748496 (2004-06-01), Scarpino
patent: 6862664 (2005-03-01), Tremblay et al.
patent: 6938130 (2005-08-01), Jacobson et al.
patent: 2003/0014602 (2003-01-01), Shibayama et al.
patent: 2003/0079094 (2003-04-01), Rajwar 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.
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 transaction, 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., Speculative Lock Elision: Enabling Highly Concurrent Multithreaded Execution, University of Wisconsin-Madison, (MICRO), Dec. 2001.
Rajwar et al., Transactional Lock-Free Execution of Lock-Based Programs, University of Wisconsin-Madison, (ASPLOS), October.
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”).

Affiliated with

Also associated with

Rating

Speculative multiaddress atomicity does not yet have a rating. At this time, there are no reviews or comments for this patent.

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

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3925286