Fast tree-based generation of a dependence graph

Details Fast tree-based generation of a dependence graph Fast tree-based generation of a dependence graph

2004-12-16

2009-11-24

Rutten, James (Department: 2192)

Data processing: software development, installation, and managem

Software program development tool

Translation of code

C717S159000

Reexamination Certificate

active

07624386

ABSTRACT:
A dependence graph having a linear number of edges and one or more tie vertices is generated by constructing a tree of nodes, receiving requests to create cut and/or fan vertices corresponding to each node, adjusting a frontier of nodes up or down, and creating one or more cut or fan vertices, zero or more tie vertices, and at least one predecessor edge.

REFERENCES:
patent: 5317734 (1994-05-01), Gupta
patent: 5327561 (1994-07-01), Choi et al.
patent: 5802373 (1998-09-01), Yates et al.
patent: 6044222 (2000-03-01), Simons et al.
patent: 6260190 (2001-07-01), Ju
patent: 6356902 (2002-03-01), Tan et al.
patent: 6516463 (2003-02-01), Babaian et al.
patent: 6675380 (2004-01-01), McKinsey et al.
patent: 6832370 (2004-12-01), Srinivasan et al.
patent: 7007271 (2006-02-01), Kumar et al.
patent: 7058937 (2006-06-01), Fu et al.
patent: 2003/0196197 (2003-10-01), Fu et al.
patent: 2003/0200540 (2003-10-01), Kumar et al.
patent: 2004/0073541 (2004-04-01), Lindblad et al.
patent: 2005/0125786 (2005-06-01), Dai et al.
patent: 2005/0216899 (2005-09-01), Muthukumar et al.
patent: 2006/0026582 (2006-02-01), Collard et al.
patent: 2006/0200816 (2006-09-01), Pramanick et al.
patent: 977128 (2000-02-01), None
Bacon et al. “Compiler Transformations for High-Performance Computing” Dec. 1994, ACM Computing Surveys, vol. 26 No. 4.
Moon, S. and Ebcio{hacek over (g)}lu, K. 1997. Parallelizing nonnumerical code with selective scheduling and software pipelining. ACM Trans. Program. Lang. Syst. 19, 6 (Nov. 1997), 853-898. DOI= http://doi.acm.org/10.1145/267959.269966.
U.S. Appl No. 10/881,030 Office Action Mailed Jun. 4, 2007.
“U.S. Appl. No. 10/881,030 Final Office Action Mailed Nov. 13, 2007”.
“Webopedia—Bitwise Operator”, http://web.archive.org/web/20021226121822/attp://www.webopedia.com/TERM/B/bitwise...5/25/2007, (Sep. 1, 1997), 1-2.
Fu, C. , et al., “Efficient Modeling of Itanium Architecture During Instruction Scheduling Using Extended Finite State Automata”,Journal of Instruction-Level Parallelism, (Apr. 2004), 26 pages.

Affiliated with

Also associated with

Rating

Fast tree-based generation of a dependence graph does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Fast tree-based generation of a dependence graph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast tree-based generation of a dependence graph will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4142786