
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Antonios Symvonis, Jonathon Tidswell, "An Empirical Study of OffLine Permutation Packet Routing on TwoDimensional Meshes Based on the Multistage Routing Method," IEEE Transactions on Computers, vol. 45, no. 5, pp. 619625, May, 1996.  
BibTex  x  
@article{ 10.1109/12.509915, author = {Antonios Symvonis and Jonathon Tidswell}, title = {An Empirical Study of OffLine Permutation Packet Routing on TwoDimensional Meshes Based on the Multistage Routing Method}, journal ={IEEE Transactions on Computers}, volume = {45}, number = {5}, issn = {00189340}, year = {1996}, pages = {619625}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.509915}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  An Empirical Study of OffLine Permutation Packet Routing on TwoDimensional Meshes Based on the Multistage Routing Method IS  5 SN  00189340 SP619 EP625 EPD  619625 A1  Antonios Symvonis, A1  Jonathon Tidswell, PY  1996 KW  Mesh KW  multistage graph KW  offline algorithm KW  packet routing KW  permutations. VL  45 JA  IEEE Transactions on Computers ER   
Abstract—In this paper we present the
[1] F. Annexstein and M. Baumslag,"A Unified Approach to OffLine Permutation Routing on Parallel Networks," Mathematical Systems Theory, vol. 24, pp. 233251, 1991. pp. 398406.
[2] T.H. Cormen,C.E. Leiserson, and R.L. Rivest,Introduction to Algorithms.Cambridge, Mass.: MIT Press/McGrawHill, 1990.
[3] E. Dahl,"Mapping and Compiled Communication on the Connection Machine," Proc. Fifth Distributed Memory Computing Conf., pp. 756766,Charleston, S.C., Apr. 1990.
[4] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NPCompleteness.New York: W.H. Freeman, 1979.
[5] A. Itai,"TwoCommodity Flow," J. ACM, vol. 25, no. 4, pp. 596611, Oct. 1978.
[6] C. Kaklamanis,D. Krizanc, and S. Rao,"Simple Path Selection for Optimal Routing on Processor Arrays," Proc. Fourth Ann. ACM Symp. Parallel Algorithms and Architectures, SPAA'92, pp. 2330,San Diego, June 1992.
[7] N. Karmarkar,"A New PolynomialTime Algorithm for Linear Programming," Combinatorica, vol. 4, pp. 373395, 1984.
[8] M. Kaufmann,J. Sibeyn, and T. Suel,"Derandomizing Algorithms for Routing and Sorting on Meshes," Proc. Fifth Ann. ACMSIAM Symp. Discrete Algorithms, pp. 669679,Arlington, Va., 1994.
[9] D. Krizanc,"A Note on OffLine Routing on a MeshConnected Processor Array," Parallel Processing Letters, vol. 1, no. 1, pp. 6770, 1991.
[10] 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.
[11] 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.
[12] F.T. Leighton,"Average Case Analysis of Greedy Routing Algorithms on Arrays," Proc. Second Ann. ACM Symp. Parallel Algorithms and Architectures, SPAA '90, Crete, July26, 1990.
[13] F.T. Leighton,Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes.San Mateo, Calif.: Morgan Kaufmann, 1992.
[14] F.T. Leighton,B. Maggs, and S. Rao,"Universal Packet Routing Algorithms," Proc. 29th Ann. Symp. Foundations of Computer Science, pp. 256269, 1988.
[15] 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.
[16] F. Makedon and A. Symvonis,"An Efficient Heuristic for Permutation Packet Routing on Meshes with Low Buffer Requirements," IEEE Trans. Parallel and Distributed Systems, vol. 3, no. 4, pp. 270276, Mar. 1993.
[17] S. Rajasekaran and R. Overholt,"Constant Queue Routing on a Mesh," J. Parallel and Distributed Computing, vol. 15, pp. 160166, 1992.
[18] A.G. Ranade,"How to Emulate Shared Memory," Proc. 28th IEEE Symp. Foundation of Computer Science, pp. 185194, 1987.
[19] A. Symvonis,"Routing on Trees," Information Processing Letters, vol. 57, pp. 215223, 1996.
[20] L.G. Valiant and G.J. Brebner,"Universal Schemes for Parallel Communication," Proc. 13th Ann. ACM Symp. Theory of Computing, pp. 263277, May 1981.