International Business Machines Corporation

Mark Francis Wilding

Alexander Abrashkevich

Matthew Albert Huras

Dmitri Abrashkevich

Kenneth Wayne Boyd

Thomas James Heller, Jr

Robert Frederic Kern

Robert J Blainey

Jeffrey William Palm

Edward Van Gennip

William Frank Micka

Guy Maring Lohman

David Michael Shackelford

Michael Peter Etgen

Randall William Horman

John Hudson Bailey

Robert Alan Begg

Donna Eng Dillenberger

Daniel Alan Wood

Frederick O G Van Veen

Albert Grankin

Michael LaVerne Wamboldt

Daniel D Behman

David C Kalmuk

Rajeev Gupta

Natwar Modani

Donna N Eng Dillenberger

Sean Chen

James B Cottingham

Vijaya Ratnala

Murray Frederick Chislett

John Paul Parkin

Laurent Sebastien Mignet

Robin Grosman

Stephen Rees

David Richard Godwin

Joseph Serge Limoges

Dominique Jeremy Evans

Herbert Walter Pereyra

Roger Luo Quan Zheng

John Paul Kennedy

Tanveer Fathima Mahmood

Yogendra K Srivastava

C Brian Hall

Andriy Vladimir Miranskyy

Blair K Adamache

Alexandra G Bialek

Yung Chung

Sridhar Munireddy

Dale J Hagen

Stephen A Schormann

Matthew Davison

Mechelle Sophia Gittens

Nazim H Madhavji

Ralph James Bateman

Yinghua (Amy) Tang

Embodiments of the present invention provide a method, system and computer program product for software prioritization of concurrent transactions for embedded conflict arbitration in transactional memory management. In an embodiment of the invention, a method for software prioritization of concurrent transactions for embedded conflict arbitration in transactional memory management can include setting different hardware registers with different priority values for correspondingly different transactions in a transactional memory system configured for transactional memory management according to respective priority values specified by priority assignment logic in external software support for the system. The method also can include detecting a conflict amongst the transactions in the system. Finally, the method can include applying conflict arbitration within the system based upon the priority values specified by the priority assignment logic in the external software support for the system.

Prioritization for conflict arbitration in transactional memory management

A method () or a diagnostic recording device () having transactional memory and a processor coupled to the transactional memory can store () contents of a transaction log () of the transactional memory, detect () an exception event, and replay () last instructions that led up to the exception event using a debugger tool (). The transactional memory can be hardware or software based transactional memory. The processor can also store the transaction log by storing the contents of the transaction log in a core file () which can include a stack (), a register dump (), a memory dump (), and the transactional log. The debugger tool can be used to load up the core file, an executable file (), and a library () to enable the diagnostic recording device to retrace transactions occurring at the diagnostic recording device up to the exception event.

Method and apparatus for diagnostic recording using transactional memory

A method and apparatus for directing a client to establish a secure connection with a server across a public network. The server and the client exchange a Server Authentication Public Key, a Client Authentication Public Key, and a Remote Service Unique Identifier (RSUID) during a registration process. In one embodiment, the method includes the client transmitting to the server a client information package having the RSUID and a client challenge information package encrypted with the Server Authentication Public Key, the client receiving from the server a server information package having the RSUID and a server challenge information package and a portion of the received client challenge information encrypted with the Client Authentication Public Key, the client decrypting and verifying the server challenge information package with the Client Authentication Private Key, and, the client transmitting to the server an encrypted portion of the received client challenge information.

System and method for secure remote access

A system, method and facility for manipulating registries on a computer system. The system includes a generic registry facility, which features functions classified according to the breadth of their applicability to varying types of registries. The registries may be classified as file-based and proprietary. The file-based registries may be binary or text-based. The generic registry facility provides a library of generic registry facility functions that may be included in a specific registry manipulation module through which a computer program can manipulate a specific registry. The generic registry facility functions may be customized by the developer of the registry manipulation module for a specific registry. The functions may include an action verification function that includes a commit sequence for ensuring that requested changes to a registry are made successfully. The functions may also include a trigger function for triggering events upon the occurrence of a change to a registry.

System and method for manipulating a registry

Some aspects of the invention provide methods, systems, and computer program products for inserting an encrypted problem signature into a symptom database. A problem signature is first provided, which is then used to derive a hash value. The problem signature is then encrypted using the hash value. The hash value is further used to indicate the location in the database to insert the problem signature. The problem signature is then inserted at the location in the database indicated by the location.

Method and system for content-based encrypted access to a database

Providing extended or end-to-end data integrity through layers of a system. In one aspect, information is to be transmitted between an application end of the system and a physical storage medium that stores the information for a database of the system, the information to be transmitted via a database server in a database server layer of the system. At least a portion of data protection is provided for the information, the data protection causing the information to be protected from corruption between a system layer and the physical storage medium, where the system layer is a separate layer provided closer to the application end of the system than the database server layer.

