
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, "Partitioning Message Patterns for Bundled Omega Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 5, no. 4, pp. 353363, April, 1994.  
BibTex  x  
@article{ 10.1109/71.273044, author = {P.J. Bernhard and D.J. Rosenkrantz}, title = {Partitioning Message Patterns for Bundled Omega Networks}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {5}, number = {4}, issn = {10459219}, year = {1994}, pages = {353363}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.273044}, 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  Partitioning Message Patterns for Bundled Omega Networks IS  4 SN  10459219 SP353 EP363 EPD  353363 A1  P.J. Bernhard, A1  D.J. Rosenkrantz, PY  1994 KW  Index Termscommunication complexity; multiprocessor interconnection networks; telecommunication network routing; message patterns; bundled omega networks; communication conflict; partitioning; conflicting messages; interconnection links; computational complexity; NPcomplete; online heuristics; performance ratio; interconnection network; message routing; multiprocessor; heuristic VL  5 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Considers a strategy for dealing with communication conflicts in omega networks. Specifically, the authors consider the problem of partitioning a set of conflicting messages into a minimum number of subsets, called rounds, each free of communication conflicts. In addition to standard omega networks, they consider this problem for a more general class of networks called bundled omega networks, where interconnection links in the network are replaced by bundles of wires. Although the partitioning problem has previously been considered in the literature, its computational complexity has remained open. The authors show that for a number of cases, the problem is NPcomplete, but for certain special cases, it is solvable in polynomial time. In addition, they present a class of distributed, online heuristics for the problem. Finally, they give a lower bound of /spl Omega/(log N) on the performance ratio for one of these heuristics.
[1] R. Aleliunas, "Randomized parallel communication,"Proc. ACM SIGACTSIGOPS Symp. Principles Distrib. Computing, New York: ACM, 1982, pp. 6072.
[2] D.P. Agrawal, "Graph theoretical analysis and design of multistate interconnection networks,"IEEE Trans. Comput., vol. C32, no. 7, pp. 637648, July 1983.
[3] 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.
[4] B. Awerbuch, A. BarNoy, N. Linial, and D. Peleg, "Improved routing strategies with succinct tables,"J. Algorithms, vol. 11, pp. 307341, Sept. 1990.
[5] M. Ajtai, J. Komlos, and E. Szemeredi, "AnO(nlogn) sorting network," inProc. 15th ACM Symp. Theory Comput., 1983, pp. 19.
[6] P. Bernhard, "Bounds on the performance of message routing heuristics,"Proc. 3rd Symp. Parallel Distrib. Processing, pp. 856863, Dec. 1991.
[7] K. E. Batcher, "Sorting networks and their application,"Proc. AFIPS Spring Joint Comput. Conf., vol. 32, pp. 307314, 1968.
[8] P. J. Bernhard and D.J. Rosenkrantz, "The complexity of routing through an omega network," Tech. Rep. TR8712, Computer Science Dept., State Univ. of N.Y., Albany.
[9] P. J. Bernherd and D. J. Rosenkrantz, "An efficient method for representing and transmitting message patterns on multiprocessor interconnection networks,"J. Parallel Distributed Comput., vol. 11, pp. 7285, 1991.
[10] R. Cypher and C. G. Plaxton, "Deterministic sorting in nearly logarithmic time on the hypercube and related computers," inProc. 22nd ACM Symp. Theory Comput., 1990, pp. 193203.
[11] J. S. Deogun and Z. Fang, "A heuristic algorithm for conflict resolution problem in multistage interconnection networks,"Proc. 1987 Int. Conf. Parallel Processing, Penn. State Univ., pp. 475478.
[12] Z. Fang, "Mathematical theory of multistage interconnection networks analysis," Ph.D. dissertation, Depts. of Engineering and Computer Science, University of Nebraska, Lincoln, 1984.
[13] G. N. Frederickson and R. Janardan, "Spaceefficient message routing in cdecomposable networks,"SIAM J. Comput.vol. 19, pp. 164181, Feb. 1990.
[14] D. D. Gajskiet al., "CedarA large scale multiprocessor,"Proc. 1983 Int. Conf. Parallel Processing, 1983, pp. 524529.
[15] M. R. Garey and D. S. Johnson,Computers and Intractability: A Guide to Theory of NPCompleteness. San Francisco, CA: Freeman, 1979.
[16] M. M. Halldorsson, "A still better performance guarantee for approximate graph coloring," DIMACS Technical Report 9044, Department of Computer Science, Rutgers University, 1990.
[17] D. S. Johnson, "Worst case behavior of graph coloring algorithms,"Proc. 5th Southeastern Conf. Combinatorics, Graph Theory and Computing, Winnipeg, MB, Canada, 1974, pp. 513527.
[18] R. R. Koch, "Increasing the size of a network by a constant factor can increase performance by more than a constant factor," inProc. 29th Annu. Symp. Foundations Comput. Sci., IEEE, Oct. 1988, pp. 221230.
[19] B. C. Kuszmaul, "Fast, deterministic routing, on hypercubes, using small buffers,"IEEE Trans. Comput., vol. 39, pp. 13901393, Nov. 1990.
[20] T. Leighton, "Tight bounds on the complexity of parallel sorting,"IEEE Trans. Comput., vol. C34, no. 4, pp. 344354, Apr. 1985.
[21] D. H. Lawrie, "Access and alignment of data in an array processor,"IEEE Trans. Comput., vol. C21, no. 12, pp. 11451155, Dec. 1975.
[22] T. Leighton, B. Maggs, and S. Rao, "Universal packet routing algorithms,"Proc. 29th IEEE Symp. Foundations Comput. Sci., 1988, pp. 256269.
[23] 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.
[24] D. S. Parker, "Notes on shuffle/exchangetype switching networks,"IEEE Trans. Comput., vol. C29, no. 3, March 1980, pp. 213222.
[25] N. Pippenger, "Parallel communication with limited buffers," inFoundations of Comput. Sci., pp. 127136, 1984.
[26] D. Peleg and E. Upfal, "A timerandomness tradeoff for oblivious routing,"SIAM J. Comput., vol. 19, pp. 256266, Apr. 1990.
[27] F. P. Preparata and J. Vuillemin, "The cubeconnected cycle: A versatile network for parallel computation,"Commun. ACM, vol. 24, pp. 300309, May 1981.
[28] A. G. Ranade, "How to emulate shared memory,"Proc. 28th Ann. Symp. Foundations Computer Sci., 1987, pp. 185194.
[29] C. S. Raghavendra and A. Varma, "Faulttolerant multiprocessors with redundant path interconnection network,"IEEE Trans. Comput., vol. C35, no. 4, pp. 307316, Apr. 1986.
[30] H. J. Siegel,Interconnection Networks for LargeScale Parallel Processing: Theory and Case Studies. Lexington, MA: Lexington Books, 1985.
[31] T. H. Szymanski and V. C. Hamacher, "On the permutation capability of multistage interconnection networks,"IEEE Trans. Comput., vol. C36, pp. 810822, July 1987.
[32] E. Upfal, "Efficient schemes for parallel communication,"J. ACM, vol. 31, no. 3, July 1984.
[33] E. Upfal, "AnO(logN) deterministic packet routing scheme," inProc. 21st Annu. ACM Symp. Theory Comput., May 1989, pp. 241250.
[34] L. G. Valiant and G. Brebner, "Universal schemes for parallel communication," inProc. 13th Annu. ACM Symp. Theory Comput., 1981.
[35] C. L. Wu and T. Y. Feng, "On a class of multistage interconnection networks,"IEEE Trans. Comput., vol. C29, no. 8, August 1980, pp. 694702.