International Business Machines Corporation

Anthony John O'Dowd

Andrew John Coleman

Stephen James Hobson

Paul Kettley

Peter Siddall

Steven Powell

Martin R Naish

James H Warnes

Paul G Clarke

Michael J A Johnson

Amardeep S Bhattal

Neil Kenneth Johnston

Mayur Raja

Michael Johnson

Morag Ann Hughson

Stephen B Toledo-Brown

David J Gorman

Stephen Benjamin Toledo-Brown

David John Gorman

An example operation may include one or more of constructing a transaction proposal and sending the constructed transaction proposal to a plurality of endorsing nodes, by a client application of a computing system, wherein inputs to the transaction proposal are named using a blockchain naming system (BNS), receiving a set of transaction responses from the plurality of endorsing nodes, by the client application of the computing system, the transaction responses each comprising a transaction validation function, assembling the received transaction responses into a transaction, by the client application of the computing system, and sending the transaction to an orderer node for distribution, by the client application of the computing system.

Distributed computing and storage network implementing high integrity, high bandwidth, low latency, secure processing

An example operation may include one or more of constructing a transaction proposal, by a computing system, wherein inputs to the transaction proposal are named using a blockchain naming system (BNS) that comprises ledger state addressing, oracles for addressing external data values, and user state addressing, the BNS providing a standard mechanism to name all blockchain resources using a universal resource indicator (URI).

The invention relates to tracing the execution path of a computer program comprising at least one module including a plurality of instructions. At least one of these instructions is a branch instruction. Each branch instruction is identified and evaluated to be one of true and false. An evaluation of true results in a unique identifier being pushed into a predefined area of storage. This unique identifier is associated with the instructions executed as a result of an evaluation of true.

Tracing the execution path of a computer program

Provided are methods, apparatus and computer programs for monitoring operational data relating to a sequence of data processing operations in a network of data processing units. In response to specified boundaries for data gathering, operational data is selectively gathered into discrete data partitions for a desired time period, a desired set of processing nodes, and/or a desired set of process executions. A set of event listeners invoke operations of a data gatherer in response to events within a processing sequence and the data gatherer allocates operational data to different ones of a set of discrete logical data containers in response to notifications from the event listeners. The data collection is responsive to system events such as a collection interval expiry to end data collection for a first partition and start data collection for a second partition.

Monitoring operational data in data processing systems

A method and apparatus for communicating message data between a plurality of subsystems () in the form of distributed resource managers. The subsystems are coupled together through a coupling means () with a shared memory with at least one shared queue () in the shared memory. Access to the shared queue () is available from each of the coupled subsystems and message data can be communicated between the subsystems via the shared queue (). Each subsystem has a long running process () checking the shared queue for messages for that subsystem.

Method and apparatus for communication of message data using shared queues

Provided are methods, data communication apparatus and computer programs for managing communications between a remote communication manager and a set of communications managers in an associated group. The group of communication managers have shared access to resources which enable any communication manager in the group to recover from failures experienced by another communication manager in the group. In particular, recovery of failed inbound and outbound channels is achieved with the advantage of improved availability of data transmissions. Preferably, the recovery uses synchronization information to ensure that data is recovered to a consistent state to that channel recovery is achieved without loss of data integrity.

Recovery following process or system failure

Provided are a method and apparatus for providing serialization support for computer systems and computer system resources, in particular for application programs which require sequencing and/or consistency of data. The computer system resource includes serialized processes with units of work. A serialization token is provided at the start of a serialized process including at least one unit of work. The serialization token remains in force until the or all of the units of work of the process have been committed or rolled back. The serialization token controls the commencement of other processes of the computer system during the time that it is in force. The serialization is carried out by storing an abstract representation of the process to be serialized in storage which is accessible by all the programs and computers where the serialization applies. In this way, if a process fails, the serialization token remains in force until the process has recovered and has committed or rolled back the units of work in the process. The serialization token can allow only a single thread process or, alternatively, the serialization token can allow a multiple thread process in which the threads have the same serialization token which allows for multiple users.

Growing community of inventors

Winchester, United Kingdom

Anthony John O'Dowd