Parallelism performance analysis based on execution trace...

Data processing: software development – installation – and managem – Software program development tool – Testing or debugging

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C717S135000, C717S141000, C717S158000, C717S124000, C712S245000

Reexamination Certificate

active

06961925

ABSTRACT:
A system for conducting performance analysis for executing tasks. The analysis involves generating a variety of trace information related to performance measures, including parallelism-related information, during execution of the task. In order to generate the trace information, target source code of interest is compiled in such a manner that executing the resulting executable code will generate execution trace information composed of a series of events. Each event stores trace information related to a variety of performance measures for the one or more processors and protection domains used. After the execution trace information has been generated, the system can use that trace information and a trace information description file to produce useful performance measure information. The trace information description file contains information that describes the types of execution events as well as the structure of the stored information. The system uses the trace information description file to organize the information in the trace information file, extracts a variety of types of performance measure information from the organized trace information, and formats the extracted information for display. The system can use default or user-defined functions to extract and format trace information for display. After the system displays one or more types of performance measure information, a user of the system can then interact with the system in a variety of ways to obtain other useful performance analysis information.

REFERENCES:
patent: 4819234 (1989-04-01), Huber
patent: 4872167 (1989-10-01), Maezawa et al.
patent: 5168554 (1992-12-01), Luke
patent: 5301325 (1994-04-01), Benson
patent: 5333280 (1994-07-01), Ishikawa et al.
patent: 5428618 (1995-06-01), Ueki et al.
patent: 5450575 (1995-09-01), Sites
patent: 5504932 (1996-04-01), Vassiliadis et al.
patent: 5533192 (1996-07-01), Hawley et al.
patent: 5548717 (1996-08-01), Wooldridge et al.
patent: 5557761 (1996-09-01), Chan et al.
patent: 5564051 (1996-10-01), Halliwell et al.
patent: 5581764 (1996-12-01), Fitzgerald et al.
patent: 5594864 (1997-01-01), Trauben
patent: 5594904 (1997-01-01), Linnermark et al.
patent: 5598560 (1997-01-01), Benson
patent: 5632032 (1997-05-01), Ault et al.
patent: 5652889 (1997-07-01), Sites
patent: 5712996 (1998-01-01), Schepers
patent: 5724565 (1998-03-01), Dubey et al.
patent: 5754855 (1998-05-01), Miller et al.
patent: 5768591 (1998-06-01), Robinson
patent: 5768592 (1998-06-01), Chang
patent: 5774721 (1998-06-01), Robinson
patent: 5774728 (1998-06-01), Breslau et al.
patent: 5787245 (1998-07-01), You et al.
patent: 5805892 (1998-09-01), Nakajima
patent: 5812811 (1998-09-01), Dubey et al.
patent: 5826265 (1998-10-01), Van Huben et al.
patent: 5867643 (1999-02-01), Sutton
patent: 5877766 (1999-03-01), Bates et al.
patent: 5884023 (1999-03-01), Swoboda et al.
patent: 5887166 (1999-03-01), Mallick et al.
patent: 5898873 (1999-04-01), Lehr
patent: 5901315 (1999-05-01), Edwards et al.
patent: 5903730 (1999-05-01), Asai et al.
patent: 5913925 (1999-06-01), Kahle et al.
patent: 5953530 (1999-09-01), Rishi et al.
patent: 5961639 (1999-10-01), Mallick et al.
patent: 5966539 (1999-10-01), Srivastava
patent: 5978902 (1999-11-01), Mann
patent: 6002872 (1999-12-01), Alexander, III et al.
patent: 6002879 (1999-12-01), Radigan et al.
patent: 6009269 (1999-12-01), Burrows et al.
patent: 6029005 (2000-02-01), Radigan
patent: 6049671 (2000-04-01), Slivka et al.
patent: 6055492 (2000-04-01), Alexander et al.
patent: 6058493 (2000-05-01), Talley
patent: 6059840 (2000-05-01), Click, Jr.
patent: 6072952 (2000-06-01), Janakiraman
patent: 6094716 (2000-07-01), Witt
patent: 6101524 (2000-08-01), Choi et al.
patent: 6112293 (2000-08-01), Witt
patent: 6145121 (2000-11-01), Levy et al.
patent: 6151701 (2000-11-01), Humphreys et al.
patent: 6151704 (2000-11-01), Radigan
patent: 6199095 (2001-03-01), Robinson
patent: 6275981 (2001-08-01), Buzbee et al.
patent: 6282701 (2001-08-01), Wygodny et al.
patent: 6301705 (2001-10-01), Doshi et al.
patent: 6549930 (2003-04-01), Chrysos et al.
patent: 19710252 (1998-02-01), None
patent: 0422945 (1991-04-01), None
patent: 0455966 (1991-11-01), None
patent: 0537098 (1993-04-01), None
patent: 0855648 (1998-07-01), None
patent: 0864979 (1998-09-01), None
patent: 2307760 (1997-06-01), None
Kohl et al., The PVM 3.4 tracing facility and XPVM 1.1, IEEE, Jan. 1996, pp.290-299 vol. 1.
Flanagan et al., The inaccuracy of trace-driven simulation using incomplete multiprogramming trace data, IEEE, Feb. 1-3, 1996 pp.37-43.
Patel, et al., Improving trace cache effectiveness with branch promotion and trace packing, IEEE, Jun. 27-Jul. 1, 1998 pp.262-271.
Netzer et al., Optimal tracing and replay for debugging message-passing parallel programs, Nov. 16-20, 1992, pp.502-511.
Miller et al., A mechanism for efficient debugging of parallel programs, Nov. 1988, ACM SIGPLAN, vol. 24, pp. 141-150.
Poulsen et al., Execution-driven tools for parallel simulation of parallel architectures and applications, ACM SIGPLAN, Dec., 1993, pp. 860-869.
Setia, Trace-driven analysis of migration-base gang scheduling policies for parallel computers, 1997, IEEE, pp. 489-492.
Kosoresow et al., Intrusion detectio via system call traces, 1997, IEEE, pp. 35-42.
Tolujev et al., Assessment of simulation models base on trace file analysis: a metamodeling approach, Simulation conference proceedings, 1998, pp. 443-450.
*H. Hayashi et al., “ALPHA: A High Performance Lisp Machine Equipped with a New Stack Structure and Garbage Collection System,” 10th Annual International Symposium on Computer Architecture, 1983.
*Roy F. Touzeau, “A Fortran Compiler for the FPS-164 Scientific Computer,” Proceedings of the ACM SIGPLAN '84 Symposium on Compiler Construction, SIGPLAN Notices 19(6):48-57, Jun. 1984.
* A. Ram et al., Parallel Garbage Collection Without Synchronization Overhead,“12th Annual Symposium on Computer Architecture,” Jun. 17, 1985.
-Tomas Lang and Miquel Huguet, “Reduced Register Saving/Restoring in Single-Window Register Files,” Computer Architecture News, vol. 14, No. 3, Jun. 1986.
-Preston Briggs et al., “Coloring Heuristics for Register Allocation,” Department of Computer Science, Rice University, Houston, Texas, Jun. 1989.
-Jack W. Davidson and David B. Whally, Reducing the Cost of Branches by Using Registers, “Proceedings of the 17th Annual Symposium on Computer Architecture,” Seattle, Washington, May 28-31, 1990.
*Burton Smith, “The End of Architecture,” Keynote Address Presented at the 17th Annual Symposium on Computer Architecture, Seattle, Washington, May 29, 1990.
*Robert Alverson et al., “The Tera Computer System,” Proceedings of 1990 ACM International Conference on Supercomputing, Jun. 1990.
*Mark A. Linton, “The Evolution of Dbx,” USENIX Summer Conference, Jun. 11-15, 1990.
*David Callahan et al., “Improving Register Allocation for Subscripted Variables,” Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, White Plains, New York, Jun. 20-22, 1990.
-Fred C. Chow and John. L. Hennessy, “The Priority-Based Coloring Approach to Register Allocation,” ACM Transactions on Programming Languages and Systems, vol. 12, No. 4, Oct. 1990, pp. 501-536.
*David Callahan and Burton Smith, “A Future-Based Parallel Language for a General-Purpose Highly-Parallel Computer, Languages and Compilers for Parallel Computing,” MIT Press, 1990.
*D.H. Bailey et al., “The NAS Parallel Benchmarks—Summary and Preliminary Results,” Numerical Aerodynamic Simulation (NAS) Systems Division, NASA Ames Research Center, California, 1991.
-David Callahan and Brian Koblenz, “Register Allocation via Hierarchical Graph Coloring,” Proceedings of the ACM SIGPLAN '91 Conference on Programming Language Design and Implementation, Toronto Canada, Jun. 26, 28-1991.
*David Callahan, “Recognizing and Parallelizing Bounded Recurrences

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Parallelism performance analysis based on execution trace... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Parallelism performance analysis based on execution trace..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Parallelism performance analysis based on execution trace... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3480202

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.