Journal ArticleDOI
Profile-directed restructuring of operating system code
W. J. Schmidt,R. R. Roediger,C. S. Mestad,B. Mendelson,I. Shavit-Lottem,V. Bortnikov-Sitnitsky +5 more
TLDR
This work demonstrates how a profiling system can be successfully used to restructure the components of an operating system for improved overall performance, while preserving maintainability of the operating system in the customer's environment.Abstract:
In this paper we describe how a profiling system can be successfully used to restructure the components of an operating system for improved overall performance. We discuss our choice of a profiling system and how it was applied to the AS/400® (Application System/400®) operating system for the purpose of reordering code. Previous work in the industry has been mainly useful only for application programs. Our work demonstrates how such techniques can be applied to operating system code, while preserving maintainability of the operating system in the customer's environment.read more
Citations
More filters
Patent
Method and Apparatus for Generating Computer Programming Code Selectively Optimized for Execution Performance and Not Optimized for Serviceability
TL;DR: A compiler has the capability to selectively compile individual portions of a compilable code module for optimum execution performance or for serviceability as discussed by the authors, and debug activity data is used for determining whether or not to optimize compiled code.
Patent
Method and apparatus for counting instruction execution and data accesses
Jimmie Earl Dewitt,Frank Eliot Levine,Enio Manuel Pineda,Christopher Michael Richardson,Robert John Urquhart +4 more
TL;DR: In this paper, a method, apparatus, and computer instructions in a data processing system for processing instructions are described, and counting of each event associated with the execution of the instruction is enabled.
Patent
Method and apparatus for autonomic test case feedback using hardware assistance for code coverage
TL;DR: In this paper, a method, apparatus, and computer instructions for presenting coverage data for code is presented, and the coverage data containing instruction access indicators associated with the code is obtained.
Patent
Method and apparatus for providing hardware assistance for code coverage
TL;DR: In this article, a method, apparatus, and computer instructions for generating coverage data during execution of code in the data processing system is described, where a determination is made as to whether an access indicator is associated with an instruction in response to executing the instruction in the code by a processor in the system.
Proceedings ArticleDOI
Reality-based optimization
TL;DR: This paper looks at real use of large real-world desktop applications and proposes to augment traditional scenarios with data derived from real use to reduce memory pressure and disk reads compared to traditional approaches.
References
More filters
Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
Book
The Art of Computer Programming
TL;DR: The arrangement of this invention provides a strong vibration free hold-down mechanism while avoiding a large pressure drop to the flow of coolant fluid.
Journal ArticleDOI
The program dependence graph and its use in optimization
TL;DR: An intermediate program representation, called the program dependence graph (PDG), that makes explicit both the data and control dependences for each operation in a program, allowing transformations to be triggered by one another and applied only to affected dependences.
Journal ArticleDOI
A study of replacement algorithms for a virtual-storage computer
TL;DR: One of the basic limitations of a digital computer is the size of its available memory; an approach that permits the programmer to use a sufficiently large address range can accomplish this objective, assuming that means are provided for automatic execution of the memory-overlay functions.