Sun Microsystems, Inc.

Paul J Hinker

Michael L Boucher

Shaun M Dennie

Bradley Romain Lewis

In accordance with methods and systems consistent with the present invention, a system that automatically generates 32-bit to 64 bit interfaces to 64-bit code is provided. These interfaces provide for the use of optional parameters and, because they are written in 64-bit code, also allow for parameter checking. These interfaces are automatically generated to allow a programmer to maintain compatibility with 64-bit libraries from 32-bit source code.

Automatic conversion of source code from 32-bit to 64-bit

This functions maintains two trees: a fast access tree referring to memory blocks of a size most often requested, and a general access tree referring to memory blocks of a size less often requested. After satisfying a request for a memory block, the function adjusts the trees to ensure that the fast access tree refers to memory blocks of the size most often requested. By providing such functionality, the function improves its performance over time through self-adaptation.

Adaptive memory allocation

Methods and systems consistent with this invention analyze the performance of a program executed in a data processing system. Such methods and systems assign a semantic to the performance of the program, and measure the level of performance of the program based on the semantic. As part of assigning a semantic, such methods and systems indicate a class of processing of which to measure performance, and may define a suctitude associated with the class. Such methods and systems define the class as a processing function that could contribute to the poor performance of the program. As part of measuring the level of performance, such methods and systems measure the suctitude of the indicated class during program execution.

Method, apparatus, and article of manufacture for performance analysis using semantic knowledge

In accordance with methods and systems consistent with the present invention, a system that automatically generates Fortran 90 interfaces to Fortran 77 code is provided. These interfaces provide for the use of optional parameters and, because they are written in Fortran 90, also allow for parameter checking. These interfaces are automatically generated to allow a programmer to reap the benefits of Fortran 90 calling without having to rewrite the Fortran 77 underlying code.

Automatic generation of fortran 90 interfaces to fortran 77 code

In accordance with methods and systems consistent with the present invention, a system that automatically generates Fortran 90 interfaces to Fortran 77 code is provided. These interfaces provide for the use of optional parameters and, because they are written in Fortran 90, also allow for parameter checking. These interfaces are automatically generated to allow a programmer to reap the benefits of Fortran 90 calling without having to rewrite the Fortran 77 underlying code. When generating the interfaces, the method performs an optimization that saves a significant amount of processing time as well as a significant amount of memory. This optimization involves generating the interfaces in such a way as to prevent the compiler from performing a gather and a scatter.

Avoiding gather and scatter when calling Fortran 77 code from Fortran 90 code

Methods, systems, and articles of manufacture consistent with the present invention assist a programmer in the optimization of an application program by displaying information about memory use in a manner useful to the programmer. A programmer selects an application program that he wishes to optimize. The application program is submitted to an instrumentation process that inserts additional instructions into the code of the application program so that, when executed, the instrumented code produces an output file, called a trace output file. The trace output file contains information about memory accesses. The trace output file is then submitted to a second program, or visualizer, that visually displays the memory accesses using a different visual effect for each type of memory access operation. The visualizer may be run at different speeds, forwards or backwards, paused, or may step through the memory accesses frame-by-frame. This visual representation of memory accesses allows programmers to recognize patterns of memory use that can be used to optimize the application program.

Growing community of inventors

Longmont, CO, United States of America

Paul J Hinker