The week's pick
Reseach Article
Optimising Up*/Down* Routing By Minimal Paths
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 5 - Number 1 |
| Year of Publication: 2010 |
| Authors: Rajkumar, Lalit Kishore Arora |
10.5120/884-1256
|
Rajkumar, Lalit Kishore Arora . Optimising Up*/Down* Routing By Minimal Paths. International Journal of Computer Applications. 5, 1 ( August 2010), 17-20. DOI=10.5120/884-1256
Abstract
Networks of workstations (NOWs) often uses irregular interconnection patterns. Up*/down* is the most popular routing scheme currently used in NOWs with irregular topologies. One of the main problem with up*/down* routing is difficult to route all packets through minimal paths. Several solutions have been proposed in order to improve the up*/down* routing scheme. In this paper we discussed those solutions which provide minimal paths to route most the packets to improve the performance of the up*/down* routing.
References
- Horst, R.,1996, “ServerNet deadlock avoidance and fractahedral topologies”, in Proc. of the Int. Parallel Processing Symp. .
- Petrini,F. et.al, 2003, “Performance Evaluation of the Quadrics Interconnection Network”, Journal of Cluster Computing, pp. 125-142.
- Silla, F. and Duato,J., 1997,“Improving the Efficiency of Adaptive Routing in Networks with Irregular Topology”, Int. Conference on High Performance Computing.
- InfiniBandTM Trade Association, InfiniBandTM architecture. Specification Volume 1. Release 1.0.a. Available at http://www.infinibandta.com.
- Flich, J. et.al,2000, “Performance Evaluation of a New Routing Strategy for Irregular Networks with Source Routing”, Proc. Int’l Conf. Supercomputing.
- Flich, J. et.al, 2000, “Improving the Performance of Regular Networks with Source Routing”, Proc. Int’l Conf. Parallel Processing.
- Flich, J. et.al, 2000, “Combining In-Transit Buffers with Optimized Routing Schemes to Boost the Performance of Networks with Source Routing”, Proc. of Int. Symp. on High Performance Computing.
- Sancho, J. and Robles, A.,2000, “Improving the Up*/Down* Routing Scheme for Networks of Workstations”, in Proc. of Euro-Par.
- Sancho, J. et.al,2000, “New Methodology to Compute Deadlock-Free Routing Tables for Irregular Networks”, in Proc. of 4thWorkshop on Communication, Architecture and Applications for Networkbased Parallel Computing.
- Schroeder, M. et al.,1990, “Autonet: A high-speed, self-configuring local area network using point-to-point links”, SRC research report 59.
- Boden,N.J. et al.,1995, “Myrinet - A gigabit per second local area network”, IEEE Micro, vol. 15.
- Quadrics. Available: http://www.quadrics.com.
- Riesen, R.et al,1999, “CPLANT”, in Proc. of the 2nd. Extreme Linux Workshop, June 1999.
- Sheifert, R., 1998, “Gigabit Ethernet”, Addison-Wesley.
- Qiao, W. and Ni, L.M.,1996, “Adaptive routing in irregular networks using cut-through switches,” in Proc. of the 1996 International Conference on Parallel Processing.
- Qian, Y. et.al, 2004, “Performance Evaluation of the Sun Fire Link SMP Clusters”, 18th International Symposium on High Performance Computing Systems and Applications, HPCS 2004, pp. 145-156.
- Flich, J. et.al,2003, “Applying In-Transit Buffers to Boost the Performance of Networks with Source Routing”, IEEE Transactions On Computers, Vol. 52, No. 9.
- Silla,F. et.al,1997, “Efficient Adaptive Routing in Networks of Workstations with Irregular Topology,” in Workshop on Communications and Architectural Support for Network-based Parallel Computing.
- L. Cherkasova, V. Kotov, and T. Rockicki,1996, “Fibre Channel Fabrics: Evaluation and Design,” Proc. 29th Hawaii Int’l Conf. System Sciences, Jan. 1996.
Index Terms
Keywords