US5086498A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Parallel computer with asynchronous communication facility
Assignee: Hitachi Ltd
•
Filing: 1988-01-10
•
Granted: 1992-02-04
•
Expires: 2008-01-10
Abstract
Abstract In a multiprocessor digital computer system ID data, coupled with data for which inter-processor communication is desired, is communicated from one processor and held temporarily with data in a receiver buffer (associative memory) in a receiving processor. This ID is divided into main ID data MK and sub ID data SK. Main ID data MK is used for searching data from a receive buffer. The sub ID data SK are used as an ID of the data in the receive processor.
Inventors
- 👤 Teruo Tanaka
- 👤 Naoki Hamanaka
- 👤 Junji Nakagoshi
- 👤 Koichiro Omoda
- 👤 Shigeo Nagashima
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-06 05:49
CPC Classifications
G; G06; G06F; G06F15/00; G06F15/76; G06F15/80; G06F15/8053; G06F15/8092; G06F15/16; G06F15/163; G06F15/17; G06F15/173
Claims Analysis
Total Claims: 26
Claim 1
Independent Claim
199 words
A parallel computer for asynchronous transmission of messages among processors, having: (a) a plurality of processors, and (b) a network for data transfer between said plurality of processors, (c) each processor having; (c1) first means for sending to said network a message comprising data to be sent to another processor and data ID, the data ID comprising a main ID for identifying a data group to which said data belong and a sub ID for discriminating said data from other data in said data group, (c2) second means for receiving from the network and holding a plurality of messages supplied to the processor from said network, and outputting data and sub ID contained in one communication data having a main ID contained in one communication data having a main ID coincident with a search main ID, among said plurality of held communication data in response to supply of said search main ID to said second means, and, (c3) third means for executing a plurality of instructions, said third means supplying said second means with a search main ID specified by an instruction requesting reading of data out of said second means among the instructions, in response to said instruction.
Claim 2
Dependent Claim
199 words
A parallel computer for asynchronous transmission of messages among processors, having: (a) a plurality of processors, and (b) a network for data transfer between said plurality of processors, (c) each processor having; (c1) first means for sending to said network a message comprising data to be sent to another processor and data ID, the data ID comprising a main ID for identifying a data group to which said data belong and a sub ID for discriminating said data from other data in said data group, (c2) second means for receiving from the network and holding a plurality of messages supplied to the processor from said network, and outputting data and sub ID contained in one communication data having a main ID contained in one communication data having a main ID coincident with a search main ID, among said plurality of held communication data in response to supply of said search main ID to said second means, and, (c3) third means for executing a plurality of instructions, said third means supplying said second means with a search main ID specified by an instruction requesting reading of data out of said second means among the instructions, in response to said instruction.
Claim 3
Dependent Claim
42 words
A parallel computer, according to claim 1, wherein said third means has means for supplying said second means with said search main ID repeatedly until a prescribed number of pairs of data and a sub ID are delivered from said second means.
Claim 4
Dependent Claim
28 words
A parallel computer, according to claim 2, wherein said means of repeated supply includes means for executing said repeated supply in response to single executions of said instruction.
Claim 5
Dependent Claim
35 words
A parallel computer, according to claim 3, wherein said third means has means for executing instructions subsequent to said instruction in the course of execution of the repeated supply by said means of repeated supply.
Claim 6
Dependent Claim
60 words
A parallel computer, according to claim 3, wherein said third means has means a plurality of vector data, and means a plurality of data included in said number of pairs delivered from said second means in storage positions specified by sub IDs included in the delivered pairs, within a region in said vector data holding means specified by said instruction.
Claim 7
Dependent Claim
24 words
A parallel computer, according to claim 2, wherein said means of repeated supply includes means for executing said repetition by executing same instruction repeatedly.
Claim 8
Dependent Claim
49 words
A parallel computer, according to claim 2, wherein said third means includes: vector data holding means, and means for writing the data supplied from said second means in a position in said vector data holding means which is determined on the basis of sub ID annexed to said data.
Claim 9
Dependent Claim
25 words
A parallel computer, according to claim 7, wherein said vector data holding means comprises a memory which holds instructions executed in each processor and data.
Claim 10
Dependent Claim
32 words
A parallel computer, according to claim 8, wherein said third means has an arithmetic or logical operation unit executing a vector operation on vector data held by said vector data holding means.
Claim 11
Dependent Claim
16 words
A parallel computer, according to claim 7, wherein said vector data holding means comprises vector registers.
Claim 12
Dependent Claim
91 words
A parallel computer according to claim 1, wherein said first means has means responsive to execution of a data send instruction by said third means for forming a plurality of messages each including one of a plurality of data specified by the data send instruction and a main ID specified by the data send instruction in common to said plurality of data and one of sub ID's specified by the data send instruction each for one of the plurality of data, and for delivering the formed messages sequentially to the network.
Claim 13
Dependent Claim
204 words
A parallel computer for asynchronous transmission of messages among processors, having: (a) a plurality of processors, and (b) a network for data transfer between said plurality of processors, and (c) each processor having; (c1) first means for sending to said network a message including communication data comprising data to be sent to another processor and a main ID for identifying a data group to which said data belong, (c2) a second means for receiving from the network and holding a plurality of communication data included in messages supplied from said network to said processor and for outputting a pair of data contained in one communication data having a main ID coincident with a search main ID, among said plurality of held communication data, in response to supply of said search main ID to said second means, and (c3) third means for executing a plurality of instructions, said third means including means for supplying said second means repeatedly with a search main ID specified by an instruction of requesting reading of data out of said second means, in response to said instruction, until a prescribed number of data having a same main ID attached as the search main ID are outputted from said second means.
Claim 14
Dependent Claim
204 words
A parallel computer for asynchronous transmission of messages among processors, having: (a) a plurality of processors, and (b) a network for data transfer between said plurality of processors, and (c) each processor having; (c1) first means for sending to said network a message including communication data comprising data to be sent to another processor and a main ID for identifying a data group to which said data belong, (c2) a second means for receiving from the network and holding a plurality of communication data included in messages supplied from said network to said processor and for outputting a pair of data contained in one communication data having a main ID coincident with a search main ID, among said plurality of held communication data, in response to supply of said search main ID to said second means, and (c3) third means for executing a plurality of instructions, said third means including means for supplying said second means repeatedly with a search main ID specified by an instruction of requesting reading of data out of said second means, in response to said instruction, until a prescribed number of data having a same main ID attached as the search main ID are outputted from said second means.
Claim 15
Dependent Claim
27 words
A parallel computer, according to claim 12, wherein said repeated supply means comprises means for executing said repeated supply in response to single execution of said instruction.
Claim 16
Dependent Claim
67 words
A parallel computer, according to claim 13, wherein said first means has means responsive to execution of a data send instruction by said third means for forming a plurality of messages each including (a) one of a plurality of data specified by the data send instruction and (b) a main ID specified by the data send instruction, and for delivering the formed messages sequentially to the network.
Claim 17
Dependent Claim
23 words
A parallel computer, according to claim 12, wherein said repeated supply means comprises means for executing said repetition by executing said instruction repeatedly.
Claim 18
Dependent Claim
195 words
A parallel computer, having: (a) a plurality of processors, and (b) a network for data transfer between said plurality of processors, (c) each processor having; (c1) first means for sending to said network a message including communication data comprising data to be sent to another processor and ID for identifying said data, (c2) second means for receiving from the network and holding a plurality of communication data included in messages supplied from said network to the each processor, and for outputting data contained in one communication data which includes an ID having a part coincident with part of a search ID, specified by a search ID length, among said plurality of held communication data, in response to supply of the search ID and the search ID length to said second means, wherein the coincident part and the part of the search ID have length equal to the search ID length, and (c3) third means for executing a plurality of instructions, said third means supplying said second means with a search ID and search ID length both specified by an instruction of requesting reading of data out of said second means, in response to said instruction.
Claim 19
Dependent Claim
195 words
A parallel computer, having: (a) a plurality of processors, and (b) a network for data transfer between said plurality of processors, (c) each processor having; (c1) first means for sending to said network a message including communication data comprising data to be sent to another processor and ID for identifying said data, (c2) second means for receiving from the network and holding a plurality of communication data included in messages supplied from said network to the each processor, and for outputting data contained in one communication data which includes an ID having a part coincident with part of a search ID, specified by a search ID length, among said plurality of held communication data, in response to supply of the search ID and the search ID length to said second means, wherein the coincident part and the part of the search ID have length equal to the search ID length, and (c3) third means for executing a plurality of instructions, said third means supplying said second means with a search ID and search ID length both specified by an instruction of requesting reading of data out of said second means, in response to said instruction.
Claim 20
Dependent Claim
33 words
A parallel computer, according to claim 16, wherein said second means has means for outputting another part of that ID having coincident part, together with said data contained in said one communication data.
Claim 21
Independent Claim
152 words
A system for asynchronous interprocessor communication in a multiprocessor computer, comprising: a plurality of processor elements; network for selectively communicating communication data among the processor elements, wherein each communication data includes, an identification code including a first identification data portion and a second identification data portion, and an operative data portion for which interprocessor communication is desired; at least one processor element of the plurality of processor including, means for appending identification code data and operative data to form communication data, means for communicating formed communication data to the network, means for receiving communication data from the network, associative memory for storing received communication data, searching means for searching received communication data stored in the associative memory in accordance with the first identification data portion thereof, and means for selectively processing operative data included in one communication data selected by the searching means in accordance with the second identification data appended thereto.
Claim 22
Independent Claim
152 words
A system for asynchronous interprocessor communication in a multiprocessor computer, comprising: a plurality of processor elements; network for selectively communicating communication data among the processor elements, wherein each communication data includes, an identification code including a first identification data portion and a second identification data portion, and an operative data portion for which interprocessor communication is desired; at least one processor element of the plurality of processor including, means for appending identification code data and operative data to form communication data, means for communicating formed communication data to the network, means for receiving communication data from the network, associative memory for storing received communication data, searching means for searching received communication data stored in the associative memory in accordance with the first identification data portion thereof, and means for selectively processing operative data included in one communication data selected by the searching means in accordance with the second identification data appended thereto.
Claim 23
Dependent Claim
108 words
A processor element adapted for asynchronous communication with a plurality of similar processor elements in a multiprocessor computer network, comprising: means for appending identifcation code data and operative data to form communication data; means adapted for communicating formed communication data to an associated interprocessor communication network; means for adapted for receiving communication data from the associated interprocessor communication network; associative memory for storing received communication data; searching means for searching received communication data stored in the associative memory in accordance with the first identification data portion thereof; and means for selectively processing operative data selected by the searching means in accordance with the second identification data appended thereto.
Claim 24
Dependent Claim
108 words
A processor element adapted for asynchronous communication with a plurality of similar processor elements in a multiprocessor computer network, comprising: means for appending identifcation code data and operative data to form communication data; means adapted for communicating formed communication data to an associated interprocessor communication network; means for adapted for receiving communication data from the associated interprocessor communication network; associative memory for storing received communication data; searching means for searching received communication data stored in the associative memory in accordance with the first identification data portion thereof; and means for selectively processing operative data selected by the searching means in accordance with the second identification data appended thereto.
Claim 25
Independent Claim
105 words
A method of asynchronous interprocessor communication in a multiprocessor computer, comprising the steps of: appending identification code data, including a first identification data portion and a second identification data portion, to operative data for which interprocessor communication is desired to form communication data; selectively communicating the communication data to an associated interprocessor communication network; received communication data from the network; storing received communication data in an associative memory; searching received communication data stored in the associative memory in accordance with the first identification data portion thereof; and selectively processing operative data selected by the searching step in accordance with the second identification data appended thereto.
Claim 26
Independent Claim
105 words
A method of asynchronous interprocessor communication in a multiprocessor computer, comprising the steps of: appending identification code data, including a first identification data portion and a second identification data portion, to operative data for which interprocessor communication is desired to form communication data; selectively communicating the communication data to an associated interprocessor communication network; received communication data from the network; storing received communication data in an associative memory; searching received communication data stored in the associative memory in accordance with the first identification data portion thereof; and selectively processing operative data selected by the searching step in accordance with the second identification data appended thereto.
References Cited (Backward Citations)
US4064553A
Cited
US4110822A
Cited
US4128880A
Cited
US4128882A
Cited
US4408273A
Cited
US4481571A
Cited
US4604709A
Cited
JPS6049464A
Cited
US4601586A
Cited
US4780810A
Cited
US4713758A
Cited
US4649473A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1995-02-03 | 1995-08-05 | 1996-02-04 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1999-02-03 | 1999-08-05 | 2000-02-04 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2003-02-03 | 2003-08-05 | 2004-02-04 | $7700.00 | Window Closed / Lapsed |