Dynamic classification of sections of software

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

C717S127000, C717S131000, C717S158000, C717S172000

Reexamination Certificate

active

06957422

ABSTRACT:
Dynamic classification of sections of software using a profile-based optimization system optimizes management of the sections of software. Software executes under expected usage conditions. After execution, a set of usage profiles describes the dynamic properties of sections of the software. Each usage profile includes information identifying a section of software. Each usage profile maps to an outcome meant to optimize management of the sections of the software during later execution. During such later execution, a usage background describes the dynamic properties of a section of the software. The usage background includes information identifying the section of software. By matching the usage background to a usage profile in the set of usage profiles, the section is dynamically classified during later execution. Based on this dynamic classification, the section maps to the outcome meant to optimize management of the sections of software.

REFERENCES:
patent: 3427443 (1969-02-01), Apple et al.
patent: 3551659 (1970-12-01), Forsythe
patent: 4819233 (1989-04-01), Delucia et al.
patent: 5021947 (1991-06-01), Campbell et al.
patent: 5193180 (1993-03-01), Hastings
patent: 5390329 (1995-02-01), Gaertner et al.
patent: 5535329 (1996-07-01), Hastings
patent: 5579520 (1996-11-01), Bennett
patent: 5634114 (1997-05-01), Shipley
patent: 5748962 (1998-05-01), Brechtel et al.
patent: 5752038 (1998-05-01), Blake et al.
patent: 5790858 (1998-08-01), Vogel
patent: 5978583 (1999-11-01), Ekanadham et al.
patent: 5987247 (1999-11-01), Lau
patent: 6011918 (2000-01-01), Cohen et al.
patent: 6026484 (2000-02-01), Golston
patent: 6044224 (2000-03-01), Radia et al.
patent: 6088717 (2000-07-01), Reed et al.
patent: 6101325 (2000-08-01), Flaat
patent: 6112304 (2000-08-01), Clawson
patent: 6134559 (2000-10-01), Brumme et al.
patent: 6154878 (2000-11-01), Saboff
patent: 6199075 (2001-03-01), Ungar et al.
patent: 6230312 (2001-05-01), Hunt
patent: 6263491 (2001-07-01), Hunt
patent: 6381628 (2002-04-01), Hunt
patent: 6381735 (2002-04-01), Hunt
patent: 6385766 (2002-05-01), Doran, Jr. et al.
patent: 6393476 (2002-05-01), Barnhouse et al.
patent: 6397254 (2002-05-01), Northrup
patent: 6412019 (2002-06-01), Gibbons et al.
patent: 6421705 (2002-07-01), Northrup
patent: 6445782 (2002-09-01), Elfe et al.
patent: 6519767 (2003-02-01), Carter et al.
patent: 6546553 (2003-04-01), Hunt
patent: 6629123 (2003-09-01), Hunt
Hong et al., “Classifying and Retrieving Software Components Based on Profiles”, IEEE, pp.: 1756-1760, 1997.
Harchol-Balter et al., “Exploiting process lifetime distributions for dynamic load balancing”, ACM, pp.: 13-24, 1996.
Hartley, “Compile-Time Program Restructuring in Multiprogrammed Virtual Memory Systems,”IEEE Transactions on Software Engineering, vol. 14, No. 11, Nov. 1988.
Heisch, “Trace-directed program restructuring for AIX executables,”IBM J. Res. Develop., vol. 38, No. 5, Sep. 1994.
Pettis et al., “Profile Guided Code Positioning,” Proceedings of the ACM SIGPLAN'90, Conference on Programming Language, Design and Implementation, Jun. 20-22, 1990.
Chang et al., “Using Profile Information to Assist Classic Code Optimizations,”Software Practice and Experience, vol. 21(12), pp. 1301-1321, Dec. 1991.
Speer et al., “Improving UNIX Kernel Performance using Profile Based Optimization,” 1994 Winter USENIX, Jan. 17-21, 1994, San Francisco, CA.
Ball et al., “Optimally Profiling and Tracing Programs,”University of Wisconsin Computer Sciences Technical Report 1031, Sep. 6, 1991.
Larus et al., “Rewriting Executable Files to Measure Program Behavior,”University of Wisconsin Computer Sciences Technical Report 1083, Mar. 25, 1992.
Sarkar, “Determining Average Program Execution Times and their Variance,” ACM 0-89791-306/X/89/0006/0298, 1989.
Tarjan, “Data Structures and Network Algorithms,” CBMS-NSF Regional Conference Series in Applied Mathematics, Chapter 6, pp. 71-83, 1983.
Hunt, “Using Inter-Component Communication Analysis to Understand Component Applications,” Ph.D. Thesis Proposal, University of Rochester, Rochester, New York, 42 pp., Jan. 1997.
Hunt et al., “Coign: Efficient Instrumentation for Inter-Component Communication Analysis,” URCS Tech Report 648, University of Rochester, Rochester, New York, 11 pp., Feb. 1997.
Hunt, “Using Inter-Component Communication Analysis to Understand Component Applications,” Slide Presentation at Six Month Review of Ph.D. Thesis Project, University of Rochester, Rochester, New York, 9 pp., Apr. 1997.
Hunt, “Inter-Component Communication Analysis: Dynamic Discovery and Partitioning of Components in Distributed Applications,” Handout from Third Conference on Object-Oriented Technologies and Systems, 2 pp., May 1997.
Hunt, “Inter-Component Communication Analysis: Dynamic Discovery and Partitioning of Components in Distributed Applications,” Slide Presentation at Third Conference on Object-Oriented Technologies and Systems, 7 pp., May 1997.
Aral et al., “Efficient Debugging Primitives for Multiprocessors,” ASPLOS-III Proceedings, Third International Conference on Architectural Support for Programming Languages and Operating Systems, Boston, Massachusetts, pp. 87-95, Apr. 1989.
Aral et al., “Non-Intrusive and Interactive Profiling in Parasight,” ACM/SIGPLAN PPEALS 1988, New Haven, Connecticut, pp. 21-30, Jul. 1988.
Osman, “DDT Reference Manual,” Massachusetts Institute of Technology Artificial Intelligence Laboratory, Memo No. 147A, pp. 81, Sep. 1971.
Evans, “On-Line Debugging Techniques: A Survey,” AFIPS Conference Proceedings, vol. 29, Fall Joint Computer Conference, pp. 37-50, Nov. 1966.
Gill, “The Diagnosis of Mistakes in Programmes on the EDSAC,” Proceedings of the Royal Society of London, Series A. Mathematical and Physical Sciences, vol. 206, London, England, pp. 538-554, May 1951.
Kessler, “Fast Breakpoints: Design and Implementation,” Proceedings of the ACM SIGPLAN'90 Conference on Programming Language Design and Implementation, White Plains, New York, pp. 78-84, Jun. 1990.
Keppel, “A Portable Interface for the On-The-Fly Instruction Space Modification,” University of Washington, Seattle, Washington, pp. 86-94, 1991.
Larus et al., “EEL: Machine-Independent Executable Editing,” SIGPLAN Conference on Programming Language Design and Implementation, pp. 291-300, Jun. 1995.
Romer et al., Instrumentation and Optimization of Win32/Intel Executables Using Etch, Proceedings of the USENIX Windows NT Workshop 1997, Seattle, Washington, pp. 1-7, Aug. 1997.
Srivastava et al., “ATOM: A System for Building Customized Program Analysis Tools,” Proceedings of the SIGPLAN '94 Conference on Programming Language Design and Implementation, Orlando, Florida, pp. 196-205, Jun. 1994.
Zhang et al., “System Support for Automatic Profiling and Optimization,” Proceedings of the Sixteenth ACM Symposium on Operating System Principles, Saint-Malo, France, 12 pp., Oct. 1997.
Lee et al., “Execution Characteristics of Desktop Applications on Windows NT,” 25thAnnual International Symposium on Computer Architecture, 12 pp., Jun. 1998.
Hunt et al., “Coign: Automated Distributed Partitioning of Component Applications,” Abstract from SOSP Work-in-Progress session, 1 p., Oct. 1997.
Hunt et al., “Coign: Automated, Distributed Partitioning of Component Applications,” Poster from SOSP Work-in-Progress session, 9 pp., Oct. 1997.
Hunt et al., “Contributions,” Poster from SOSP Work-in-Progres session, 3 pp., Oct. 1997.
Hunt et al., “Coign: Automated Distributed Partitioning of Component Applications,” Presentation from SOSP Work-in-Progress session, 13 pp., Oct. 1997.
Hunt et al., “Coign: Automated Distributed Partitioning of Component Applications,” Slide Presentati

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

Dynamic classification of sections of software does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Dynamic classification of sections of software, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dynamic classification of sections of software will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3463964

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