This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Destination Tag Routing Techniques Based on a State Model for the IADM Network
March 1992 (vol. 41 no. 3)
pp. 274-285

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 blockage-free 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 n-cube 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. C-32, pp. 637-648, July 1983.
[2] K. E. Batcher, "The Flip network in STARAN," inProc. 1976 Int. Conf. Parallel Processing, Aug. 1976, pp. 65-71.
[3] T.-Y Feng, "Data manipulating functions in parallel processors and their implementations,"IEEE Trans. Comput., vol. C-23, pp. 309-318, 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. 21-28.
[5] M. Jeng and H. J. Siegel, "Design and analysis of dynamic redundancy networks,"IEEE Trans. Comput., vol. 37, pp. 1019-1029, Sept. 1988.
[6] D. H. Lawrie, "Access and alignment of data in an array processor,"IEEE Trans. Comput., vol. C-24, pp. 1145-1155, 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. 123-130.
[8] M. Malek and W. W. Myre, "A description method of interconection networks,"IEEE Tech. Committee Distrib. Process., Quart. vol. 1, pp. 1-6, 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. C-31, pp. 1202-1214, 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. 63-72.
[11] R. J. McMillen and H. J. Siegel, "Evaluation of cube and data manipulator networks,"J. Parallel Distributed Comput., vol. 2, no. 1, pp. 79-107, Feb. 1985.
[12] K. Padmanabhan and D. H. Lawrie, "A class of redundant path multistage interconnection networks,"IEEE Trans. Comput., vol. C-32, pp. 1099-1108, 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. 73-80.
[14] D. S. Parker and C. S. Raghavendra, "The Gamma network," zIEEE Trans. Comput., vol. C-33, pp. 367-373, Apr. 1984.
[15] M. C. Pease, III, "The indirect binaryn-cube microprocessor array,"IEEE Trans. Comput., vol. C-26, pp. 458-473, May 1977.
[16] H. J. Siegel,Interconnectron Networks for Large-Scale Parallel Processing: Theory and Case Studies, second ed. New York: McGraw-Hill, 1990.
[17] H. J. Siegel and S. D. Smith, "Study of multistage SIMD interconnection networks," inProc. 5th Annu. Symp. Comput. Architecture, Apr. 1978, pp. 223-229.
[18] H. J. Siegel and R. J. McMillen, "The multistage cube: A versatile interconnection network,"IEEE Comput. Mag., vol. 14, pp. 65-76, 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. 72-91, Mar. 1986.
[20] C-L. Wu and T-Y. Feng, "On a class of multistage interconnection networks,"IEEE Trans. Comput., vol. C-29, pp. 694-702, Aug. 1980.
[21] C-L. Wu and T-Y. Feng, "The reverse-exchange interconnection network,"IEEE Trans. Comput., vol. C-29, pp. 801-811, 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. TR-EE 87-39, School of Electrical Engineering, Purdue Univ., West Lafayette, IN, 47907, Oct. 1987.

Index Terms:
necessary and sufficient conditions; state model; IADM network; routing; inverse augmented data manipulator; reroutability; universal rerouting algorithm; lower bound; isomorphic; indirect binary n-cube network; permutation routing; fault tolerant computing; multiprocessor interconnection networks.
Citation:
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. 274-285, March 1992, doi:10.1109/12.127440
Usage of this product signifies your acceptance of the Terms of Use.