US4920484A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Multiprocessor/memory interconnection network wherein messages sent through the network to the same memory are combined
Assignee: Yale University
•
Filing: 1988-10-05
•
Granted: 1990-04-24
•
Expires: 2008-10-05
Abstract
Abstract A method and apparatus is described for enabling efficient, bilateral communications in a network connecting a plurality of target address modules and a plurality of source address generators. The source address generators are enabled to generate requests to target addresses within the target address modules. The function of the network is to forward the requests to the target address modules holding the respective target addresses and to return the replies generated by the target address module to the respective source address generators. The network interconnects the source generators to each target address module and vice versa. The interconnection network includes a plurality of interconnected nodes, each node having M inputs and N outputs (where M may or may not be equal to N) and a processor for carrying out a communication protocol. The protocol comprises each node first placing incoming target addresses from messages appearing on the node's inputs into a queue associated with each respective input. The target addresses of the messages at the head of each queue are examined, and the message is transmitted whose target address bears a predetermined relationship to the other message's target address. The messages are combined in case their target addresses are found to be equal. Additionally, a direction bit queue is provided in which is stored a sequence of bits indicating from which of the M inputs to the node, the transmitted message was received. A "ghost" message is transmitted (which includes the target address of the message transmitted) on the node's other outputs, to notify interconnected nodes of the transmitted target address. In addition, each source address generator periodically generates an "end of stream" message.
Inventors
- 👤 Abhiram G. Ranade
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-26 21:13
CPC Classifications
G; G06; G06F; G06F13/00; G06F13/14; G06F13/16; G06F13/1605; G06F13/1642; G06F15/00; G06F15/16; G06F15/163; G06F15/173; G06F15/17356; G06F15/17368; G06F15/17393
Claims Analysis
Total Claims: 17
Claim 1
Independent Claim
195 words
A method for enabling efficient communication in a network between a plurality of target address modules and a plurality of source address generators, said source address generators able to generate target addresses contained within said target address modules, said network including a plurality of interconnected nodes, each node having M inputs and N outputs where M and N are positive integers and M is equal to or greater than 2, each node having queue means coupled to each said input, each said queue means for storing data in a first-in first-out manner, the first-in data in said queue being at a head of said queue, and means for carrying out a communication protocol, said method comprising the steps of: placing target addresses from messages received on each said node input into a queue means; examining the target addresses at heads of at least two said queue means; and transmitting from a node, only when at least two target addresses are present in different queue means, one said message whose target address is found to bear a predetermined relationship to a target address of another said message contained at the head of another said queue means.
Claim 2
Independent Claim
195 words
A method for enabling efficient communication in a network between a plurality of target address modules and a plurality of source address generators, said source address generators able to generate target addresses contained within said target address modules, said network including a plurality of interconnected nodes, each node having M inputs and N outputs where M and N are positive integers and M is equal to or greater than 2, each node having queue means coupled to each said input, each said queue means for storing data in a first-in first-out manner, the first-in data in said queue being at a head of said queue, and means for carrying out a communication protocol, said method comprising the steps of: placing target addresses from messages received on each said node input into a queue means; examining the target addresses at heads of at least two said queue means; and transmitting from a node, only when at least two target addresses are present in different queue means, one said message whose target address is found to bear a predetermined relationship to a target address of another said message contained at the head of another said queue means.
Claim 3
Dependent Claim
27 words
The invention as recited in claim 1 wherein said transmitted message has a target address numerically smaller than the target address stored in said another queue means.
Claim 4
Dependent Claim
31 words
The invention as recited in claim 1 wherein said transmitted message has a target address which is numerically larger than said target address at the head of said another queue means.
Claim 5
Dependent Claim
29 words
The invention as recited in claim 1 further including the step of: storing in a first direction bit queue means, data defining where said transmitted message was received from.
Claim 6
Dependent Claim
68 words
The method as recited in claim 4 wherein said transmitted message is a read request to a target address in a memory module, said memory module responding to said read request by transmitting a reply message, said method further comprising: receiving said reply message at a node; and transmitting said reply message in accordance with the stored indication at the head of said first direction bit queue means.
Claim 7
Dependent Claim
29 words
The invention as defined in claim 4 including the further steps of: storing in a second direction bit queue means, data defining where said transmitted message was transmitted to.
Claim 8
Dependent Claim
62 words
The invention as defined in claim 6 wherein, in response to an expected reply message from a target address module, the contents of said second direction bit queue means are examined to determine which of said reply messages should be transmitted; and transmitting a reply message in accordance with the stored indication at the head of said first direction bit queue means.
Claim 9
Dependent Claim
27 words
The method of claim 1 wherein said examining step further comprises the step of: comparing said messages and combining them if they have the same target address.
Claim 10
Dependent Claim
23 words
The invention as recited in claim 8 wherein said comparing step combines said messages only if their types and target addresses are identical.
Claim 11
Dependent Claim
37 words
The method of claim 8 wherein said method further includes, after said examining step and before said transmitting step, the step of: determining from said target address, on which of said outputs said message should be transmitted.
Claim 12
Dependent Claim
57 words
The method as recited in claim 1 where N is equal to or greater than 2, which method includes the further step of: transmitting a ghost message, with a target address equal to the target address of said transmitted message, on all outputs of said node other than an output on which said transmitted message is emplaced.
Claim 13
Dependent Claim
78 words
The method as recited in claim 11 wherein a node, in response to a received ghost message carries out the further steps of: receiving said ghost message and inserting the target address associated therewith in an input queue means; comparing said ghost target address with a target address of another message stored in another input queue means; transmitting said another message only if its target address bears a predetermined relationship to said target address of said ghost message.
Claim 14
Dependent Claim
33 words
The invention as recited in claim 12 wherein said predetermined relationship is that the target address of said another message is equal to or less than said target address of said ghost message.
Claim 15
Dependent Claim
33 words
The invention as recited in claim 12 wherein said predetermined relationship is that the target address of said another message is equal to or greater than said target address of said ghost message.
Claim 16
Dependent Claim
83 words
The invention as recited in claim 1 wherein said method further comprises: causing each said source address generator to generate an end of stream message after each read or write message, said end of stream message containing a target address equal to Infinity; whereby any node receiving said end of stream message and inserting said target address of Infinity in an input queue means, is caused to transmit a message appearing at the head of another input queue means to a subsequent node.
Claim 17
Dependent Claim
85 words
The invention as recited in claim 1 wherein said method further comprises: causing each said source address generator to generate an end of stream message after each read or write message, said end of stream message containing a target address equal to "minus Infinity"; whereby any node receiving said end of stream message and inserting said target address of "minus Infinity" in an input queue means, is caused to transmit a message appearing at the head of another input queue means to a subsequent node.
References Cited (Backward Citations)
US4484262A
Cited
US4623966A
Cited
US4642758A
Cited
US4799152A
Cited
US4646287A
Cited
US4752777A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1993-04-23 | 1993-10-23 | 1994-04-24 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1997-04-23 | 1997-10-23 | 1998-04-24 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2001-04-23 | 2001-10-23 | 2002-04-24 | $7700.00 | Window Closed / Lapsed |