International Business Machines Corporation

Thomas Schlipf

Rolf Fritz

Thomas Anthony Gregg

David F Craddock

Matthias Klein

Markus Helms

Sascha Junghans

Christoph Raisch

Kenneth Wayne Boyd

Richard Loise Arndt

Ulrich Mayer

Ronald Edward Fuhs

Gerhard Banzhaf

Christine Axnix

Helmut H Weber

Rolf B Hilgendorf

Gerd Konrad Bayer

Juergen Probst

Klaus Theurich

Maor Ben-Dayan

Juergen Erwin Maergner

Wolfgang Eckert

Andreas Muller

Daniel Thiele

Steven Mark Thurber

Richard Louis Arndt

Mircea R Gusat

Martin Eckert

Patricia Maria Sagmeister

Maria Gabrani

Daniel D Sentler

Kirk David Lamb

Rainer Dorsch

Manfred Walz

Wolfgang Emil Denzel

Walter Heinrich Lipponer

Christopher S Smith

Thomas Buechner

Hartmut Ulland

Andreas Christian Döring

Siegfried Neuber

Jurgen Hass

Stephan Christopher Smith

Harmut Ulland

Jürgen Märgner

Creating hash values based on bit values of an input vector. An apparatus includes a first and a second hash table, a first and second hash function generator adapted to configure a respective hash function for a creation of a first and second hash value based on the bit values of the input vector. The hash values are stored in the respective hash tables. An evaluation unit includes a comparison unit to compare a respective effectiveness of the first hash function and the second hash function, and an exchanging unit responsive to the comparison unit adapted to replace the first hash function by the second hash function.

Dynamic evaluation and adaption of hardware hash function

Dynamic evaluation and adaption of hardware hash functions

An improved method to compensate for coupling overhead in a distributed computing system offering a raw processing capacity, comprising an effective processing capacity () and the coupling overhead, is disclosed, wherein the distributed computing system comprises at least one computer system and at least one coupling facility. The method comprises determining a coupling efficiency, determining and adding an amount of missing processing capacity to the effective processing capacity based on the coupling efficiency in a way that the effective processing capacity of the raw processing capacity corresponds to a billable target processing capacity.

Method, data processing program, and computer program product to compensate for coupling overhead in a distributed computing system, and corresponding overhead calculator for a distributed computing system and corresponding computer system

An approach for processing data by a pipeline of a single hardware-implemented virtual multiple instance finite state machine (VMI FSM) is presented. Based on a current state and context of an FSM instance, an input token selected from multiple input tokens to enter a pipeline of the VMI FSM, and a status of an environment, a new state of the FSM instance is determined and an output token is determined. The input token includes a reference to the FSM instance. In one embodiment, the reference is an InfiniBand QP number. After a receipt by the pipeline of the first input token and prior to determining the new state of the FSM instance and determining the output token, a logic circuit selects a second input token to enter the pipeline. The second input token includes a reference to a second FSM instance.

Efficiently implementing a plurality of finite state machines

For block based end-to-end data protection for extended count key data (ECKD) in a computing environment, information units (IU's) are aligned in a block boundary format. Block protection trailer data is added to each one of the IU's.

Blocked based end-to-end data protection for extended count key data (ECKD)

A method and program product for processing data by a pipeline of a single hardware-implemented virtual multiple instance finite state machine (VMI FSM). An input token of multiple input tokens is selected to enter a pipeline of the VMI FSM. The input token includes a reference to an FSM instance. In one embodiment, the reference is an InfiniBand QP number. After being received at the pipeline, a current state and context of the FSM instance are fetched from an array based on the reference and inserted into a field of the input token. A new state of the FSM instance is determined and an output token is generated. The new state and the output token are based on the current state, context, a first input value, and an availability of a resource. The new state of the first FSM instance is written to the array.

Exemplary method, system, and computer program product embodiments for block based end-to-end data protection for extended count key data (ECKD) in a computing environment are provided. In one embodiment, by way of example only, information units (IU's) are aligned in a block boundary format. Block protection trailer data is added to each one of the IU's. Additional system and computer program product embodiments are disclosed and provide related advantages.

A method and apparatus for processing data by a pipeline of a virtual multiple instance extended finite state machine (VMI EFSM). An input token is selected to enter the pipeline. The input token includes a reference to an EFSM instance, an extended command, and an operation code. The EFSM instance requires the resource to be available to generate an output token from the input token. In response to receiving an indication that the resource is unavailable, the input token is sent to a wait room or an initiative token containing the reference and the operation code is sent to a wait queue, and the output token is not generated. Without stalling and restarting the pipeline, another input token is processed in the pipeline while the resource is unavailable and while the input token is in the wait room or the initiative token is in the wait queue.

Virtual multiple instance extended finite state machines with wait rooms and/or wait queues

A receive queue provided in a computer system holds work completion information and message data together. An InfiniBand hardware adapter sends a single CQE+message data to the computer system that includes the completion Information and data. This information is sufficient for the computer system to receive and process the data message, thereby providing a highly scalable low latency receiving mechanism.

Adaptive low latency receive queues

A method and logic circuit for a resource management finite state machine (RM FSM) managing resource(s) required by a protocol FSM. After receiving a resource request vector, the RM FSM determines not all of the required resource(s) are available. The protocol FSM transitions to a new state, generates an output vector, and loads the output vector into an output register. The RM FSM transitions to a state indicating that not all the resources are available and freezes an input register. In a subsequent cycle, the RM FSM freezes the output register and a current state register, and forces the output vector to be seen by the FSM environment as a null token. After determining that the required resource(s) are available, the RM FSM transitions to another state indicating that the resources are available, enables the output vector to be seen by the FSM environment, and unfreezes the protocol FSM.

Resource management finite state machine for handling resource management tasks separate from a protocol finite state machine

A computer implemented method, apparatus and mechanism for recovery of an I/O fabric that has become terminally congested or deadlocked due to a failure which causes buffers/queues to fill and thereby causes the root complexes to lose access to their I/O subsystems. Upon detection of a terminally congested or deadlocked transmit queue, access to such queue by other root complexes is suspended while each item in the queue is examined and processed accordingly. Store requests and DMA read reply packets in the queue are discarded, and load requests in the queue are processed by returning a special completion package. Access to the queue by the root complexes is then resumed.

Mechanism for detecting and clearing I/O fabric lockup conditions for error recovery

A method for monitoring data congestion in a computer network with multiple nodes and for controlling data transmission in the computer network. The method includes generating a congestion notification by the node which detects a data congestion and transmitting the congestion notification to the data source which is involved in the data congestion. The method also includes generating in the data source a congestion value which indicates how severe the data congestion is, and storing in a worst case array of the data source those congestion values which indicate the most severe data congestions.

Method for monitoring data congestion in a computer network with multiple nodes and method for controlling data transmission in the computer network

Growing community of inventors

Holzgerlingen, Germany

Thomas Schlipf