Buffer efficiency in wormhole routers

被引：0

作者：

Wilberforce University, Wilberforce, OH 45384, United States ^{[1
]}

机构：

[1] Wilberforce University, Wilberforce

来源：

Int J Comput Appl | 2006年 / 4卷 / 314-320期

关键词：

Buffered wormhole routing; Deadlock-free; Hardwired dateline; Packet co-residence; Performance evaluation;

D O I：

10.1080/1206212X.2006.11441816

中图分类号：

学科分类号：

摘要：

The efficiency of buffer usage in wormhole torus networks is evaluated with emphasis on new routing algorithms. These algorithms use hardwired dateline and allow flits of different packets to co-reside in buffers along escape virtual channels so that the bottleneck links and bubble problems in existing algorithms can be alleviated. The algorithms are demonstrated to be deadlock-free and more efficient in use of buffer space than their counterparts.

引用

页码：314 / 320

页数：6

共 15 条

[1]

Dally W.J., Virtual channel flow control, IEEE Trans. on Parallel and Distributed Systems, 3, 2, pp. 194-205, (1992)

[2]

Duato J., Yalamanchili S., Ni L., Interconnection networks: An engineering approach, (1997)

[3]

Pinkston T.M., Flexible and efficient routing based on progressive deadlock recovery, IEEE Trans. on Computers, 48, 7, pp. 649-669, (1999)

[4]

Dally W.J., Towles B., Principles and practice of interconnection networks, (2004)

[5]

Dally W.J., Deadlock-free adaptive routing in multicomputer networks using virtual channels, IEEE Trans. on Parallel and Distributed Systems, 4, 4, pp. 466-475, (1993)

[6]

Dally W.J., Seitz C.L., The torus routing chip, Distributed Computing, 1, 3, pp. 187-196, (1986)

[7]

Bolding K., Non-uniformities introduced by virtual channel deadlock prevention, (1992)

[8]

Scott S., Thorson G., Optimized routing in the Cray T3D, Proc. Workshop on Parallel Computer Routing and Communication, pp. 281-294, (1994)

[9]

Duato J., A necessary and sufficient condition for deadlock-free adaptive routing in wormhole networks, IEEE Trans. on Parallel and Distributed Systems, 6, 10, pp. 1055-1067, (1995)

[10]

Duato J., Lopes P., Performance evaluation of adaptive routing algorithms for k-ary n-cubes, Proc. Parallel Computer Routing and Communication Workshop, pp. 45-59, (1994)

← 1 2 →