Multiprocessor/memory interconnection network wherein messages s

Boots – shoes – and leggings

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

3642294, 36422941, 3642516, 36424294, 34082502, 34082507, 370 60, 370 941, G06R 1300, H04Q 1104

Patent

active

049204840

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.

REFERENCES:
patent: 4484262 (1984-11-01), Sullivan et al.
patent: 4623966 (1986-11-01), McMillen
patent: 4642758 (1987-02-01), Teng
patent: 4646287 (1987-02-01), Larson et al.
patent: 4752777 (1988-06-01), Franaszek
patent: 4799152 (1989-01-01), Chuang et al.
"How to Emulate Shared Memory", 28th Annual Symposium on Foundations of Computer Science, Oct. 12-14, 1987 Abhiram G. Ranade.
A. Gottlieb, et al., "Coordinating Large Numbers Of Processors", IEEE reprint 0190-3918/81/0000/0341, (1981), pp. 341-349.
A. Gottlieb, et al., "The NYU Ultracomputer-Designing an MIMD Shared Memory Parallel Computer" IEEE Transactions On Computers, vol. C-32 No. 2 (Feb. 1983), pp. 175-188.
J. H. Reif, et al., "A Logarithmic Time Sort For Linear Size Networks", ACM reprint 0-89791-099-0/83/004/0010, (1983), pp. 10-16.
G. F. Pfister, et al., "Hot Spot-Contention and Combining in Multistage Interconnection Networks", International Conference On Parallel Processing, (Aug. 20-23, 1985) pp. 790-795.
Pfister, et al., the "IBM Research Parallel Processor Prototype (RP3): Introduction and Architecture." Proceedings of 1985 International Conference on Parallel Processing, pp. 764-771, Aug. 1985.
Sullivan, et al., "A Large Scale, Homogeneous, Fully Distributed Parallel Machine, I." 1977 Computer Arch. Conference, pp. 105-117.
Sullivan et al., "A Large Scale, Homogeneous, Fully Distributed Parallel Machine, II." 1977 Computer Arch. Conference pp. 118-124.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Multiprocessor/memory interconnection network wherein messages s does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Multiprocessor/memory interconnection network wherein messages s, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Multiprocessor/memory interconnection network wherein messages s will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-38630

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.