
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Vipul Gupta, Eugen Schenfeld, "Annealed Embeddings of Communication Patterns in an Interconnection Cached Network," IEEE Transactions on Parallel and Distributed Systems, vol. 6, no. 11, pp. 11531167, November, 1995.  
BibTex  x  
@article{ 10.1109/71.476187, author = {Vipul Gupta and Eugen Schenfeld}, title = {Annealed Embeddings of Communication Patterns in an Interconnection Cached Network}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {6}, number = {11}, issn = {10459219}, year = {1995}, pages = {11531167}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.476187}, 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  Annealed Embeddings of Communication Patterns in an Interconnection Cached Network IS  11 SN  10459219 SP1153 EP1167 EPD  11531167 A1  Vipul Gupta, A1  Eugen Schenfeld, PY  1995 KW  Interconnection cache KW  interconnection networks KW  switching locality KW  latency reduction KW  optical networks KW  reconfigurable parallel architectures KW  process mapping KW  simulated annealing. VL  6 JA  IEEE Transactions on Parallel and Distributed Systems ER   
The problem of identifying whether a graph has a bounded $\$\backslash ell\$$contraction for a given integer $\$\backslash ell\$$ is known to be NPcomplete for $\$\backslash ell\; >\; 2\$$. We describe a heuristic algorithm based on simulated annealing for this problem. We test the effectiveness of our approach by using it to embed graphs, representing regular communication patterns, for which the best solutions are deterministically known. The algorithm does not rely on any structural information of the communication pattern and is therefore applicable to irregular patterns as well. The results of applying our heuristics to embed such irregular graphs are also presented. These embeddings in the ICN allow low latency communication paths to be established between the computation entities of parallel applications.
[1] A. Barak and R. BenNatan,“Bounded contractions of full trees,” J. Parallel and Distributed Computing, vol. 17, no. 4, pp. 363369, Apr. 1993.
[2] A. Barak and E. Schenfeld,“Embedding classical communication topologies in the OPAM architecture,” Technical Report TR 9012, Dept. of Computer Science, The Hebrew Univ. of Jerusalem, Aug. 1990. A shorter version appears in Proc. IEEE Symp. Parallel and Distributed Processing, pp. 482485, Dec. 1991.
[3] J. Beetem, M. Denneau, and D. Weingarten, “The GF11 Supercomputer,” Proc. 12th Ann. Int'l Symp. Computer Architecture, pp. 108115, 1985.
[4] F. Berman and L. Snyder, "On Mapping Parallel Algorithms into Parallel Architectures," J. Parallel and Distributed Computing, vol. 4, pp. 439458, 1987.
[5] J. Bhasker and S. Sahni,“Optimal linear arrangement of circuit components,” J. VLSI and Computer Systems, vol. 2, pp. 87109, 1987.
[6] Pyramidal System for Computer Vision, V. Cantoni and S. Levialdi, eds., vol. F25of NATO ASI Series. Berlin, Heidelberg: SpringerVerlag, 1987.
[7] W.M. Chen,Y.X. Wong,, and X. Ping,“Flowshop scheduling by the knowledge of statistical mechanics and annealing,” Proc. 26th IEEE Conf. Decision Control, vol. 1, pp. 642643, 1987.
[8] J. Deminet,“Experience with multiprocessor algorithms,” IEEE Trans. Computers, vol. 31, no. 4, Apr. 1982.
[9] A. Despain and D. Patterson,“Xtree: A structured multiprocessor computer architecture,” Proc. Fifth Ann. Int’l Symp. Computer Architecture, pp. 144151, 1978.
[10] I.S. Duff, R. Grimes, and J. Lewis, “Sparse Matrix Test Problems,” ACM Trans. Mathematical Software, vol. 15, pp. 1–14, Mar. 1989.
[11] Federal Coordinating Council for Science, Engineering and Tech nology, “Grand challenges 1993: High performance computing and communications,” a report by the Committee on Physical, Mathematical, and Engineering Sciences, Nat’l Science Foundation, 1993.
[12] I. Foster and S. Tuecke,“Parallel programming with PCN,” Technical Report ANL91/32 Rev. 2, Argonne Nat’l laboratory, Argonne, Ill., Jan. 1993.
[13] L. Goldstein and M.S. Waterman,“Mapping DNA by stochastic relaxation,” Advances in Applied Mathematics, vol. 8, pp. 194207, 1987.
[14] V. Gupta,“Mapping techniques and performance analysis for an interconnection cached multiprocessor network,” PhD thesis, Rutgers Univ., New Brunswick, N.J., Oct. 1994.
[15] V. Gupta and E. Schenfeld,“A heuristic approach for embedding communication patterns in an interconnection cached parallel processing network,” Proc. Seventh Int’l Parallel Processing Symp., pp. 291297, Apr. 1993.
[16] V. Gupta and E. Schenfeld,“A comparative performance study of an interconnection cached network,” Proc. Int’l Conf. Parallel Processing, vol. I, pp. 191195, Aug. 1994.
[17] F.K. Hwang, "Control Algorithms for Rearrangeable Clos Networks," IEEE Trans. Comm., vol. 31, pp. 952954, Aug. 1983.
[18] L.H. Jamieson,The Characteristics of Parallel Algorithms, chapter “Characterizing parallel algorithms,” pp. 65100.Cambridge, Mass.: MIT Press, 1987.
[19] D.S. Johnson, C. Aragon, L. McGeoch, and C. Schevon, "Optimization by Simulated Annealing: An Experimental Evaluation, Part 1, Graph Partitioning," Operations Research, vol. 37, pp. 865892, 1989.
[20] S. Kirkpatrick,C.D. Gelatt Jr.,, and M.P. Vecchi,“Optimization by simulated annealing,” Science, vol. 220, pp. 671680, May 1983.
[21] H.T. Kung,“The structure of parallel algorithms,” Advances in Computers, vol. 19, pp. 65112, 1980.
[22] F.T. Leighton,Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes.San Mateo, Calif.: Morgan Kaufmann, 1992.
[23] Y.D. Lyuu and E. Schenfeld,“Parallel graph contraction with applications to a reconfigurable parallel architecture,” Proc. 1994 Int’l Conf. Parallel Processing, vol. III, pp. 258265, Aug. 1994.
[24] R. McGill,J.W. Tukey,, and W.A. Desarbo,“Variations on box plots,” Amer. Stat., vol. 32, no. 1, pp. 1216, 1978.
[25] D.M. Nicholson,A. Chowdhary,, and L. Schwartz,“Monte Carlo optimization of pair distributed functions—application to the electronic structure of disordered metals,” Physical Review B, vol. 19, pp. 1,6331,637, 1984.
[26] J. Ortega and R. Voigt,“Solution of partial differential equations on vector and parallel computers,” SIAM Review, vol. 27, no. 2, pp. 149240, 1985.
[27] R.H.J.M. Otten and L.P.P.P. van Ginneken,“Floorplan design using simulated annealing,” Proc. IEEE Int’l Conf. ComputerAided Design, pp. 9698,Santa Clara, Calif., 1984.
[28] F.P. Preparata and J. Vuillemin, “The CubeConnected Cycles: A Versatile Network for Parallel Computation,” Comm ACM, vol. 24, no. 5, pp. 300309, 1981.
[29] B. Ramamurthy and M.S. Krishnamoorthy,“Bounded 2contractions of graphs,” Proc. 1991 Ann. Allerton Conf. Communication, Control and Computing, pp. 498507, 1991.
[30] B. Ramamurthy and M.S. Krishnamoorthy,“Bounded pcontractability is NPcomplete,” Technical Report 9217, Dept. of Computer Science, Rennselaer Polytechnic Inst., Troy, N.Y., June 1992.
[31] M.R. Samatham and D.K. Pradhan, "The de Bruijn Multiprocessor Network: A Versatile Parallel Processing and Sorting Network for VLSI," IEEE Trans. Computers, vol. 38, no. 4, pp. 567581, Apr. 1989.
[32] A.A. Sawchuk, C.S. Raghavandra, B.K. Jenkins, and A. Varma, “Optical Crossbar Networks,” IEEE Computer, vol. 20, no. 6, pp. 50–62, June 1987.
[33] E. Schenfeld,“The optical parallel architecture model (OPAM) experiment—project plan and motivations,” Technical Report TR 8817, Dept. of Computer Science, Hebrew Univ. of Jerusalem, Aug. 1988.
[34] H.J. Siegel,“The theory underlying the partitioning of permutation networks,” IEEE Trans. Computers, vol. 29, no. 9, pp. 791800, Sept. 1980.
[35] H.D. Simon,“Partitioning of unstructured problems for parallel processing,” Computing Systems in Engineering, vol. 2, no. 2/3, pp. 135148, 1991.
[36] L. Snyder,“Introduction to the configurable, highly parallel computer,” Computer, vol. 17, no. 7, pp. 2736, July 1984.
[37] L. Snyder,“Parallel programming and the Poker programming environment,” Computer, vol. 15, pp. 4756, Jan. 1982.
[38] L.T. Willie,“The football pool problem for 6 matches: A new upper bound obtained by simulated annealing,” J. Combinatorial Theory A, vol. 45, pp. 171177, 1987.