Mechanism to optimize speculative parallel threading

Details Mechanism to optimize speculative parallel threading Mechanism to optimize speculative parallel threading

2005-06-27

2009-12-01

Nahar, Qamrun (Department: 2191)

Data processing: software development, installation, and managem

Software program development tool

Translation of code

C717S152000, C717S153000, C717S154000, C717S156000, C717S159000, C717S149000, C717S140000, C712S216000

Reexamination Certificate

active

07627864

ABSTRACT:
A method to optimize speculative parallel thread execution comprises selecting a plurality of partition candidate pairs for speculative parallel thread execution, transforming each partition candidate pair of the plurality of partition candidate pairs to improve the expected performance gain of each pair, and selecting a set of one or more transformed partition candidate pairs that do not interfere with each other and produce a maximum expected performance gain.

REFERENCES:
patent: 5724565 (1998-03-01), Dubey et al.
patent: 5812811 (1998-09-01), Dubey et al.
patent: 5913925 (1999-06-01), Kahle et al.
patent: 6374403 (2002-04-01), Darte et al.
patent: 6625725 (2003-09-01), Wu et al.
patent: 6931514 (2005-08-01), Shibayama et al.
patent: 7010787 (2006-03-01), Sakai
patent: 7082601 (2006-07-01), Ohsawa et al.
patent: 7458065 (2008-11-01), Sanchez et al.
patent: 2004/0103410 (2004-05-01), Sakai
patent: 2004/0154010 (2004-08-01), Marcuello et al.
patent: 2004/0194074 (2004-09-01), Shibayama et al.
Marcuello, et al. “Thread-Spawning Schemes for Speculative Multithreading”, 2002, IEEE, p. 1-10.
Bhowmik, et al. “A General Compiler Framework for Speculative Multithreading”, 2002, ACM, p. 99-108.
U.S. Appl. No. 10/794,052, filed Mar. 8, 2004, Du et al.
U.S. Appl. No. 10/778,545, filed Feb. 17, 2004, Lim et al.
T.N. Vijaykumar. Compiling for the Multiscalar Architecture. PhD Thesis. Computer Science Department, University of Wisconsin at Madison, Jan. 1998, p. 1-208.
A. Bhowmik and M. Franklin, “A General Compiler Framework for Speculative Multithreading”, Proceedings of the 14th annual ACM symposium on parallel algorithms and architectures, Winnipeg, Manitoba, Canada, 2002, p. 1-14.
T.A. Johnson et al., “Min-cut program decomposition for thread-level speculation”, Proceedings of the ACM SIGPLAN 2004 conference on programming language design and implementation, Washington D.C., 2004, p. 1-37.

Affiliated with

Also associated with

Rating

Mechanism to optimize speculative parallel threading does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Mechanism to optimize speculative parallel threading, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Mechanism to optimize speculative parallel threading will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4065294