Richard J Swetz, 77North Port, FL

6961782, Nov 1, 2005

Mar 14, 2000

09/525707

Monty M. Denneau - Brewster NY, US
Peter H. Hochschild - New York NY, US
Richard A. Swetz - Mahopac NY, US

International Business Machines Corporation - Armonk NY

G06F015/173

709241, 370351, 370380, 370400, 712 11

There is provided a method for routing packets on a linear array of N processors connected in a nearest neighbor configuration. The method includes the step of, for each end processor of the array, connecting unused outputs to corresponding unused inputs. For each axis required to directly route a packet from a source to a destination processor, the following steps are performed. It is determined whether a result of directly sending a packet from an initial processor to a target processor is less than or greater than N/2 moves, respectively. The initial processor is the source processor in the first axis, and the target processor is the destination processor in the last axis. The packet is directly sent from the initial processor to the target processor, when the result is less than N/2 moves. The packet is indirectly sent so as to wrap around each end processor, when the result is greater than N/2 moves. The method may optionally include the step of randomly sending the packet using either of the sending steps, when the result is equal to N/2 moves and N is an even number.

7477608, Jan 13, 2009

Jul 21, 2005

11/186693

Monty M. Denneau - Brewster NY, US
Peter H. Hochschild - New York NY, US
Richard A. Swetz - Mahopac NY, US

International Business Machines Corporation - Armonk NY

H04L 12/26
H04L 12/66
G06F 15/00

370241, 370353, 370380, 370400, 712 11

There is provided a method for routing packets on a linear of N processors connected in a nearest neighbor configuration. The method includes the step of, for each end processor of the array, connecting unused outputs to corresponding unused inputs. For each axis required to directly route a packet from a source to a destination processor, the following steps are performed. It is determined whether a result of directly sending a packet from an initial processor to a target processor is less than or greater than N/2 moves, respectively. The initial processor is the source processor in the first axis, and the target processor is the destination processor in the last axis. The packet is directly sent from the initial processor to the target processor, when the result is less than N/2 moves. The packet is indirectly sent so as to wrap around each end processor, when the result is greater than N/2 moves. The method may optionally include the step of randomly sending the packet using either of the sending steps, when the result is equal to N/2 moves and N is an even number.

8001401, Aug 16, 2011

Jun 26, 2007

11/768752

Ralph E. Bellofatto - Ridgefield CT, US
Paul W. Coteus - Yorktown Heights NY, US
Paul G. Crumley - Yorktown Heights NY, US
Alan G. Gara - Mount Kidsco NY, US
Mark E. Giampapa - Irvington NY, US
Thomas M. Gooding - Rochester MN, US
Rudolf A. Haring - Cortlandt Manor NY, US
Mark G. Megerian - Rochester MN, US
Martin Ohmacht - Yorktown Heights NY, US
Don D. Reed - Mantorville MN, US
Richard A. Swetz - Mahopac NY, US
Todd Takken - Brewster NY, US

International Business Machines Corporation - Armonk NY

G06F 1/26

713320, 713300, 713310, 713321, 713322, 713323, 713324, 713330, 713340

An apparatus and method for controlling power usage in a computer includes a plurality of computers communicating with a local control device, and a power source supplying power to the local control device and the computer. A plurality of sensors communicate with the computer for ascertaining power usage of the computer, and a system control device communicates with the computer for controlling power usage of the computer.