Data processing: software development – installation – and managem – Software program development tool – Translation of code
Reexamination Certificate
2006-11-28
2006-11-28
Dam, Tuan (Department: 2192)
Data processing: software development, installation, and managem
Software program development tool
Translation of code
C717S156000, C712S239000
Reexamination Certificate
active
07143403
ABSTRACT:
A method for eliminating a branch instruction in a control flow path of a computer program. The method includes providing a computer program having a plurality of basic blocks forming control flow paths, determining a cost of executing a branch instruction terminating a basic block in one of the control flow paths, determining a cost of combining basic blocks when merging the control flow paths, and eliminating the branch instruction from the basic block whose cost of execution is greater than the cost of combining the basic blocks in merging the control flow paths.
REFERENCES:
patent: 5889999 (1999-03-01), Breternitz, Jr. et al.
patent: 5937195 (1999-08-01), Ju et al.
patent: 5943499 (1999-08-01), Gillies et al.
patent: 5966536 (1999-10-01), Ravichandran
patent: 5978588 (1999-11-01), Wallace
patent: 6006033 (1999-12-01), Heisch
patent: 6260190 (2001-07-01), Ju
patent: 6289507 (2001-09-01), Tanaka et al.
patent: 6381740 (2002-04-01), Miller et al.
patent: 6594824 (2003-07-01), Volkonsky et al.
patent: 6611956 (2003-08-01), Ogawa et al.
patent: 6817013 (2004-11-01), Tabata et al.
patent: 2002/0056078 (2002-05-01), Inagaki et al.
patent: 2002/0078436 (2002-06-01), Clarke
patent: 2002/0095666 (2002-07-01), Tabata et al.
patent: 2003/0066061 (2003-04-01), Wu et al.
Youngsoo Choi, et al., “The impact of if-conversion and branch prediction on program execution on the Intel® Itanium™ processor,” 2001, IEEE, Proc of the 34th ACM/IEEE int'l symposium on Microarchitecture, Session: Compilation, Austin, TX, pp. 182-191.
Srinivas Mantripragada and Alexandru Nicolau, “Using Profiling to Reduce Branch Misprediction Costs on a Dynamically Scheduled Processor,” 2000, ACM Press, Proc of the 14th Int'l Conf on Supercomputing (ICOS 2000), Santa Fe, NM, pp. 206-214.
Scott A. Mahlke, “Exploiting Instruction-Level Parallelism in the Presence of Conditional Branches”; Thesis, pp. 1-277; University of Illinois 1996; [retrieved on Jun. 18, 2002],retrieved from the internet: http://www.crhc.uiuc.edu/IMPACT/ftp/report/phd-thesis-scott-mahlke.pdf.
David I. August, et al. “A Framework for Balancing Control Flow and Predication”; pp. 1-12, Dec. 1997; [retrieved on Jun. 18, 2002] retrieved from the internet:http:www.crhc.uiuc.edu/IMPACT/ftp/conference/micro-97-framework.pdf.
Dam Tuan
Kiss Eric B
LandOfFree
System and method for merging control flow paths does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with System and method for merging control flow paths, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and System and method for merging control flow paths will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3700403