Electrical computers and digital processing systems: processing – Processing control – Context preserving (e.g. – context swapping – checkpointing,...
Reexamination Certificate
2008-07-01
2008-07-01
Li, Aimee J (Department: 2183)
Electrical computers and digital processing systems: processing
Processing control
Context preserving (e.g., context swapping, checkpointing,...
C712S229000
Reexamination Certificate
active
11234669
ABSTRACT:
A technique for improving the performance of a system that supports simultaneous multi-threading (SMT). When a first thread encounters a halt sequence, the system starts a transactional memory operation by generating a checkpoint and entering a transactional-execution mode. Next, the system loads from a mailbox address associated with the halt sequence. The system then stalls execution of the first thread, so that the first thread does not execute instructions within the halt sequence, thereby freeing up processor resources for other threads. To terminate the halt sequence, a second thread stores to the mailbox address, which causes a transactional-memory mechanism within the processor to detect an interference with the previous load from the mailbox address by the first thread and which causes the first thread to exit from the halt sequence. The system then continues executing instructions following the halt sequence.
REFERENCES:
patent: 5649136 (1997-07-01), Shen et al.
patent: 6272517 (2001-08-01), Yue et al.
patent: 6772294 (2004-08-01), Civlin
patent: 7165254 (2007-01-01), Yoshida
patent: 2002/0087810 (2002-07-01), Boatright et al.
patent: 2003/0079094 (2003-04-01), Rajwar et al.
patent: 2004/0093602 (2004-05-01), Huston et al.
patent: 2004/0162951 (2004-08-01), Jacobson et al.
patent: 2005/0246506 (2005-11-01), Ukai
Free On-Line Dictionary of Computing (FOLDOC). © 1995. www.foldoc.org□□search term: checkpoint.
Dubois, Michel and Scheurich, Christoph. “Memory Access Dependencies in Shared-Memory Multiprocessors”. IEEE Transactions on Software Engineering vol. 16, No. 6 © Jun. 1990. pp. 660-673.
Dinning, Anne and Chonberg, Edith. “Detecting Access Anomalies in Programs with Critical Sections”. ACM SIGPLAN Notices vol. 25, Issue 12 © 1991. pp. 85-96.
Michael, Maged. “Scalable Lock-Free Dynamic Memory Allocation”. ACM © 2004. pp. 1-12.
Jon, Ruoming; Yang, Ge; and Agrawal, Gagane. “Shared Memory Parallelization of Data Mining Algorithms: Techniques, Programming Interface, and Performance”. IEEE Transactions on Knowledge and Data Engineering vol. 17, No. 1 © Jan. 2005. pp. 71-89.
Caprioli Paul
Mesard Wayne
Li Aimee J
Park Vaughan & Fleming LLP
Sun Microsystems Inc.
Wong Gilbert
LandOfFree
Using a transactional execution mechanism to free up... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Using a transactional execution mechanism to free up..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Using a transactional execution mechanism to free up... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3910305