Enhanced parallelism in trace scheduling by using renaming

Details Enhanced parallelism in trace scheduling by using renaming Enhanced parallelism in trace scheduling by using renaming

2005-09-20

2005-09-20

Dam, Tuan (Department: 2192)

Data processing: software development, installation, and managem

Software program development tool

Translation of code

C717S154000, C717S140000, C717S128000

Reexamination Certificate

active

06948162

ABSTRACT:
A method includes scheduling instructions within a trace disregarding data dependencies from off trace basic blocks. After scheduling, errors caused by instruction movement are corrected. By disregarding data dependencies from off trace basic blocks, more parallelism is exposed resulting in more instruction motion. In this manner, efficiency is maximized.

REFERENCES:
patent: 5828886 (1998-10-01), Hayashi
patent: 5867711 (1999-02-01), Subramanian et al.
patent: 6076159 (2000-06-01), Fleck et al.
patent: 6449713 (2002-09-01), Emer et al.
patent: 6526572 (2003-02-01), Brauch et al.
patent: 6651164 (2003-11-01), Soltis et al.
patent: 2003/0079211 (2003-04-01), Lueh
P. Geoffrey Lowney et al.,The Multiflow Trace Scheduling Compiler, The Journal of Supercomputing, 7, 51-142 (1993).

Affiliated with

Also associated with

Rating

Enhanced parallelism in trace scheduling by using renaming does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Enhanced parallelism in trace scheduling by using renaming, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Enhanced parallelism in trace scheduling by using renaming will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3374136