International Business Machines Corporation

Ramachandra N Pai

Timothy C Pepper

Eric Benjamin Munson

Gerrit Huizenga

Nathan Victor Bak

Patricia A Gaughen

Yun Yu Wang

Wei Feng Yang

Guang Rong Xiao

Donjuma S Lee

Huizenga Gerrit

Jon A Grimm

A method, system and computer program product for managing source annotation metadata. The metadata management technique may include maintaining a set of metadata, maintaining data/metadata relationships between individual units of the metadata and individual units of the source data, and maintaining metadata/metadata relationships between individual units of the metadata. The metadata/metadata relationships define two or more intersecting search pathways through the metadata that intersect at one or more metadata units belonging to more than one search domain.

Managing source annotation metadata

A non-preemption task group apparatus comprises a scheduling module that identifies a first task that is one of executing and scheduled to execute on a processor during a first time slice and a second task to be executed on a processor during a subsequent time slice, the first slice occurring before the subsequent slice, a relationship module that compares the first task to the second task, and an examining module that identifies whether the first task and the second task are interchangeable tasks based on the comparison, wherein the first task executes during the subsequent time slice in response to the first task and the second task being identified as interchangeable.

Non-preemption of a group of interchangeable tasks in a computing device

A method for non-preemption of interchangeable tasks is disclosed. The method for non-preemption of interchangeable tasks includes identifying a first task assigned to a first time slice, identifying a second task assigned to a subsequent time slice, comparing the first task to the second task, identifying whether the first task and the second task are interchangeable tasks, and executing the first task during the subsequent time slice in response to the first task and the second task being interchangeable. The first task may be currently executing on a processor or may be scheduled to execute on the processor.

A method, system and computer program product for software debugging using annotation metadata. A set of metadata comprising source code annotation information for a software program is maintained, together with data/metadata relationships between individual units of the metadata and individual units of the source code. A software debugging point is set that is associated with debugging point metadata comprising one or more units the metadata. A debugging action is performed when execution of the software program reaches said debugging point.

Metadata-integrated debugger

A software development service offering of generating and installing software applications packages on computer systems running a set of operating systems including LINUX and UNIX operating systems, by creating a dynamic repository; populating a plurality software packages; running a tool that creates a set of index files, wherein the set of index files includes a menu of the plurality of software packages, wherein each software package in the plurality of software packages contains a set of contents; determining whether a software package is included in a menu of the plurality of software packages; and delivering to a client system the software package requested in a selection request, or delivering to the client system an other software package, when the software package is not included in the menu of the plurality of software packages.

Methods, systems and computer products for a dynamic repository

A computer system, program, or method may provide for quantifying changes in an individual component among a plurality of components in a software development environment where the components are incorporated in a build. This may include calculating a baseline weight of the individual component prior to a change; effecting, in the software development environment, the change to the individual component; calculating a modified weight of the individual component after the change; determining a threshold for a difference between the baseline weight and the modified weight of the individual component; calculating the difference between the baseline weight and the modified weight of the individual component; and providing on the software development computer a notification if the difference exceeds the threshold. The weights of the individual component may use data such as a count of other components required by the individual component, an install size, a runtime memory usage, a depth of a dependency tree, a component license type, a component category for memory location, a component code type, and/or other types of data.

Comparing component weights between builds

A method, apparatus, and article are provided for managing migration of annotations between versions of source code. Annotations associated with patterns of source code are identified. A comparison of the modified source code is conducted in conjunction with the identified annotations in a prior version of the source code to determine if the annotations may be migrated to any portions of the modified source code. The comparison includes an exact match and a partial match. With respect to the partial match, a threshold value is employed to define the parameters of a partial match. All annotations that are determine to be an exact match or a partial match are automatically migrated to a location in the modified source code determine to match within the threshold value.

Transferring annotations across versions of the data

For a source file on which basis a binary object file has been generated, a digital signature is generated for the source file, and the digital signature is stored. The digital signature may be secure hash algorithm (SHA) hash values. The binary object file is output. To verify that the binary object file has been generated from the source file, a digital signature is generated for the source file, and compared to the digital signature for the source file as previously stored. Where the digital signature for the source file as has been generated matches the digital signature for the source file previously stored, the binary object file is indicated as having been generated from the source file.

Verifying that binary object file has been generated from source files

A method and system for maximizing connectivity within members of a group, or for example a clique, in polynomial time. Vertices representing inter-connectivity of each member are placed on a graph in descending order. Least connected members are systematically removed from the graph until the connectivity count of a least connected vertex is equal to a quantity of vertices remaining in the graph. Following the removal of a vertex from the graph, an update of the inter-connectivity of each member on the graph is performed. Accordingly, when the connectivity count of a least connected vertex is equal to a quantity of vertices remaining in the graph a clique with maximum inter-connectivity has been achieved.

Maximum clique in a graph

A method, apparatus, and article of manufacture to dynamically address and resolve an improper shut-down of an application. Internal state data of the application is stored in persistent memory. New internal state data is dynamically created and authenticated following an improper shut-down of the application. Responsive to the authentication, the application is re-started with the authenticated new internal state data, without being subject to an immediate improper shut-down.

Application failure recovery

A method and computer system for efficiently backing up data in a computer network. Multiple resources are grouped into nodes wherein each node includes a network adapter for allowing the node to communicate with the computer system. Each node includes a storage device, or multiple storage devices. The storage devices of each node are mapped with mirrors to form a logical volume. At least one mirror, also known as a plex is connected to both the logical volume and a network adapter for the respective node. For backup of data, the source node sends data to a target node through the network adapter. The target nodes receives data from the plex through the network adapter. In communication with the network adapter and the volume, the plex of the target node is configured to be a feed plex in that it acts as a communication pipe between the network adapter and the target node volume. Additionally, the target node volume is configured to be a feed volume for receiving data from a source node, wherein the data is replicated across all of the mirrors of the feed volume. In data restoration, the feed plex of the target node is configured as a plex and sends data from the feed volume of the target node to the network adapter. The plex of the source node in communication with the network adapter is now designated as a feed plex and the volume of the source node is now designated as a feed volume. The data from the network adapter of the source node is sent to the feed plex where it is sent to the associated feed volume. Accordingly, the direct communication of the plex of the source node and the target node with the respective network adapter provides for transfer of data across a kernel layer of both nodes without the need to access a user layer.

Growing community of inventors

Beaverton, OR, United States of America

Ramachandra N Pai