International Business Machines Corporation

Kevin J Reilly

Robert Francis Bartfai

Nicholas P Rash

Randal Craig Swanberg

Steven Leonard Roberts

Brad L Brech

Sunil Jeevananda Kamath

Michael E Daley

Leslie Png

Alise Spence

Jay Robert Herring

Mark G Atkins

Craig Brian Stunkel

Aruna V Ramanan

LeRoy R Lundin

John Divirgilio

John W Doxtader

David G Folsom

Mark Gurevich

Laura J Merritt

Derrick LeRoy Garmire

Francis Alfred Kampf

Peter J LeVangia

Thomas Anthony Gregg

David F Craddock

Bulent Abali

Carl Alfred Bender

Emanuele Ragnoli

John Sheehan

Mustafa Rafique

Various embodiments are provided for managing cryptographic bottlenecks for distributed multi-signature blockchain contracts in a computing environment. One or more cryptographic bottlenecks of cryptographic requests at a cryptographic accelerator may be resolved by switching between a blockchain node cryptographic library and an accelerator cryptographic library upon a number of the cryptographic requests at the accelerator exceeding a defined threshold.

Resolving cryptographic bottlenecks for distributed multi-signature contracts shared with cryptographic accelerators by switching between local and accelerator cryptographic libraries

An electronic product can be configured by a method that includes attaching a machine-readable identification (ID) tag containing an ID code to a hardware unit of the electronic product. The ID code is associated with a particular configuration of the electronic product, and can be read or scanned with a mobile device configured to send the ID code to a provider server device. In response to receiving the ID code, the provider server device can send product configuration instructions and a product configuration application to the mobile device. The product configuration instructions can guide a user through a customized series of electronic product configuration operations. The product configuration application can assist the user in performing configuration operations, can provide customized configuration help, and can establish a wireless link between the mobile device and the electronic product, allowing the user to interact with the electronic product.

Customized electronic product configuration

A low-latency queue pair (QP) is provided for I/O Adapters that eliminates the overhead associated with work queue elements (WQEs) and defines the mechanisms necessary to allow the placement of the message directly on the queue pair.

Low latency queue pairs for I/O adapters

A method, and a system for implementing the method, for implementing the method, for determining if a wire has been miswired in a network comprising service nodes and switch elements. The method includes the steps of: (1) transmitting a transmission stream in an outbound route, (where this transmission stream includes one or more service node fields for one or more service nodes, one or more switch element fields for one or more switch elements connected to the one or more service nodes, and a port field for each the switch element); (2) if the transmission stream is received on a port at a the switch element different than a the port field for the switch element indicated by the transmission stream, then setting an error indicator in the transmission stream; (3) transmitting the transmission stream back to the one or more service nodes in a return route, where the one or more service nodes determine from the error indicator a miswired condition between the receiving switch element and a previous switch element or service node along the outbound route. The one or more service nodes can record, store and tabulate the miswired condition and one or more additional miswired conditions. The transmission stream can store the one or more switch element fields for the one or more switch elements and the port fields for each the switch element separately for a path comprising the outbound route and a path comprising the return route.

Mechanism and procedure for detecting switch mis-cabling

Messages are sent from a primary node of a computer system to one or more distribution nodes of the system. Each of the distribution nodes then further sends the message to one or more other nodes of the computer system. After receipt of the message, the other nodes forward an acknowledgement to the particular distribution node, which sent the message. The distribution nodes collect their respective acknowledgements, and when all of the expected acknowledgements are received by a distribution node, the distribution node sends one acknowledgement to the primary node. The one acknowledgement indicates receipt of the message by the other nodes.

Message distribution capability which uses distribution nodes to collect

A method for substantially preventing routing deadlocks and reliably routing service messages in a network comprised of successive stages of cross-point switches which collectively interconnect a plurality of nodes external to the network, wherein at least one service message is carried between one of the nodes and one of the cross-point switches over a route through the network, including the steps of defining a plurality of routes through the network such that at least one service message can be carried from individual nodes within the plurality of nodes over different corresponding ones of the routes to every cross-point switch within the network, wherein each of the defined routes extends over at least one link; duplicating a message to be routed through the network; and imposing routing restrictions on at least one of the cross-point switches in the network.

Method for deadlock free and and reliable routing in a packet switched

A method, associated apparatus and program product for partitioning a plurality of interconnection elements among disjoint partitions of processors in a computer system so as to interconnect the processors within each of the disjoint partitions, and to isolate the processors in each interconnected partition from processors in the other partitions. The interconnection elements may be arranged into groups including node coupling elements and link coupling elements and in larger systems may include intermediate groups having intermediate coupling elements. The partitioning of the interconnection elements begins with the interconnection of processors in the largest disjoint partition and proceeds by connecting the successive largest processor partitions whose interconnection elements share a group with the interconnect elements used for the previously interconnected processor partitions until no such interconnect elements on shared groups remain, subsequently the process is repeated until all processors in the disjoint partitions are interconnected.

Method and apparatus for partitioning an interconnection medium in a

An apparatus for synchronizing operator commands with a failover process in a distributed system having a control workstation and a plurality of nodes. One of the nodes of the distributed system is designated a primary node and one of the nodes is designated a backup node. The backup node includes a backup daemon for performing a failover process if the primary node fails such that the backup node becomes the primary node. Shell scripts send a command string to be synchronized with the operation of the backup daemon from the control workstation to the backup node. The backup daemon is then checked to determine if the backup daemon is sleeping, and, in the event the backup daemon is sleeping, commands derived from the command string are enqueued in a work queue for processing by the backup daemon. The backup daemon is then awakened such that the derived commands in the work queue are processed. In the event that the backup daemon is busy, commands derived from the command string are failed, thereby synchronizing the derived commands with the processing of the backup daemon.

Apparatus for synchronizing operator initiated commands with a failover

A quiesced and synchronous distributed data processing system includes a primary node, a secondary node and a switch between the primary and secondary nodes. The TOD for the primary node is set depending on the system. The invention sets the TOD for the switch based on the TOD of the primary node. The primary node then verifies the switch TOD. If verified, the TOD for the secondary node is set, based on the TOD of the primary node. Finally, the secondary node self-verifies its TOD.

Verifying a time-of-day counter

Growing community of inventors

Kingston, NY, United States of America

Kevin J Reilly