Data processing: software development – installation – and managem – Software program development tool – Translation of code
Reexamination Certificate
2005-07-26
2005-07-26
Das, Chameli C. (Department: 2122)
Data processing: software development, installation, and managem
Software program development tool
Translation of code
C717S154000, C717S151000, C717S132000, C717S140000
Reexamination Certificate
active
06922830
ABSTRACT:
A compiler and method of compiling provide enhanced performance by utilizing a skip list data structure to store various properties of a program at points of interest in the procedure, for example, the properties of the statements in each block in the control flow graph. A special procedure is used to initialize the skip list, prior to performing data flow analysis, to ensure that the skip list structure is not used in an inefficient manner as a result of initialization. Furthermore, special procedures are used to simultaneously scan and compare two skip lists as part of solving dataflow equations.
REFERENCES:
patent: 5146594 (1992-09-01), Iitsuka
patent: 5193190 (1993-03-01), Janczyn et al.
patent: 5428786 (1995-06-01), Sites
patent: 5517628 (1996-05-01), Morrison et al.
patent: 5564045 (1996-10-01), Fulling et al.
patent: 5659739 (1997-08-01), Lubbers et al.
patent: 5761501 (1998-06-01), Lubbers et al.
patent: 5937196 (1999-08-01), Schmidt et al.
patent: 5950009 (1999-09-01), Bortnikov et al.
patent: 5983230 (1999-11-01), Gilbert et al.
patent: 6064819 (2000-05-01), Franssen et al.
patent: 6117185 (2000-09-01), Schmidt
patent: 6192513 (2001-02-01), Subrahmanyam
patent: 6219833 (2001-04-01), Solomon et al.
patent: 6253373 (2001-06-01), Peri
TITLE: Evaluation of Predicated Array Data-Flow Analysis for Automatic Parallelization, author: Moon et al, ACM, 1999.
TITLE: A Comprehensive Approach to Parallel Data Flow Analysis, author: Lee et al, ACM, 1992.
TITLE: Compiling Dynamic Mappings with Array Copies, author: Fabien Coelho, ACM, 1997.
TITLE: Using Dataflow Analysis Techniques to Reduce Ownership Overhead in Cache Coherence Protocols, author: Skepstedt et al, ACM, 1996.
“Concurrent Maintenance of Skip Lists”, William Pugh, 1989.
“Skip Lists: A Probabilistic Alternative to Balanced Trees”, William Pugh, 1990.
“Analysis and Optimization of Imperative Programs”, Joseph Hummel, 1993.
“Complier and run-time support for semi-structured applications”, Nikos Chisochoides, 1997.
Choi et al.,Automatic Construction of Sparse Data Flow Evaluation Graphs, Proc. 18th Annual ACM Symposium on Principles of Programming Languages, pp. 55-66, Jan. 1991.
Pugh, William,Skip Lists: A Probabilistic Alternative to Balanced Trees, Communications of the ACM, Jun. 1990, vol. 33, No. 6, ppgs. 668-676.
Briggs et al.,An Efficient Representation of Sparse Sets, ACM Letters on Programming Languages and Systems, vol. 2 Nos. 104, Mar.-Dec. 1993, ppgs. 59-69.
Heisch, R.R.,Trace-directed porgram restructuring for AIX executables., IBM J. Res. Develop., vol. 38, No. 5, Sep. 1994.
Pettis et al.,Profile Guided Code Positioning, ACM SIGPLAN '90, Conference on Programming Language Design and Implementation, Jun. 20-22, 1990.
Aho et al.,Compilers: Principles, Techniques, and Tools, Sections 10.6 and 10.9, pp. 624 and 660, respectively, Addison-Wesley, 1986.
Aho et al.,Compilers, Principles, Techniques and Tools, Addison-Wesley, pp. 10, 432-446, 1988.
Munro et al.,Deterministic Skip Lists, ACM Digital Libray, pp. 367-375.
Das Chameli C.
Wood Herron & Evans LLP
LandOfFree
Skip list data storage during compilation does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Skip list data storage during compilation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Skip list data storage during compilation will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3404010