
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
QianPing Gu, Jun Gu, "Two Packet Routing Algorithms on a MeshConnected Computer," IEEE Transactions on Parallel and Distributed Systems, vol. 6, no. 4, pp. 436440, April, 1995.  
BibTex  x  
@article{ 10.1109/71.372798, author = {QianPing Gu and Jun Gu}, title = {Two Packet Routing Algorithms on a MeshConnected Computer}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {6}, number = {4}, issn = {10459219}, year = {1995}, pages = {436440}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.372798}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  Two Packet Routing Algorithms on a MeshConnected Computer IS  4 SN  10459219 SP436 EP440 EPD  436440 A1  QianPing Gu, A1  Jun Gu, PY  1995 VL  6 JA  IEEE Transactions on Parallel and Distributed Systems ER   
[1] Vitesse Semiconductor Corp.,“Vitesse gallium arsenide e/d process and foundry design,”1991.
[2] Q. P. Gu and J. Gu,“Algorithms and average time bounds of sorting on a mesh connected computer,”IEEE Trans. Parallel and Distrib. Syst., vol. 5, pp. 308315, 1994.
[3] ——,“Packet routing algorithms on a meshconnected computer,”Dep. Elec. Comput. Eng., Univ. Calgary, Tech. Rep. UCECETR92007, 1992.
[4] D. Krizanc,S. Rajasekaran, and Th. Tsantilas,"Optimal Routing Algorithms for MeshConnected Processor Arrays," Proc. VLSI Algorithms and Architectures (AWOC'88), J. Reif, ed., Lecture Notes in Computer Science 319, pp. 411422, 1988.
[5] M. Kunde,“Optimal sorting on multidimensionally mesh connected computers,”inProc. 4th Symp. Theoretical Aspects on Comput. Lecture Notes in Comput. Sci. 247, 1987, pp. 408–419.
[6] M. Kunde,"Routing and Sorting on MeshConnected Arrays," Proc. VLSI Algorithms and Architectures (AWOC'88), J. Reif, ed., Lecture Notes in Computer Science 319, pp. 423433, 1988.
[7] F.T. Leighton,F. Makedon, and I.G. Tollis,"A 2n  2 Algorithm for Routing in an n×n Array With Constant Size Queues," Proc. ACM Symp. Parallel Algorithms and Architectures, SPAA'89, pp. 328335, June 1989.
[8] D. Nassimi and S. Sahni,“An optimal routing algorithm for meshconnected parallel computers,”J. ACM, pp. 6–29, 1980.
[9] N. Pippenger,“Parallel communication with limited buffers,”inProc. IEEE Symp. Foundations of Comput. Sci., 1984, pp. 127–136.
[10] C. Raghavendra and V. Kumar,“Permutations on ILLIAC IVtype networks,”IEEE Trans. Comput., pp. 662–669, 1986.
[11] S. Rajasekaran and R. Overholt,"Constant Queue Routing on a Mesh," J. Parallel and Distributed Computing, vol. 15, pp. 160166, 1992.
[12] I. Scherson and S. Sen,“Parallel sorting in two dimensional VLSI models of computation,”IEEE Trans. Comput., vol. 32, pp. 238–249, 1989.
[13] C. Schnorr and A. Shamir,“An optimal sorting algorithm for mesh connected computers,”inProc. 18th ACM Symp. on Theory of Comput., 1986, pp. 263–271.
[14] Q. F. Stout,“Mapping vision algorithms to parallel architectures,”inProc. IEEE, Special Issue on Computer Vision, Aug. 1988, pp. 982–995.
[15] C. Thompson and H. Kung,“Sorting on a mesh connected parallel computer,”Commun. ACM, vol. 20, pp. 263–271, 1977.
[16] J. D. Ullman.Computational Aspects of VLSI. Rockville, MD: Computer Science, 1984.
[17] E. Upfal,“Efficient schemes for parallel communication,”J. ACM, pp. 507–517, 1984.
[18] L.G. Valiant and G.J. Brebner,"Universal Schemes for Parallel Communication," Proc. 13th Ann. ACM Symp. Theory of Computing, pp. 263277, May 1981.