Patent US5963745A successfully refreshed from Google Patents.
US5963745A
Expired / Lapsed
US
⏱️ 0.0 years remaining
APAP I/O programmable router
Assignee: International Business Machines Corp
•
Filing: 1995-04-27
•
Granted: 1999-10-05
•
Expires: 2015-04-27
Abstract
Abstract A parallel array processor for massively parallel applications is formed with low power CMOS with DRAM processing while incorporating processing elements on a single chip. Eight processor memory elements on a single chip have their own associated processing element, significant memory, and I/O and are interconnected with a hypercube based, but modified, topology. These nodes are then interconnected, either by a hypercube, modified hypercube, or ring, or ring within ring network topology. The architecture uses all the pins for networking. Each chip has eight 16 bit processors, and eight respective 32K memories. I/O has three internal ports and one external port shared by the plural processors on the chip. Significant software flexibility is provided to enable quick implementation of existing programs written in common languages. The scalable chip has internal and external connections for broadcast and asynchronous SIMD, MIMD and SIMIMD (SIMD/MIMD) with dynamic switching of modes. A fully distributed programmable router is provided by the processing memory elements that form a node. There is program compatibility for the fully scalable system.
Inventors
- 👤 Clive Allan Collins
- 👤 Michael Charles Dapp
- 👤 James Warren Dieffenderfer
- 👤 David Christopher Kuchinski
- 👤 Billy Jack Knowles
- 👤 Richard Edward Nier
- 👤 Eric Eugene Retter
- 👤 Robert Reist Richardson
- 👤 David Bruce Rolfe
- 👤 Vincent John Smoral
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-31 04:01
CPC Classifications
G; G06; G06F; G06F15/00; G06F15/16; G06F15/163; G06F15/173; G06F15/17337; G06F15/17343; G06F15/17356; G06F15/17368; G06F15/17381; G06F15/76; G06F15/80; G06F15/8007; G06F15/8015; G06F15/803; G06F7/00; G06F7/38; G06F7/48; G06F7/483; G06F9/00; G06F9/06; G06F9/30; G06F9/30003; G06F9/30007; G06F9/30036; G06F9/30145; G06F9/3016; G06F9/30167; G06F9/3017; G06F9/30181; G06F9/30189; G06F9/38; G06F9/3802; G06F9/3824; G06F9/3834; G06F9/3836; G06F9/3838; G06F9/3851; G06F9/3885; G06F9/3887; G06F9/3889; G06F9/3891; F; F02; F02B; F02B75/00; F02B75/02; F02B2075/022; F02B2075/027
Claims Analysis
Total Claims: 15
Claim 1
Independent Claim
260 words
A parallel array computer system, comprising: a plurality of nodes interconnected by a plurality of inter-node communication links in an inter-node array topology, each node having a plurality of processor memory elements, each processor memory element of each node including: a processor and a local memory coupled to said processor; an internal input and output port coupled to a parallel internal communication path directly connected to another processor memory element in the same node for bidirectional inter-processor communication therebetween; an external input and output port coupled to a parallel external communication path directly connected to a processor memory element of another node for bidirectional inter-processor communication therebetween, wherein the parallel external communication path is one of said plurality of inter-node communication links; and wherein the local memory includes stored instructions selectively executed by the processor for controlling routing data and control information with another processor memory element of the same node along said parallel internal communication path, and between the node containing the processing memory element and said another node along said parallel external communication path, independent of a centralized router providing routing for each of the processor memory elements within the same node, thereby providing for a router that is fully distributed among each of the processing memory elements of each of the nodes of the parallel array computer system; and wherein said inter-node array links are exclusively provided by each parallel external communication path of said nodes, and said inter-node array topology is not dependent on said parallel internal communication path of each of said plurality of nodes.
Claim 2
Dependent Claim
260 words
A parallel array computer system, comprising: a plurality of nodes interconnected by a plurality of inter-node communication links in an inter-node array topology, each node having a plurality of processor memory elements, each processor memory element of each node including: a processor and a local memory coupled to said processor; an internal input and output port coupled to a parallel internal communication path directly connected to another processor memory element in the same node for bidirectional inter-processor communication therebetween; an external input and output port coupled to a parallel external communication path directly connected to a processor memory element of another node for bidirectional inter-processor communication therebetween, wherein the parallel external communication path is one of said plurality of inter-node communication links; and wherein the local memory includes stored instructions selectively executed by the processor for controlling routing data and control information with another processor memory element of the same node along said parallel internal communication path, and between the node containing the processing memory element and said another node along said parallel external communication path, independent of a centralized router providing routing for each of the processor memory elements within the same node, thereby providing for a router that is fully distributed among each of the processing memory elements of each of the nodes of the parallel array computer system; and wherein said inter-node array links are exclusively provided by each parallel external communication path of said nodes, and said inter-node array topology is not dependent on said parallel internal communication path of each of said plurality of nodes.
Claim 3
Dependent Claim
34 words
A computer system according to claim 1 wherein each multi-processor memory element (PME) has 2n processors, wherein n is a nonzero positive integer, and said internal communication paths minimize delays due to chip crossings.
Claim 4
Dependent Claim
56 words
A computer system according to claim 1 wherein each multi-processor memory element (PME) has a processor, memory and fully distributed programmable routers within a single chip and said internal and said external communication paths minimize delays due to chip crossings, each processor memory element having means for fixed and floating point processing, routing and I/O control.
Claim 5
Dependent Claim
75 words
A computer system according to claim 1 further comprising within a processor memory element: a native instruction set associated with said processor memory element for executing operations, means for providing an expandable multiply function, and wherein said fully distributed programmable router selectively routes information in a one-dimensional left/right, two-dimensional NEWS matrix, three-dimensional NEWS/up-down, and a multidimensional hypercube, and wherein said fully distributed programmable router includes a hardware distributed router provided by each processing memory element.
Claim 6
Dependent Claim
79 words
A computer system according to claim 1 organized as a massively parallel machine with the nodes interconnected as an dimensional network cluster with the parallel communication paths between processor memory elements along said internal and external communication paths providing a processing array, and wherein processing memory elements of an array have a transparent mode utilized when routing data between processing memory elements within a single chip for permitting reduction of the effective network diameter of a network of nodes.
Claim 7
Dependent Claim
33 words
A computer system according to claim 1 wherein one of said nodes has multiple processor memory elements, each processor memory element including 32K 16-bit words of said memory coupled with a 16-bit processor.
Claim 8
Dependent Claim
38 words
A computer system according to claim 6 wherein the number of processor memory elements in the node is eight and a plurality of the nodes are combined as groups of node clusters organized as a 2d modified hypercube.
Claim 9
Dependent Claim
63 words
A computer system according to claim 6 wherein the number of processor memory elements in the node is eight and a plurality of the nodes are combined as groups of node clusters organized as a 2d modified hypercube, with up to 64 clusters integrated in a network of node clusters to form a 4d modified hypercube of up to 32,768 processing memory elements.
Claim 10
Dependent Claim
42 words
A computer system according to claim 1 wherein a node processing memory element further comprises internal data flows including high speed hard registers to feed distributed ALU and I/O router registers and logic for all operations performed by said processing memory element.
Claim 11
Dependent Claim
71 words
A computer system according to claim 1 wherein the processing memory elements of a given node are contained on a chip and each of the processing memory elements includes an I/O port for off chip byte wide communication, and input ports that are connected such that data may be routed from input to the memory, or from an input address register to an output register via a direct parallel data path.
Claim 12
Dependent Claim
48 words
A computer system according to claim 1 wherein a node has multiple processor memory elements and is connected to other nodes in a cluster network with data routing by said fully distributed programmable router distributed between hardware and software, with software controlling most of the task sequencing function.
Claim 13
Dependent Claim
59 words
A computer system according to claim 1 wherein a node has multiple processor memory elements and is connected to other nodes in a cluster network with data routing distributed between hardware and software, with hardware provided for performing inner loop transfers of acquiring data from another processor memory element and minimizing overhead on the outer loops of the node.
Claim 14
Dependent Claim
40 words
A computer system according to claim 1 wherein a node has multiple processor memory elements and is connected to other nodes in a cluster network, each processor memory element having I/O programs at dedicated interrupt levels for managing the network.
Claim 15
Dependent Claim
106 words
A computer system according to claim 1 wherein a node has multiple processor memory elements and is connected to other nodes in a cluster network, each processor memory element having I/O programs at dedicated interrupt levels for managing the network, each processor memory element having interrupt registers and dedicating four interrupt levels to receiving data from four neighbors, a buffer provided at each interrupt level by loading registers at the interrupt level, and having IN and RETURN instruction pairs using a buffer address and transfer count to enable the processor memory element to accept words from an input bus and to store them to the buffer.
References Cited (Backward Citations)
US3537074A
Cited
US3544973A
Cited
US4942516A
Cited
US3970993A
Cited
US4107773A
Cited
US4101960A
Cited
US4270170A
Cited
US4380046A
Cited
US4412303A
Cited
US4314349A
Cited
US4338675A
Cited
US4435758A
Cited
US4467422A
Cited
US4956772A
Cited
US5006978A
Cited
US4394726A
Cited
US4468727A
Cited
US4622650A
Cited
US4498133A
Cited
US4523273A
Cited
US4825359A
Cited
US4809159A
Cited
US4739474A
Cited
EP0132926B1
Cited
US5146608A
Cited
US5008815A
Cited
US4598400A
Cited
US5212773A
Cited
US4621339A
Cited
US4604695A
Cited
US4905143A
Cited
US4855903A
Cited
US4901224A
Cited
US5113523A
Cited
US4805091A
Cited
US4967340A
Cited
US4742511A
Cited
US5045995A
Cited
EP0208497B1
Cited
US5047917A
Cited
US4706191A
Cited
US4739476A
Cited
US4763321A
Cited
US5016163A
Cited
US4720780A
Cited
US4922408A
Cited
US5021945A
Cited
US4847755A
Cited
US4907148A
Cited
US4736291A
Cited
US4783782A
Cited
US4852048A
Cited
US4835729A
Cited
US4831519A
Cited
US4916657A
Cited
US4748585A
Cited
US4925311A
Cited
US5297260A
Cited
US4783738A
Cited
US4814980A
Cited
US4809169A
Cited
US4780873A
Cited
US4809347A
Cited
US4849882A
Cited
US5038386A
Cited
US4860201A
Cited
US4910665A
Cited
US5170484A
Cited
US4985832A
Cited
US5230079A
Cited
US4975834A
Cited
US4841476A
Cited
US5010477A
Cited
US4992933A
Cited
US5175865A
Cited
US4873626A
Cited
US4891787A
Cited
US5165023A
Cited
US4903260A
Cited
US4858110A
Cited
US4891751A
Cited
US4964032A
Cited
US4933846A
Cited
US4933895A
Cited
US5170482A
Cited
US5008882A
Cited
US4958273A
Cited
US4916652A
Cited
US4942517A
Cited
US4943912A
Cited
US4872133A
Cited
US4896265A
Cited
US4992926A
Cited
US5038282A
Cited
US5121498A
Cited
US5056000A
Cited
US5005120A
Cited
GB2223867A
Cited
US4920484A
Cited
US5041971A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2002-10-04 | 2003-04-05 | 2003-10-05 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2006-10-04 | 2007-04-05 | 2007-10-05 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2010-10-04 | 2011-04-05 | 2011-10-05 | $7700.00 | Window Closed / Lapsed |