This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Using the Dual Path Property of Omega Networks to Obtain Conflict-Free Message Routing
October 1991 (vol. 2 no. 4)
pp. 503-507

A strategy for dealing with communication conflicts that occur in omega networks is presented. The strategy operates by implementing the dual path property of omega networks, which allows the source and destination processors to reverse roles for some of the messages that are being transmitted. For certain message patterns, such as reversal, produces a modified message pattern for which the network routes are disjoint. For a circuit switching mode in which the network links and switches are bidirectional, the disjoint set of routes for modified message pattern can be used to achieve conflict-free message transmission for the original message pattern. This strategy is investigated, and an efficient algorithm to determine whether it can be successfully applied to a given message pattern is presented.

[1] D. P. Agrawal, "Graph theoretical analysis and design of multistage interconnection networks,"IEEE Trans. Comput.vol. C-32, pp. 637-648, July 1983.
[2] S. Arora, T. Leighton, and B. Maggs, "On-line algorithms for path selection in a nonblocking network," inProc. 22nd Annu. ACM Symp. Theory Comput., May 1990, pp. 149-158.
[3] J. C. Bermond, J. M. Fourneau, and A. Jean-Marie, "Equivalence of multistage interconnection networks,"Inform. Processing Lett., vol. 26, pp. 45-50, Sept. 1987.
[4] P. J. Bernhard and D. J. Rosenkrantz, "The complexity of routing through an omega network," inProc. Twenty-Fifth Annu. Allerton Conf. Commun., Contr., Comput., Sept. 1987, pp. 1027-1036. Also appears as Tech. Rep. TR 87-12 Comput. Sci. Dept., SUNY Albany, Albany, NY, 1987.
[5] S. Even, A. Itai, and A. Shamir, "On the complexity of timetable and multicommodity flow problems,"SIAM J. Comput., vol. 5, pp. 691-703, 1976.
[6] M. R. Garey and D. S. Johnson,Computers and Intractability: A Guide to Theory of NP-Completeness. San Francisco, CA: Freeman, 1979.
[7] R. M. Hardy, personal communication.
[8] D. H. Lawrie, "Access and alignment of data in an array processor,"IEEE Trans. Comput., vol. C-24, pp. 1145-1154, Dec. 1975.
[9] D. Mitra and R. A. Cieslak, "Randomized parallel communications on an extension of the omega network,"J. ACM, vol. 34, no. 4, pp. 802-824, Oct. 1987.
[10] D. S. Parker, "Notes on shuffle/exchange-type switching networks,"IEEE Trans. Comput., vol. C-29, pp. 213-222, Mar. 1980.
[11] N. Pippenger, "Telephone switching networks," inProc. Symp. Appl. Math., The Math. of Networks, vol. 26, pp. 101-133.
[12] H. J. Siegel,Interconnection Networks for Large-Scale Parallel Processing: Theory and Case Studies. Lexington, MA: Lexington Books, 1985.
[13] L. G. Valiant, "A scheme for fast parallel communication,"SIAM J. Comput., vol. 11, no. 2, pp. 350-361, May 1982.

Index Terms:
Index Termssource processors; disjoint network routes; bidirectional network links; bidirectionalnetwork switches; dual path; omega networks; conflict-free message routing;communication conflicts; destination processors; message patterns; circuit switchingmode; conflict-free message transmission; algorithm; message switching; multiprocessorinterconnection networks; parallel algorithms
Citation:
P.J. Bernhard, D.J. Rosenkrantz, "Using the Dual Path Property of Omega Networks to Obtain Conflict-Free Message Routing," IEEE Transactions on Parallel and Distributed Systems, vol. 2, no. 4, pp. 503-507, Oct. 1991, doi:10.1109/71.97906
Usage of this product signifies your acceptance of the Terms of Use.