System for combining a plurality of requests referencing a commo

Communications: electrical – Land vehicle alarms or indicators – Internal alarm or indicator responsive to a condition of the...

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

395410, 395800, 395823, 34082552, G06F 1516, G06F 1320

Patent

active

056088701

ABSTRACT:
Requests are routed between components in a parallel computing system using multiple-phase combining. In the first phase, the original requests are decomposed into groups of requests that share the same destination address. The requests in each group are combined at an intermediate component into a single request per group. In subsequent phases, the combined requests are themselves grouped and combined in intermediate components. In the final phase, the combined requests are processed by the component containing the destination address. The addresses of the intermediate components are determined in part by hashing on the destination address and in part by a distributing function. The hashed portion of the intermediate component address tends to converge the combined requests toward the destination component during each phase. The distributing portion of the intermediate component address tends to distribute the workload evenly among the components.

REFERENCES:
patent: 3614745 (1971-10-01), Podvin et al.
patent: 3935394 (1976-01-01), Bulfer
patent: 4215402 (1980-06-01), Mitchell et al.
patent: 4752777 (1988-06-01), Franaszek
patent: 5083265 (1992-01-01), Valiant
patent: 5105424 (1992-04-01), Flaig et al.
patent: 5117420 (1992-05-01), Hillis et al.
patent: 5313649 (1994-05-01), Hsu et al.
L. G. Valiant, "General Purpose Parallel Architectures", Handbook of Theoretical Computer Science, (North Holland, Amsterdam) (1990):944-971.
A. Gottlieb et al., "The NYU Ultracomputer-Designing an MIMD Shared Memory Parallel Computer", IEEE Trans. On Computers, C-32(2), (1983):175-189.
A. Ranade, "How to Emulate Shared Memory", Proc. 28th IEEE Symp. on Foundations of Computer Science (1987):185-194.
C. P. Kruskal et al., "A Complexity Theory of Efficient Parallel Algorithms", Theor. Comp. Sci. 71, (1990):95-132.
Yew, Pen-Chung, et al., "Distributing Hot-Spot Addressing in Large-Scale Multiprocessors," IEEE Transactions on Computers, C-36 (4) : 388-395, (Apr. 1987).
Tang, Peiyi, et al., "Software Combining Algorithms for Distributing Hot-Spot Addressing," Journal of Parallel and Distributed Computing, 10:130-139, (1990).

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

System for combining a plurality of requests referencing a commo does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with System for combining a plurality of requests referencing a commo, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and System for combining a plurality of requests referencing a commo will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-2154251

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