Sun Microsystems, Inc.

Ca, Inc.

Michael Steven Walker

Stephen Alan Chessin

Rodrick Ison Evans

Sanjay R Radia

Mark Jacob Addleman

Jerry R Jackson

Erhan Giral

Robert A Gingell, Jr

Andreas Gerhard Reiss

Corey Cohen

David Brooke Martin

Michael T Clayton

Chris J Kiick

For each event detected during execution of a monitored application comprising a plurality of application components, a determination is made of which of the plurality of application components corresponds to the detected event. Also, a dependency subgroup that includes the application component that corresponds to the detected event is identified, wherein a dependency subgroup indicates dependencies among a subgroup of the plurality of application components. A location within the dependency subgroup of the application component corresponding to the detected event is determined. An order of correction for the application components determined to correspond to detected events are determined based, at least in part, on the determined location. Correction of the application components determined to correspond to detected events are initiated according to the determined order of correction.

Ordered correction of application based on dependency topology

In general, this disclosure describes techniques of managing resources in a service-oriented distributed computing system. As described in this disclosure, a control node automatically manages the system such that the system has sufficient capacity to satisfy an agreement to provide a given level of a service. In order to automatically manage the system, the control node evaluates the current capacity levels of resources in the system. The current capacity levels are indicative the capacity of resources to perform certain acts. The capacity of the resources to perform these acts may be indicative of whether the system is able to provide the given level of the service. Because resources may be deployed in chains, the capacities of resources to perform the certain acts may be defined to be dependent on the capacities of other resources to perform other acts.

Interdependent capacity levels of resources in a distributed computing system

In general, the invention relates to a method for loading a kernel module. The method involves loading a preload module into a kernel. Loading the preload module includes creating a dynamic dependency list. Loading the kernel module further includes loading the kernel module comprising a static dependency list into the kernel, and triggering a hook when the static dependency list is reviewed. The module information associated with the kernel is obtained using the hook. Loading the kernel module further includes searching for a dynamic dependency associated with the kernel module in the dynamic dependency list using the module information, and updating the static dependency list with the dynamic dependency to obtain an updated static dependency list if the dynamic dependency associated with the kernel module is present in the dynamic dependency list.

Method and apparatus for interposing kernel symbols

A system, method and computer program product for compiling and linking a source file and to generate a symbol table associating a global symbol with a register referenced in the source file. The symbol table enables a linker to initialize the global registers using a relocation entry which holds an initializer. The compiler also generates an object file from the source file. The object file includes the global symbol information. A linker links the object file potentially with at least one other object file or shared library to thereby generate an executable file or shared library. The linker uses the global symbol information contained in the object file to initialize the global registers and to perform relocation operations.

Method and system for compiling and linking source files

A system, method and computer program product for compiling a source file and to generate a data structure associating a global symbol with a global register referenced in the source file. The data structure enables a linker to initialize the global registers. The compiler also generates an object file from the source file. The object file includes the global register information. A linker links the object file potentially with at least one other object file or shared library to thereby generate an executable file or shared library. The linker uses the global symbol information contained in the object file to initialize the global registers and to perform relocation operations.

Methods, computer program products, and apparatus for initializing

The present invention is a method and apparatus for providing instrumentation of procedure calls in dynamically linked environments. More specifically, an embodiment of the present invention includes an API that allows a user to define procedures that are called during specific times during the execution of a runtime linker. By defining procedures in accordance with this API, the user can select procedures within a user program for auditing. The API also allows the user to define an entry procedure that will be called immediately before each audited procedure and an exit procedure that will be called immediately after each audited procedure. The runtime linker uses the procedures defined by the user to select procedures within the program for auditing. The runtime linker then arranges for the entry procedure to be called before, and the exit procedure to be called after, each audited procedure.

Growing community of inventors

Los Altos, CA, United States of America

Michael Steven Walker