Patent US6344057B1 successfully refreshed from Google Patents.
US4644496A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Apparatus, methods, and systems for computer information transfer
Assignee: Iowa State University Research Foundation Inc
•
Filing: 1983-01-11
•
Granted: 1987-02-17
•
Expires: 2003-01-11
Abstract
Abstract A network of computing nodes is connected by communication channels into fully-interconnected units and groups of units. Each unit has one and only one direct connection to each other unit in a group, and any one computing node in any unit has a direct connection to at most one other unit. The nodes are suitably computing networks themselves so there can be any number of levels of recursion. In a method of routing and transferring information, each node is given an address having address portions respectively identifying its location at each level of recursion. The information is sent from that port of the sending node which has a port identification identical to the highest order address portion in the destination address which is different from the corresponding address portion of the sending computing node. Each computing node suitably has processing assemblies each having a digital processor, first and second memories, partitioning circuitry, and assembly control circuitry, communicating on a common intranodal shared bus. Each assembly is a port to an external bus. Each digital processor is able to communicate the information it generates from its first memory through the partitioning circuitry to a bus simultaneously with the partitioning circuitry also permitting access by other information to the second memory along the other bus.
Inventors
- 👤 Barry A. Andrews
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-23 23:54
CPC Classifications
G; G06; G06F; G06F15/00; G06F15/76; G06F15/80; G06F15/8007; G06F15/803
Claims Analysis
Total Claims: 12
Claim 1
Independent Claim
146 words
A network of computing nodes interconnected by a plurality of communication channels, said network being CHARACTERIZED IN THAT said network of computing nodes is organized by said communication channels into units, each unit having at least three computing nodes, each computing node in each unit being directly connected to every other computing node in the same unit by said communication channels from each computing node to every other computing node in the same unit, said network further being organized by said communication channels into at least one group of units, each unit having only one direct connection to each other unit in the same group by way of said communication channels, each group having at least three units, and any one computing node in any one unit in the network having a direct connection to a node in at most one other unit in the network.
Claim 2
Dependent Claim
146 words
A network of computing nodes interconnected by a plurality of communication channels, said network being CHARACTERIZED IN THAT said network of computing nodes is organized by said communication channels into units, each unit having at least three computing nodes, each computing node in each unit being directly connected to every other computing node in the same unit by said communication channels from each computing node to every other computing node in the same unit, said network further being organized by said communication channels into at least one group of units, each unit having only one direct connection to each other unit in the same group by way of said communication channels, each group having at least three units, and any one computing node in any one unit in the network having a direct connection to a node in at most one other unit in the network.
Claim 3
Dependent Claim
43 words
The network of computing nodes claimed in claim 1 wherein said network is organized by said communication channels into a plurality of groups of said units, each group having only one direct connection to each other group by way of said communication channels.
Claim 4
Dependent Claim
33 words
The network of computing nodes claimed in claim 1 wherein every unit has the same number P of computing nodes and every group has the same number, being equal to P, of units.
Claim 5
Independent Claim
328 words
A method of routing computer information comprising the steps of providing a network of computing nodes having ports, said computing nodes being directly connected at said ports by a plurality of communication channels so that said network is organized into units, each computing node in each unit having only one direct connection to each other computing node in the same unit, said network further being organized by said communication channels into at least one group of units, each unit having only one direct connection to each other unit in the same group, any one computing node in any one unit in the network having a direct connection to at most one other unit in the network; storing in each of said computing nodes a distinct address having address portions including in decreasing order an address portion identifying for each computing node its unit and an address portion identifying each computing node in its unit; storing in each of said computing nodes an identification of each port of each computing node respectively, said identification of each port being identical with the computing node address portion of the address of a computing node in the same unit to which each port is connected and said identification of each port being identical with the unit address portion of the address of a computing node in a distinct unit to which each port is directly connected; providing said computer information with an associated destination address being identical to one address stored in one of said computing nodes in the network; and transferring said computer information from one of said computing nodes having an address distinct from said destination address by selecting the port of one of said computing nodes having a port identification identical to the highest order address portion in the destination address which is different from the corresponding address portion of said one computing node and sending said computer information from said port so selected to an adjacent computing node.
Claim 6
Independent Claim
328 words
A method of routing computer information comprising the steps of providing a network of computing nodes having ports, said computing nodes being directly connected at said ports by a plurality of communication channels so that said network is organized into units, each computing node in each unit having only one direct connection to each other computing node in the same unit, said network further being organized by said communication channels into at least one group of units, each unit having only one direct connection to each other unit in the same group, any one computing node in any one unit in the network having a direct connection to at most one other unit in the network; storing in each of said computing nodes a distinct address having address portions including in decreasing order an address portion identifying for each computing node its unit and an address portion identifying each computing node in its unit; storing in each of said computing nodes an identification of each port of each computing node respectively, said identification of each port being identical with the computing node address portion of the address of a computing node in the same unit to which each port is connected and said identification of each port being identical with the unit address portion of the address of a computing node in a distinct unit to which each port is directly connected; providing said computer information with an associated destination address being identical to one address stored in one of said computing nodes in the network; and transferring said computer information from one of said computing nodes having an address distinct from said destination address by selecting the port of one of said computing nodes having a port identification identical to the highest order address portion in the destination address which is different from the corresponding address portion of said one computing node and sending said computer information from said port so selected to an adjacent computing node.
Claim 7
Dependent Claim
79 words
The method of routing computer information claimed in claim 4 wherein said address storing step includes each said address further having a high-order address portion identifying for each computing node its said group in said network of computing nodes; and said port identification storing step also includes said identification of each port being identical with the group address portion of the address of a said computing node in a distinct group to which said each port is directly connected.
Claim 8
Dependent Claim
77 words
The method of routing computer information claimed in claim 4 wherein said method further comprises the step of generating an adjacent port identification of the port of said adjacent computing node to which said computer information is to be sent by obtaining as said adjacent port identification the lowest order address portion in the sending node address which is different from the port identification of the port selected for sending said computer information from said sending node.
Claim 9
Dependent Claim
138 words
Apparatus for use in a computing node and transferring digital information comprising first bus means and second bus means; and processing assembly means comprising memory means, digital processor means for generating a first portion of said digital information and asserting bus request signals, arbitration means for producing grant signals in response to bus request signals assertable from said digital processor means and from said first bus means, and partition means for connecting, in response to the grant signals, said memory means and said digital processor means to each other selectively, and for connecting said digital processor means and said second bus means to communicate said first portion of said digital information through said partition means to said second bus means and simultaneously connecting said memory means separately to said first bus means to communicate other digital information therebetween.
Claim 10
Dependent Claim
138 words
Apparatus for use in a computing node and transferring digital information comprising first bus means and second bus means; and processing assembly means comprising memory means, digital processor means for generating a first portion of said digital information and asserting bus request signals, arbitration means for producing grant signals in response to bus request signals assertable from said digital processor means and from said first bus means, and partition means for connecting, in response to the grant signals, said memory means and said digital processor means to each other selectively, and for connecting said digital processor means and said second bus means to communicate said first portion of said digital information through said partition means to said second bus means and simultaneously connecting said memory means separately to said first bus means to communicate other digital information therebetween.
Claim 11
Dependent Claim
52 words
Apparatus for transferring digital information as claimed in claim 7 wherein said partition means includes means for alternatively connecting said digital processor means to said first bus means and simultaneously connecting said memory separately to said second bus means, said arbitration means further being responsive to requests from said second bus means.
Claim 12
Dependent Claim
142 words
Apparatus for transferring digital information as claimed in claim 8 wherein said apparatus further comprises second processing assembly means constructed in the same manner as said first-named processing assembly means, said apparatus having corresponding first bus means and second bus means for said second processing assembly means; said second bus means for said first processing assembly means being connected to said first bus means for said second processing assembly means to form a bus communications channel; said arbitration means in said first processing assembly means including bus arbiter means for granting said bus communications channel to only one at a time of said first and second processing assembly means by grant signals to said partition means to said first and second processing assembly means in response to requests assertable by said digital processing means in said first and second processing assembly means.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1990-02-16 | 1990-08-18 | 1991-02-17 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1994-02-16 | 1994-08-18 | 1995-02-17 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1998-02-16 | 1998-08-18 | 1999-02-17 | $7700.00 | Window Closed / Lapsed |