
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
P.J. Bernhard, D.J. Rosenkrantz, "Using the Dual Path Property of Omega Networks to Obtain ConflictFree Message Routing," IEEE Transactions on Parallel and Distributed Systems, vol. 2, no. 4, pp. 503507, October, 1991.  
BibTex  x  
@article{ 10.1109/71.97906, author = {P.J. Bernhard and D.J. Rosenkrantz}, title = {Using the Dual Path Property of Omega Networks to Obtain ConflictFree Message Routing}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {2}, number = {4}, issn = {10459219}, year = {1991}, pages = {503507}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.97906}, 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  Using the Dual Path Property of Omega Networks to Obtain ConflictFree Message Routing IS  4 SN  10459219 SP503 EP507 EPD  503507 A1  P.J. Bernhard, A1  D.J. Rosenkrantz, PY  1991 KW  Index Termssource processors; disjoint network routes; bidirectional network links; bidirectionalnetwork switches; dual path; omega networks; conflictfree message routing;communication conflicts; destination processors; message patterns; circuit switchingmode; conflictfree message transmission; algorithm; message switching; multiprocessorinterconnection networks; parallel algorithms VL  2 JA  IEEE Transactions on Parallel and Distributed Systems ER   
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 conflictfree 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. C32, pp. 637648, July 1983.
[2] S. Arora, T. Leighton, and B. Maggs, "Online algorithms for path selection in a nonblocking network," inProc. 22nd Annu. ACM Symp. Theory Comput., May 1990, pp. 149158.
[3] J. C. Bermond, J. M. Fourneau, and A. JeanMarie, "Equivalence of multistage interconnection networks,"Inform. Processing Lett., vol. 26, pp. 4550, Sept. 1987.
[4] P. J. Bernhard and D. J. Rosenkrantz, "The complexity of routing through an omega network," inProc. TwentyFifth Annu. Allerton Conf. Commun., Contr., Comput., Sept. 1987, pp. 10271036. Also appears as Tech. Rep. TR 8712 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. 691703, 1976.
[6] M. R. Garey and D. S. Johnson,Computers and Intractability: A Guide to Theory of NPCompleteness. 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. C24, pp. 11451154, 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. 802824, Oct. 1987.
[10] D. S. Parker, "Notes on shuffle/exchangetype switching networks,"IEEE Trans. Comput., vol. C29, pp. 213222, Mar. 1980.
[11] N. Pippenger, "Telephone switching networks," inProc. Symp. Appl. Math., The Math. of Networks, vol. 26, pp. 101133.
[12] H. J. Siegel,Interconnection Networks for LargeScale 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. 350361, May 1982.