
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
D. Rau, J.A.B. Fortes, H.J. Siegel, "Destination Tag Routing Techniques Based on a State Model for the IADM Network," IEEE Transactions on Computers, vol. 41, no. 3, pp. 274285, March, 1992.  
BibTex  x  
@article{ 10.1109/12.127440, author = {D. Rau and J.A.B. Fortes and H.J. Siegel}, title = {Destination Tag Routing Techniques Based on a State Model for the IADM Network}, journal ={IEEE Transactions on Computers}, volume = {41}, number = {3}, issn = {00189340}, year = {1992}, pages = {274285}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.127440}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Destination Tag Routing Techniques Based on a State Model for the IADM Network IS  3 SN  00189340 SP274 EP285 EPD  274285 A1  D. Rau, A1  J.A.B. Fortes, A1  H.J. Siegel, PY  1992 KW  necessary and sufficient conditions; state model; IADM network; routing; inverse augmented data manipulator; reroutability; universal rerouting algorithm; lower bound; isomorphic; indirect binary ncube network; permutation routing; fault tolerant computing; multiprocessor interconnection networks. VL  41 JA  IEEE Transactions on Computers ER   
A 'state model' is proposed for solving the problem of routing and rerouting messages in the inverse augmented data manipulator (IADM) network. Necessary and sufficient conditions the reroutability of messages are established using this model, and destination tag schemes are derived. These schemes are simpler, more efficient, and require less complex hardware than previously proposed routing schemes. Two destination tag schemes are proposed. A universal rerouting algorithm is constructed based on one of the schemes. It finds a blockagefree path for any combination of multiple blockages if there exists such a path, and indicates the absence of such a path if there exists none. In addition, the state model is used to derive constructively a lower bound on the number of subgraphs which are isomorphic to the indirect binary ncube network in the IADM network. This knowledge can be used to characterize properties of the IADM networks and for permutation routing in the IADM networks.
[1] D. Agrawal, "Graph theoretical analysis and design of multistage interconnection networks,"IEEE Trans. Comput., vol. C32, pp. 637648, July 1983.
[2] K. E. Batcher, "The Flip network in STARAN," inProc. 1976 Int. Conf. Parallel Processing, Aug. 1976, pp. 6571.
[3] T.Y Feng, "Data manipulating functions in parallel processors and their implementations,"IEEE Trans. Comput., vol. C23, pp. 309318, Mar. 1974.
[4] L. R. Goke and G. J. Lipovski, "Banyan networks for partitioning multiprocessor systems," inProc. 1st Annu. Symp. Comput. Architecture, Dec. 1973, pp. 2128.
[5] M. Jeng and H. J. Siegel, "Design and analysis of dynamic redundancy networks,"IEEE Trans. Comput., vol. 37, pp. 10191029, Sept. 1988.
[6] D. H. Lawrie, "Access and alignment of data in an array processor,"IEEE Trans. Comput., vol. C24, pp. 11451155, Dec. 1975.
[7] D. Lee and K. Y. Lee, "Control algorithms for the augmented data manipulator network," inProc. 1986 Int. Conf. Parallel Processing, Aug. 1986, pp. 123130.
[8] M. Malek and W. W. Myre, "A description method of interconection networks,"IEEE Tech. Committee Distrib. Process., Quart. vol. 1, pp. 16, Feb. 1981.
[9] R. J. McMillen and H. J. Siegel, "Routing schemes for the augmented data manipulator network in an MIMD system,"IEEE Trans. Comput., vol. C31, pp. 12021214, Dec. 1982.
[10] R. J. McMillen and H. J. Siegel, "Performance and fault tolerance improvements in the inverse augmented data manipulator network," inProc. 9th Annu. Symp. Comput. Architecture, Apr. 1982, pp. 6372.
[11] R. J. McMillen and H. J. Siegel, "Evaluation of cube and data manipulator networks,"J. Parallel Distributed Comput., vol. 2, no. 1, pp. 79107, Feb. 1985.
[12] K. Padmanabhan and D. H. Lawrie, "A class of redundant path multistage interconnection networks,"IEEE Trans. Comput., vol. C32, pp. 10991108, Dec. 1983.
[13] D. S. Parker and C. S. Raghavendra, "The Gamma network: A multiprocessor interconnnection network with redundant paths," inProc. 9th Annu. Symp. Comput. Architecture, Apr. 1982, pp. 7380.
[14] D. S. Parker and C. S. Raghavendra, "The Gamma network," zIEEE Trans. Comput., vol. C33, pp. 367373, Apr. 1984.
[15] M. C. Pease, III, "The indirect binaryncube microprocessor array,"IEEE Trans. Comput., vol. C26, pp. 458473, May 1977.
[16] H. J. Siegel,Interconnectron Networks for LargeScale Parallel Processing: Theory and Case Studies, second ed. New York: McGrawHill, 1990.
[17] H. J. Siegel and S. D. Smith, "Study of multistage SIMD interconnection networks," inProc. 5th Annu. Symp. Comput. Architecture, Apr. 1978, pp. 223229.
[18] H. J. Siegel and R. J. McMillen, "The multistage cube: A versatile interconnection network,"IEEE Comput. Mag., vol. 14, pp. 6576, Dec. 1981.
[19] A. Varma and C. S. Raghavendra, "On permutations passable by the Gamma network,"J. Parallel Distributed Comput., vol. 3. no. 1, pp. 7291, Mar. 1986.
[20] CL. Wu and TY. Feng, "On a class of multistage interconnection networks,"IEEE Trans. Comput., vol. C29, pp. 694702, Aug. 1980.
[21] CL. Wu and TY. Feng, "The reverseexchange interconnection network,"IEEE Trans. Comput., vol. C29, pp. 801811, Sept. 1980.
[22] D. Rau, J. A. B. Fortes, and H. J. Siegel, "Destination tag routing techniques based on a state model for the IADM network," Tech. Rep. TREE 8739, School of Electrical Engineering, Purdue Univ., West Lafayette, IN, 47907, Oct. 1987.