Data processing: software development – installation – and managem – Software program development tool – Translation of code
Reexamination Certificate
2006-02-28
2006-02-28
Dam, Tuan (Department: 2191)
Data processing: software development, installation, and managem
Software program development tool
Translation of code
C717S144000
Reexamination Certificate
active
07007272
ABSTRACT:
This patent describes a method of compiling a computer program from a sequence of computer instructions including a plurality of first, set branch, instructions which each identify a target address for a branch and a plurality of associated second, effect branch instructions which each implement a branch to a target address. The method comprising the steps of: reading the computer instructions in blocks; allocating each set branch instruction to an initial node in a dominator tree, the initial node being the node which contains the corresponding effect branch instruction; for the first determining the effect of migrating set branch instructions to each of a set of ancestor nodes in the dominator tree based on a performance cost parameter and selecting an ancestor node with the best performance cost parameter; locating said set branch instruction at the selected ancestor node. Repeating the determining and locating steps for each of the set branch instructions
REFERENCES:
patent: 5202993 (1993-04-01), Tarsy et al.
patent: 5450588 (1995-09-01), Hoxey
patent: 5526499 (1996-06-01), Bernstein et al.
patent: 5961637 (1999-10-01), Sturges et al.
patent: 6070009 (2000-05-01), Dean et al.
patent: 6321379 (2001-11-01), Callahan, II
patent: 6341370 (2002-01-01), Tirumalai et al.
patent: 6374348 (2002-04-01), Irie et al.
patent: 6389531 (2002-05-01), Irle et al.
patent: 0 481 615 (1992-04-01), None
patent: 0 689 131 (1995-12-01), None
patent: WO 00/38057 (2000-06-01), None
Duvvuru, Sreeram, Arya, Siamak, “Evaluation of a Branch Target Address Cache”, Sun Microsystems, Inc., 1995 IEEE p. 173-180, retrieved from IEEE Jul. 15, 2004.
Gupta, Fajiv, Berson, David A., Fang, Jesse Z., Resource-Sensitive Profile-Directed Data Flow Analysis for Code optimization 1997 IEEE, p. 358-368, retrieved from IEEE Jul. 15, 2004.
Moon, Soo-Mook, Ebcioglu, Kemal, “Parallelizing Nonnumerical Code with Selective Scheduling and Software Pipelining”, 199 ACM, p. 853-898, retrieved from ACM database Jul. 15, 2004.
Sweany, Philip H., Carr, Steven M., Huber, Brett L., “Compiler Optimization fro Superscalar Systems: Global Instruction Scheduling without Copies”, Dec. 1998, Digital Tech Journal,<URL: http://research.compaq.com/wrl/DECarchives/DTJ/DTJT05/DTJT05HM.HTM>.
Standard European Search Report from British patent application No. 0025052, filed Oct. 12, 2001.
Standard European Search Report from British patent application No. 0025053, filed Oct. 12, 2001.
An Evaluation of Branch Architectures, DeRosa et al., 14thannual Intern'l Symposium on Computer Architecture. Pittsburgh, PA, Jun. 2-5, 1987, pp. 10-16, XP000212074.
Register Allocation over the Program Dependence Graph, Norris et al., ACM Sigplan Notices, US. Association for Computing Machinery, New York, vol. 29, No. 6, Jun. 1, 1994, pp. 266-277, XP000450423.
Integrating Register Allocation and Instruction Scheduling for Riscs, Bradlee et al.,Computer Architecture News, US. Association for Computing Machinery, New York, vol. 19, No. 2, Apr. 1, 1991, pp. 122-131, XP000203255.
Dam Tuan
Jorgenson Lisa K.
McLoughlin Daniel P.
Steelman Mary
STMicroelectronics Limited
LandOfFree
Compiling computer programs including branch instructions does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Compiling computer programs including branch instructions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Compiling computer programs including branch instructions will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3679578