Validation of NetRec - A dynamic reconfiguration algorithm for irregular topologies in presence of multiple failures

Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2004 (Abstracts and CD-ROM)

Volumn 18, Issue , 2004, Pages 2895-2902

  Natchev, N ^a   Avresky, D ^a  

^a NORTHEASTERN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

HIGH-SPEED NETWORKS; LINK FAILURES; NETWORK TOPOLOGY; NODE FAILURES;

ALGORITHMS; BROADCASTING; ELECTRIC NETWORK TOPOLOGY; ROUTERS; SERVERS; SYNCHRONIZATION; TELECOMMUNICATION NETWORKS;

COMPUTER SYSTEM RECOVERY;

EID: 12444322000     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. D. Garcia and W. Watson, "ServerNet-II. In Lecture Notes in Computer Science." Proc. of the Workshop on Parallel Computer Routing and Communications, pp 119-136, Springer, June 1997.
2. N. Boden, D. Cohen, R. Felderman, A. Kulawik, C. Seitz, J. Seizovic, and W. Su, "Myrinet - a gigabit per second local area network." IEEE Micro, pp 29-36, Feb. 1995.
3. M. Schroeder et al., "Autonet: A high-speed, self-configuring local area network using point-to-point links." IEEE Journal on Selected Areas in Communications, vol. 9, no. 8, Oct. 1991.
4. J. Duato, R. Casado, F. Quiles, and J. Sanchez, "Dynamic Reconfiguration in High Speed Local Area Networks." Dependable Network Computing, editted by D. Avresky. Kluwer Acad. Publishers, 1999.
5. C. Fang, and T. Szymanski, "An Analysis of Deflection Routing in Multi-dimenshional Regular Mesh Networks." Proc. of IEEE INFOCOM'91, IEEE, Apr. 1991.
6. P.E. Berman, L. Gravano, G.D. Pfiarre, L. Gavano, and J.L.C. Sanz, "Adaptive Deadlock- and Livelock-Free Routing with All Minimal Paths in Torus Networks." Proc. Fourth ACM Symp. Parallel Algorithms and Architectures, June 1992.
7. W. Qiao, and L.M. Ni, "Adaptive Routing in Irregular Networks Using Cut-Through Switches." Proc. 1996 Int'l Conf. Parallel Proc., Aug. 1996.
8. S. Konstantinidou, and L. Synder, "The Chaos Router: A Practical Application of Randomization in Network Routing." 2nd Annual Symp. on Parallel Algorithms and Architectures, SPAA'1990, pp.21-30.
9. X. Lin, P.K. McKinley, and L.M. Ni, "The Message Flow Model for Routing in Wormhole-Routed Networks." Proc. 1993 Int'l Conf. Parallel Processing, Aug. 1993.
10. W. J. Daly and C. L. Seitz, "Deadlock-free Message Routing in Multi-processor Interconnection Networks." IEEE Transactions on Computers, vol. C-36, no. 5, pp 547-553, May 1987.
11. D.H. Linder, and J.C. Harden, "An Adaptive Deadlock and Fault Tolerant Wormhole Routing Strategy for K-Ary N-Cubes." IEEE Trans on Computers, vol 40, No. 1, Jan 1991, pp 2-12.
12. F. Silla, and J. Duato, "High-Performance Routing in Networks of Workstations with Irregular Topology." IEEE Transactions on Parallel and Distributed Systems, vol 11, No. 7, July 2000.
13. D. Avresky, N. Natchev and V. Shubarnov, "Dynamic Reconfiguration in High-Speed Computer Networks." The IEEE Symposium on Cluster Computing, October, 2001, CA, USA.
14. H. Samet, "Design and Analysis of Spatial Data Structures." Addison-Wesley Publishing Company,Inc., pp 2-40, 1990.