Method and system providing extended and end-to-end data integrity through database and other system layers

Embodiments of the invention provide a method for regaining memory consistency after a trap via transactional memory. Transactional memory and a transactional memory log are used to undo changes made to memory from a transaction start point up to the point of a trap event. After the trap event is processed, and the changes are rolled back, the program can resume execution at the beginning of the transaction.

Methods, apparatus and articles of manufacture for regaining memory consistency after a trap via transactional memory

A dynamic status tree facility for providing status information about one or more systems. The facility includes a tree data structure and methods for manipulating the data structure. The facility is accessible to provider processes using a set of provider interface methods. The facility is accessible to consumer processes using a set of consumer interface methods. The tree data structure is defined by nodes stored in shared memory and attached to by way of a defined data structure made available to the provider and consumer interface methods. The nodes in the tree data structure are defined to have a control block and a variable set of export data. The export data for any one node is specified by a variable in the control block. Certain of the exported data in the tree is representable in a format selected to have one of four defined properties.

Dynamic status tree facility

A method for implementing distributed database management system operations on a computer cluster. The method includes defining ownership relationships between a plurality of computers in the computer cluster and a plurality of data nodes in the computer cluster, wherein a distributed database management system operation can be directly carried out by a first computer only on those data nodes owned by the first computer. The method further includes monitoring database usage characteristics. The method further includes carrying out a re-architecture step in response to the database usage characteristics by redefining ownership relationships to improve the efficiency of the distributed database management system operations.

Dynamic cluster database architecture

distributed database management system implemented on a cluster of computers. The cluster including disks organized as data nodes. The data nodes being locally connected to one or more computers in the cluster. The distributed database management system includes a distributed database manager layer having a lock manager, a resource manager, and an architecture manager. The lock manager serializes access to the data nodes in the cluster. The resource manager maintains a data representation of the resources of each computer in the cluster and makes the data available to other computers in the cluster to facilitate access to the resources by the other computers. The architecture manager defines logical ownership relationships between data nodes and computers in the cluster to permit the architecture of the database to be dynamically reconfigured to provide improved performance.

A method for implementing a set of database management components in a distributed database management system, the distributed database management system being implemented on a computer cluster. The method includes managing resources associated with an associated computer, the associated computer being one of a plurality of computers in the computer cluster. The method also includes managing locks on data stored on a plurality of associated data nodes coupled to the associated computer, wherein the associated data nodes are data nodes of a plurality of data nodes in the computer cluster. The method also includes specifying logical connections for the plurality of associated data nodes.

Disclosed herein is a data processing system-implemented method, a data processing system, and an article of manufacture for investigating computer software. The data processing system-implemented method includes capturing tracing information at one or more boundary points of the computer software, and reproducing a behavior of the computer software at the boundary points based on the captured tracing information.

System for boundary trace with reproduction facility

The invention finds matches in ordered sequences, e.g. program function call stacks from anomalous software program executions for discovering related or identical software flaws and possible known solutions. Call stacks are matched after removing recursive and uninformative subpatterns, e.g. names of common error handling routines, to see if they were generated due to the same possibly known problem. Sequences statistically unlikely to be matches are pruned from the search. Matches found earlier in the sequences may be weighted differently, e.g. to be more important in call stacks, than other matches. Sequences are indexed so that those relevant to a query are identified automatically without detailed exhaustive search. Maximum matches are found by optimizing a cost function based on weighted sequence similarity.

System and method for matching a plurality of ordered sequences with applications to call stack analysis to identify known software problems

A data structure, method and system are provided incorporating a general purpose memory allocator and defensive heap memory manager. This provides an ability to reliably detect various types of memory errors, dynamically enable or disable memory debugging, enhance success of read and write operations using various memory verification techniques. Further, through separation of control information associated with allocated and free chunks of memory from the chunks themselves (separation of metadata from actual data), enhanced protection of vital information about the heap memory layout in general is provided. The heap memory manager uses read, write, and execute protected heap header walls and pool header walls and may, for each pool and memory block, separately use hidden front and back Memory Debug Information Areas (MDIAs) with checksums and well-known signature fields thereby enhancing overall memory management.

Defensive heap memory management

A computer implemented method, apparatus, and computer usable program code for performing software testing. A first set of traces is compressed to form a first set of compressed traces. The first set of compressed traces is compared to a plurality of additional traces to identify a set of partially matching traces within the plurality of additional traces. The first set of traces is compressed to form a second set of compressed traces. The second set of compressed traces is compressed according to a technique such that the second set of compressed traces contains more information than the first set of compressed traces. The second set of compressed traces is compared to the set of partially matching traces to identify a second set of partially matching traces within the set of partially matching traces. The second set of partially matching traces is placed in a memory.

Computer software test coverage analysis

Growing community of inventors

Barrie, Canada

Mark Francis Wilding