International Business Machines Corporation

Robert F Enenkel

Christopher Anand

Timothy John Slegel

Eric M Schwarz

Jonathan D Bradbury

Michael Peter Perrone

Robert L Goldiez

Lucas Dutton

Simon Christopher Broadhead

Adele Olejarz

Jose Eduardo Moreira

Bruce Martin Fleischer

Roch Georges Archambault

Fred Gehrung Gustavson

Ronald Ian McIntosh

James Lawrence McInnes

Allan Russell Martin

Mark Peter Mendell

Robert William Hay

Daniel M Zabawa

T J Christopher Ward

Tj Christopher Ward

Anuroop Sharma

A method, computer program product, and a computer system are disclosed for processing information using hardware instructions in a processor of a computer system by performing a hardware reduction instruction using an input to calculate at least one range reduction factor of the input; performing a hardware restoration instruction using the input to calculate at least one range restoration factor of the input; and performing a final fused multiply add (FMA) type of hardware instruction or a multiply (FM) hardware instruction by combining an approximation based on a value reduced by the at least one range reduction factor with the at least one range restoration factor.

Load exploitation and improved pipelineability of hardware instructions

A method is disclosed to simulate operation of a grid structure. The method includes specifying a type of simulation to be performed and at least one initial condition with a user interface of a device such as a mobile device, where the grid structure comprises at least one of a power generation grid and a power distribution grid. The method further includes transmitting the specified type of simulation and the at least one initial condition from the user device to a computing platform; receiving from the computing platform a result of the simulation at the user device; and visualizing the result of the simulation with the user interface. The type of simulation can be an N-k contingency analysis simulation, where k is equal to zero, 1 or greater than 1.

Method, computer program and system providing real-time power grid hypothesis testing and contingency planning

A data processing system includes a user interface with a user input configured to enable a user to specify a type of simulation to be performed and at least one initial condition, where the simulation is executed using at least one sensor input from a grid structure composed of at least one of a power transmission and distribution grid. The user interface further has a display configured to visualize a representation of a result of a simulation of at least one scenario by presenting a multi-dimensional representation comprised of indicators, where each indicator corresponds to at least one simulation result. The user interface responds to a selection of one of the indicators by the user to visualize a result of the corresponding simulation. The type of simulation can be an N&#x2212;k contingency analysis simulation, where k is equal to zero, 1 or greater than 1.

A Vector Element Rotate and Insert Under Mask instruction. Each element of a second operand of the instruction is rotated in a specified direction by a specified number of bits. For each bit in a third operand of the instruction that is set to one, the corresponding bit of the rotated elements in the second operand replaces the corresponding bit in a first operand of the instruction.

Vector element rotate and insert under mask instruction

A Vector Generate Mask instruction. For each element in the first operand, a bit mask is generated. The mask includes bits set to a selected value starting at a position specified by a first field of the instruction and ending at a position specified by a second field of the instruction.

Vector generate mask instruction

Methods of bit manipulation within a computer processor are disclosed. Improved flexibility in bit manipulation proves helpful in computing elementary functions critical to the performance of many programs and for other applications. In one embodiment, a unit of input data is shifted/rotated and multiple non-contiguous bit fields from the unit of input data are inserted in an output register. In another embodiment, one of two units of input data is optionally shifted or rotated, the two units of input data are partitioned into a plurality of bit fields, bitwise operations are performed on each bit field, and pairs of bit fields are combined with either an AND or an OR bitwise operation. Embodiments are also disclosed to simultaneously perform these processes on multiple units and pairs of units of input data in a Single Input, Multiple Data processing environment capable of performing logical operations on floating point data.

Generalized bit manipulation instructions for a computer processor

A set of instructions for implementation in a floating-point unit or other computer processor hardware is disclosed herein. In one embodiment, an extended-range fused multiply-add operation, a first look-up operation, and a second look-up operation are each embodied in hardware instructions configured to be operably executed in a processor. These operations are accompanied by a table which provides a set of defined values in response to various function types, supporting the computation of elementary functions such as reciprocal, square, cube, fourth roots and their reciprocals, exponential, and logarithmic functions. By allowing each of these functions to be computed with a hardware instruction, branching and predicated execution may be reduced or eliminated, while also permitting the use of distributed instructions across a number of execution units.

Hardware instructions to accelerate table-driven mathematical computation of reciprocal square, cube, forth root and their reciprocal functions, and the evaluation of exponential and logarithmic families of functions

A method and arrangements for increased precision in the computation of a reciprocal square root is disclosed. In accordance with the present invention, it is possible to achieve fifty three (53) bits of precision in less processing time than previously possible.

Increased precision in the computation of a reciprocal square root

A method, apparatus, and computer instructions for processing instructions. A data dependency graph is built. The data dependency graph is analyzed for recurrences, and unpipelined instructions that lie outside of the recurrences are expanded.

Method and apparatus for determining the profitability of expanding unpipelined instructions

A processor for performing a multiply-add instruction on a multiplicand A, a multiplier B, and an addend C, to calculate a result D. The operands are double-precision floating point numbers and the result D is a canonical-form extended-precision floating point number having a high order component and a low order component. The processor is a fused multiply-add processor with a multiplier, an adder, a normalizer and a rounder. The post-adder data path, the normalizer and the rounder each have a data width sufficient to represent post-adder intermediate results to permit the high and low order words of a correctly-rounded result D to be computed. The mantissas of the extended-precision result D are provided such that the high order word mantissa is stored to double precision registers.

Growing community of inventors

Markham, Canada

Robert F Enenkel