Author:
Pietracaprina Andrea,Pucci Geppino
Publisher
Springer Berlin Heidelberg
Reference9 articles.
1. S. Felperin, P. Raghavan, and E. Upfal. A theory of wormhole routing in parallel computers. IEEE Trans. on Computers, C-45(6):704–713, June 1996.
2. M. D. Grammatikakis, D. F. Hsu, M. Kraetzel, and J. F. Sibeyn. Packet routing in fixed-connection networks: A survey. Journal of Parallel and Distributed Computing, 54(2):77–132, November 1998.
3. T. Hagerup and C. Rüb. A guided tour of Chernoff bounds. Information Processing Letters, 33(6):305–308, February 1990.
4. K. T. Herley, A. Pietracaprina, and G. Pucci. One-to-many routing on the mesh. In Proc. of the 13th Symp. on Parallel Algorithms and Architectures, June 2001. To appear.
5. P. Kermani and L. Kleinrock. Virtual cut through: a new computer communication switching technique. Computer Networks, 3(4):267–286, April 1979.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Parallelism strategies for the tuneable golden-claw finding problem;International Journal of Computer Mathematics: Computer Systems Theory;2021-03-04
2. (ℓ, k)-ROUTING ON PLANE GRIDS;Journal of Interconnection Networks;2009-03
3. Permutation Routing and (ℓ, k)-Routing on Plane Grids;Texts in Theoretical Computer Science. An EATCS Series;2009