U.S. patents available from 1976 to present.
U.S. patent applications available from 2005 to present.

Method of, system for, and computer program product for providing quick fusion in WHERE constructs

Patent 6041181 Issued on March 21, 2000. Estimated Expiration Date: Icon_subject July 23, 2017. Estimated Expiration Date is calculated based on simple USPTO term provisions. It does not account for terminal disclaimers, term adjustments, failure to pay maintenance fees, or other factors which might affect the term of a patent.

Patent References

System for inserting constructs into compiled code, defining scoping of common blocks and dynamically binding common blocks to tasks
Patent #: 5093916
Issued on: 03/03/1992
Inventor: Karp, et al.

Method of producing object program based on interprocedural dataflow analysis of a source program
Patent #: 5146594
Issued on: 09/08/1992
Inventor: Iitsuka

Method and apparatus for direct conversion of programs in object code form between different hardware architecture computer systems
Patent #: 5313614
Issued on: 05/17/1994
Inventor: Goettelmann, et al.

ANDF compiler using the HPcode-plus compiler intermediate language
Patent #: 5339419
Issued on: 08/16/1994
Inventor: Chan, et al.

System for compiling parallel communications instructions including their embedded data transfer information
Patent #: 5355492
Issued on: 10/11/1994
Inventor: Frankel, et al.

Compiler for performing incremental live variable analysis for data-parallel programs
Patent #: 5355494
Issued on: 10/11/1994
Inventor: Sistare, et al.

5548761

Inventors

Application

No. 899359 filed on 07/23/1997

US Classes:

717/114, Programming language717/154, Including analysis of program717/160Including loop

Examiners

Primary: Hafiz, Tariq R.
Assistant: Nguyen-Ba, Antony

Attorney, Agent or Firm

International Class

G06F 009/45

Abstract

FORTRAN WHERE construct compilation and optimization is provided by excluding an assignment statement containing a transformational intrinsic function from loop fusion of the WHERE construct. To perform this loop fusion, intrastatement dependence analysis is performed within each assignment statement of the WHERE construct, and then interstatement dependence analysis is performed between each assignment statement and assignment statements subsequent to the assignment statement. Responsive to this dependence analysis, pairs of assignment statements which may not be fused into a single loop are identified, and non-fusion boundaries between adjacent assignment statements where assignment statements preceding a non-fusion boundary and assignment statements subsequent to the non-fusion boundary may not be fused into a single loop are identified. This fusion analysis yields a loop fusion configuration. After the loop fusion configuration is identified and the rank of any temporary expression is determined, code generation is performed by scalarizing each assignment statement. This provides better optimization than the conventional straight forward approach to compiling a WHERE construct, and further provides an optimized compilation of a WHERE construct by the use of less compilation time than that required by conventional high-level optimization.

Other References

  • International Fortran Standard Specification, ISO/IEC 1539:1991; ANSI X3.198-199x
  • Allen, J.R. Dependence Analysis for Subscripted Variables and its Application to Program Transformation, PhD Thesis, Rice University, 1983
  • Banerjee, U. Unimodular Transformations of Double Loops, Proceedings of the Third Workshop on Languages and Compilers for Parallel Computing, Aug. 1990
  • Sarkar, V. Automatic Partitioning of a Program Dependence Graph into Parallel Tasks, IBM Journal of Research and Development, vol. 35, No. 5/6 Sep./Nov. 1991
  • Wolfe, M.J. Optimizing Supercompilers for Supercomputers. MIT Press, Cambridge, Massachusetts, 1989. In the Series Research Monographs in Parallel and Distributed Computin
PatentsPlus Images
Enhanced PDF formats
loading...
PatentsPlus: add to cart
PatentsPlus: add to cartSearch-enhanced full patent PDF image
$9.95more info
PatentsPlus: add to cart
PatentsPlus: add to cartIntelligent turbocharged patent PDFs with marked up images
$16.95more info
 
Sign InRegister
Username  
Password   
forgot password?