Christopher J. Glass
- ~AGARWAL, A., LTM, B.-H., KRANZ, D., AND KUBIATOWICZ, J. 1990. APRIL: A processor ~ architecture for multiprocessing multiprocessor. In Proceedings of tile } 7th Intenzatlonal Sympo- ~sium on ComputerArchiteeture (Seattle, Wash., May 28-31). IEEE, New York, pp. 104-114. Google Scholar
- ~BORKAR, S. B., COHN, R., COX, G., GLEASON, S,, GROSS, T., KUNG, H. T., LAM, M., MOORE, B., ~ PETERSON, C., PIEPER, J., RANKIN, L., TSENG, P. S., SUTTON, J., URBANSKI, J., AND WEBB, J. ~1988. iWarp: An integrated solution to high-speed parallel computing. In Proceedtn~~ of ~Superconzpttttng't$8 (Orlando, Fla., No'~. 14 qS). 1EEl;, New York, pp. gg(I 330. Google Scholar
- ~DALLY, W.J. 1988. Fine-grain message passing concurrent computers. In Proceedings of the 3rd ~ Conference on Hypereube Concun'ent Computers, vol. I (Pasadena, Calif., Jan. 19-20). ACM, ~ New York, pp. 2-12. Google Scholar
- ~DALLY, W.J. 1989. The J-machine: System support for Actors. In Actors: Knowledge-Based ~ Cotzctn'rent Computtng, Hewitt and Agha, eds. MIT Press. Cambridge, Mass.Google Scholar
- ~DALLY, W. J. 1990. Performance analysis of k-ary n-cube interconnect~on networks. 1EEE ~ Trans. Comput. C-39, (June) 775 785. Google Scholar
- ~DALLY, W.J. 1991. Express cubes. Improving the performance of k-ary n-cube mterconnec- ~ t~on networks. IEEE Trans. Comput. 40, (Sept.), 1016-1023. Google Scholar
- ~DALLY, W. J., AND AOKL H. I990. Adaptive routing using virtual channels. Tech. Rep., ~Massachusetts Institute of Technology, Laboratory for Computer Science, Cambridge, Mass., ~Sept.Google Scholar
- DALL'~, W. J., AND SE1TZ, C.L. 1986. The torus routing chtp. J. Dist. Comput. 1, 3, 187-196.Google Scholar
- DALLY, W. J., AND SEITZ, C. L. 1987 Deadlock-free message routing m multiproccssor ~interconnection networks. 1EEE Trans Comput. C-36, (May) 547-553. Google Scholar
- ~GLASS, C. J. 1992. Designing maximally adaptive algorithms for wormhole routing: The ~turn model. Ph.D. thesis. Michigan State University, Department of Computer Science, East ~ Lansing, Mich., (Aug.). Google Scholar
- ~GLASS, C. J., AND NI, L.M. 1992. Maximally fully adaptive routing in 2D meshes. In Proceed- ~ings of the 1992 blternational Conference on Para#el Proce66tng, vol. I. (Aug.), pp 101-104Google Scholar
- ~GLASS, C.J., AND N1, L.M. 1993. Fault-tolerant wormhole routing in meshes. In Ptvceedzngs of ~the 23rd Annual International Symposium on Fault-Tolerant Computzng (June), pp. 240 249.Google Scholar
- ~INTEL CORPORATION. 1991. A Touchstone DELTA System DescriptionGoogle Scholar
- ~ISHIHATA, H., t-IORIE, T., 1NANO, S., SHIMIZ, U, T., KATO, S., AND IKESAKA, M. 1991. Third ~generation message-passing computer AP1000. In bzternationaI Symposutm on Supercomputmg ~(Kyusyu, Japan, Nov.), pp. 46-55.Google Scholar
- ~KONSTANT1NIDOU, S. 1990. Adaptwe, minimal routing in hypercubes. In Proceedings of the 6th ~MIT Conference: Advanced Research ttz {%Sl. pp 139-153. Google Scholar
- ~LENOSKI, D., LAUDON, J., GHARACHORLOO, K., GUPTA, A., AND HENNESSY, J 1990. The ~ &rectory-based cache coherence protocol for the DASH multlprocessor. In Proceedzng~ of the ~17th InternationalSymposzum on ComputerArchttecture (Seattle, Wash., May 28-31) IEEE, New ~York, pp. 148 159. Google Scholar
- ~LIN, X., AND NI, L. M. 1991. Deadlock-free multicast wormhole routing in multicomputer ~ networks. In Proceethngs of t/re 18th Annual lnternatzonal Symposium on Computer Arc/utecture ~(Toronto, Ont., Canada, May 27 30). ACM, New York, pp. 116-125. Google Scholar
- ~LINDER, D. H., AND HARDEN, J. C. 1991. An adaptive and fault tolerant wormhole routing ~strategy for k-ary n-cubes. IEEE Trans. Comput. 40, (Jan.) 2 12. Google Scholar
- ~NCUBE COMPANY. 1990. NCUBE 0400 Processor Manual.Google Scholar
- ~NL L. M., AND MCKINLEY, P. K. 1993. A survey of wormhole routing techniques m direct ~networks. IEEE Computer 26, (Feb.) 62-76. Google Scholar
- ~SEITZ, C. L., ATHAS, W. C., FLAIG, C. M., MARTIN, A. J., SE1ZOVIC, J., STEELE, C. S., AND SU, ~W.-K. 1988. The architecture and programming of the Ametek Series 2010 mulncomputer. ~In Proceedtngs of the 3rd Conference on Hypercube Concun'ent Computers and Apphcatlon3, ~Voh~me 1, (Pasadena, Calif., Jan. 19-20). ACM, New York, pp. 33-36. Google Scholar
- ~SULLIVAN, H., AND BASHKOW, T.R. 1977. A large scale, homogeneous, fully distributed parallel ~machine. In Proceedings oJ the 4th Annual Symposutm on Computer Archttecture (Mar.), IEEE, ~New York, pp. 105-124. Google Scholar
- ~YANTCHEV, J. T., AND JESSHOPE, C. R. 1989. Adaptive, low latency, deadlock-free packet ~ routing for networks of processors. In iEEE Proceeding, Pt. E, vol. 136(3). (May), pp. 178-186.Google Scholar
Index Terms
- The turn model for adaptive routing
Recommendations
A survey of routing algorithm for mesh Network-on-Chip
With the rapid development of semiconductor industry, the number of cores integrated on chip increases quickly, which brings tough challenges such as bandwidth, scalability and power into on-chip interconnection. Under such background, Network-on-Chip (...
A comparison of adaptive wormhole routing algorithms
ISCA '93: Proceedings of the 20th annual international symposium on computer architectureImprovement of message latency and network utilization in torus interconnection networks by increasing adaptivity in wormhole routing algorithms is studied. A recently proposed partially adaptive algorithm and four new fully-adaptive routing algorithms ...
A comparison of adaptive wormhole routing algorithms
Special Issue: Proceedings of the 20th annual international symposium on Computer architecture (ISCA '93)Improvement of message latency and network utilization in torus interconnection networks by increasing adaptivity in wormhole routing algorithms is studied. A recently proposed partially adaptive algorithm and four new fully-adaptive routing algorithms ...
Comments