Method and apparatus for routing data in an inter-nodal...

Multiplex communications – Data flow congestion prevention or control – Flow control of data transmission through a network

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C370S386000, C370S400000

Reexamination Certificate

active

07839786

ABSTRACT:
A massively parallel computer system contains an inter-nodal communications network of node-to-node links. Nodes vary a choice of routing policy for routing data in the network in a semi-random manner, so that similarly situated packets are not always routed along the same path. Semi-random variation of the routing policy tends to avoid certain local hot spots of network activity, which might otherwise arise using more consistent routing determinations. Preferably, the originating node chooses a routing policy for a packet, and all intermediate nodes in the path route the packet according to that policy. Policies may be rotated on a round-robin basis, selected by generating a random number, or otherwise varied.

REFERENCES:
patent: 5050162 (1991-09-01), Golestani
patent: 5218676 (1993-06-01), Ben-Ayed et al.
patent: 5319638 (1994-06-01), Lin
patent: 5347450 (1994-09-01), Nugent
patent: 5453978 (1995-09-01), Sethu et al.
patent: 5835482 (1998-11-01), Allen
patent: 5933425 (1999-08-01), Iwata
patent: 5959995 (1999-09-01), Wicki et al.
patent: 5995503 (1999-11-01), Crawley et al.
patent: 6081506 (2000-06-01), Buyukkoc et al.
patent: 6486983 (2002-11-01), Beshai et al.
patent: 6748413 (2004-06-01), Bournas
patent: 6901052 (2005-05-01), Buskirk et al.
patent: 7319695 (2008-01-01), Agarwal et al.
patent: 2004/0001508 (2004-01-01), Zheng et al.
patent: 2005/0002334 (2005-01-01), Chao et al.
patent: 2005/0018682 (2005-01-01), Ferguson et al.
patent: 2005/0068946 (2005-03-01), Beshai
patent: 2005/0100035 (2005-05-01), Chiou et al.
patent: 2005/0108425 (2005-05-01), Rabinovitch
patent: 2006/0002424 (2006-01-01), Gadde
patent: 2008/0016249 (2008-01-01), Ellis et al.
Ribler, Randy L et al, “The Autopilot performance-directed adaptive control system”, Future Generations Computer Systems, Elsevier Science Publishers, Amsterdam, NL, vol. 18, No. 1, Sep. 1, 2001, pp. 175-187.
Zhang, Yan et al, “Automatic Performance Tuning for J2EE Application Server Systems”, Lecture Notes in Computer Science, vol. 3806, 2005, pp. 520-527.
Chung, I-Hsin et al, “Automated cluster-based web service performance tuning”, High Performance Distributed Computing, 2004, Proceedings of the 13th IEEE International Symposium on Honolulu, HI, USA, Jun. 4-6, 2004, Piscataway, NJ, USA, IEEE, Jun. 4, 2004, pp. 36-44.
Hondroudakis, Anna et al, “An Empirically Derived Framework for Classifying Parallel Program Performance Tuning Problems”, Proceedings of the Sigmetrics Symposium on Parallel and Distributed Tools, SPDT 1998, Welches, OR, Aug. 3-4, 1998, Sigmetrics Symposium on Parallel and Distributed Tools, New York, NY, US, ACM, vol. SYMP.2, Aug. 3, 1998, pp. 112-123.
A. Gara et al., “Overview of the Blue Gene/L System Architecture” (IBM Journal of Research & Development, vol. 49, Nos. 2/3, Mar./May 2005, pp. 195-211).
N.R. Adiga et al, “Blue Gene/L Torus Interconnection Network” (IBM Journal of Research & Development, vol. 49, Nos. 2/3, Mar./May 2005, pp. 265-276).
M. Barnett et al., “Broadcasting on Meshes with Worm-Hole Routing” (Second Revised Version, 1995).

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

Method and apparatus for routing data in an inter-nodal... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method and apparatus for routing data in an inter-nodal..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for routing data in an inter-nodal... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4159254

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