Selection of spawning pairs for a speculative multithreaded...

Details Selection of spawning pairs for a speculative multithreaded... Selection of spawning pairs for a speculative multithreaded...

2004-09-21

2008-11-25

Zhen, Wei Y. (Department: 2191)

Data processing: software development, installation, and managem

Software program development tool

Testing or debugging

C717S140000

Reexamination Certificate

active

07458065

ABSTRACT:
A method for analyzing a set of spawning pairs, where each spawning pair identifies at least one speculative thread. The analysis may be practiced via software in a compiler, binary optimizer, standalone modeler, or the like. The analysis may include determining a predicted execution time for a sequence of program instructions, given the set of spawning pairs, for a target processor having a known number of thread units, where the target processor supports speculative multithreading. The method is further to select a spawning pair, according to a greedy approach, if the spawning pair provides a performance enhancement, in terms of decreased execution time due to increased parallelism, when the speculative thread is spawned during execution of a code sequence. Other embodiments are also described and claimed.

REFERENCES:
patent: 6009269 (1999-12-01), Burrows et al.
patent: 6247121 (2001-06-01), Akkary et al.
patent: 6317872 (2001-11-01), Gee et al.
patent: 6442585 (2002-08-01), Dean et al.
patent: 6622300 (2003-09-01), Krishnaswamy et al.
patent: 6931631 (2005-08-01), Bates et al.
patent: 6957422 (2005-10-01), Hunt
patent: 6993750 (2006-01-01), Hundt et al.
patent: 7013456 (2006-03-01), Van Dyke et al.
patent: 7069545 (2006-06-01), Wang et al.
patent: 7082599 (2006-07-01), Morganelli et al.
patent: 7185178 (2007-02-01), Barreh et al.
patent: 7240160 (2007-07-01), Hetherington et al.
patent: 7346902 (2008-03-01), Dutt et al.
McLean et al. “Predictable Time Management for Real-Time distributed Simulation”, Jun. 2003, IEEE computer Society, pp. 1-8.
Aamodt et al. “A Framework for Modeling and Optimization of Prescient Instruction Prefetch”, Jun. 2003, ACM, ACM SIGMETRICS Performance Evaluation Review, vol. 31 Issue 1, pp. 13-24.
U.S. Appl. No. 10/933,076, filed Sep. 1, 2004, Sanchez et al.
U.S. Appl. No. 10/245,548, filed Sep. 17, 2002, Liao et al.
“Greedy Algorithm”, NIST, printed Sep. 9, 2004, http://www.nist.gov/dads/HTML/greedyalgo.html:.
Marcuello P., and Gonzalez A., “Thread-Spawning Schemes for Speculative Multithreading”, IEEE, 8th Intl symposium on high-performance computer architecture, 10 pages.
Carlos Madriles, et al., “Multi-version Register File For Multithreading Processors With Live-in Precomputation”; U.S. Appl. No. 10/896,585, filed Jul. 21, 2004.
Jesus Sanchez, et al., “Analyzer For Spawning Pairs In Speculative Multithreaded Processor”; U.S. Appl. No. 10/933,076, filed Sep. 1, 2004.

Affiliated with

Also associated with

Rating

Selection of spawning pairs for a speculative multithreaded... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Selection of spawning pairs for a speculative multithreaded..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Selection of spawning pairs for a speculative multithreaded... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4040736