This Article 
 Bibliographic References 
 Add to: 
A Synthesis Algorithm for Reconfigurable Interconnection Networks
June 1988 (vol. 37 no. 6)
pp. 691-699
The performance of a parallel algorithm depends in part on the interconnection topology of the target parallel system. An interconnection network is called reconfigurable if its topology can be changed between different algorithm executions. Since communication patterns vary from one parallel algorithm to another, a reconfigurable network can effectively support algorithms with different commun

[1] L. Wittie, "Communication structures for large networks of microcomputers,"IEEE Trans. Comput., vol. C-30, pp. 264-273, Apr. 1981.
[2] D. P. Agrawalet al., "Evaluating the performance of multicomputer configurations,"IEEE Comput. Mag., vol. 19, pp. 23-37, May 1986.
[3] A. L. Rosenberg, "Data encodings and their costs,"Acta Informatica, vol. 9, pp. 273-292, 1978.
[4] H. Li, C. Wang, and M. Lavin, "The V language for polymorphic architectures and algorithms," inIntermediate-Level Image Processing, M. B. Duff, Ed. New York: Academic, 1986.
[5] K. E. Batcher, "Design of a massively parallel processor,"IEEE Trans. Comput., pp. 836-840, Sept. 1980.
[6] L. Snyder, "Introduction to the configurable, highly parallel computer,"Computer, vol. 15, pp. 47-56, Jan. 1982.
[7] D. Smitley, I. Lee, and S. Goldwasser, "The design of an optical network and its utilization," inProc. 1986 Optoelectron. Laser Appl. Sci. Eng. Conf., Los Angeles, CA, Jan. 1986.
[8] A. A. Sawchuk, B. K. Jenkins, C. S. Raghavendra, and A. Varma, "Optical interconnection networks," inProc. 1985 Int. Conf. Parallel Processing, Aug. 1985, pp. 388-392.
[9] S. Bokhari, "On the mapping problem,"IEEE Trans. Comput., vol. C-30, pp. 207-214, Mar. 1981.
[10] F. Haray,Graph Theory. Reading, MA: Addison-Wesley, 1969.
[11] M. Yannakakis, "Edge deletion problems,"SIAM J. Comput., vol. 10, pp. 297-309, May 1981.
[12] M. R. Garey and D. S. Johnson,Computers and Intractability: A Guide to Theory of NP-Completeness. San Francisco, CA: Freeman, 1979.
[13] I. Lee and D. Smitley, "A synthesis algorithm for reconfigurable interconnection networks," Tech. Rep., MS-CIS-86-46, Dep. Comput. Inform. Sci., Univ. Pennsylvania, May 1986.
[14] J. Edmonds and E. L. Johnson, "Matching: A well-solved class of integer linear programs," inCombinatorical Structures Appl., Proc. Calgary Int. Conf. Comb. Struct. Appl., New York: Gordon and Breach, June 1969, pp. 89-92.
[15] C. Berge, "Alternating chain methods: A survey," inGraph Theory and Computing, R. C. Read, Ed. New York: Academic, 1972.
[16] H. N. Gabow, "An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems," inProc. 1983 ACM Symp. Theory Comput., 1983, pp. 448-456.
[17] A. V. Aho, J. E. Hopcroft, and J. D. Ullman,The Design and Analysis of Computer Algorithms. Menlo Park, CA: Addison-Wesley, 1974.
[18] B. Bollobas and S. E. Eldridge, "Maximal matchings in graphs with given minimal and maximal degrees," inProc. Cambridge Phil. Soc., vol. 79, 1974, pp. 221-234.
[19] M. Kano and A. Saito, "[a, b]-factors of graphs,"Discrete Math., vol. 47, pp. 113-116, 1983.
[20] B. Bollobas,Graph Theory, An Introductory Course. New York: Springer-Verlag, 1979.
[21] E. Shamir and E. Upfal, "On factors in random graphs,"Israel J. Math., vol. 39, pp. 297-302, 1981.
[22] N. C. Wormald, "The asymptotic connectivity of labelled regular graphs,"J. Combinatorial Theory Series B 31, pp. 156-167, 1981.

Index Terms:
simulation; synthesis algorithm; reconfigurable interconnection networks; performance; parallel algorithm; target parallel system; task graph; average-case performance prediction; graph theory; parallel algorithms; performance evaluation.
I. Lee, D. Smitley, "A Synthesis Algorithm for Reconfigurable Interconnection Networks," IEEE Transactions on Computers, vol. 37, no. 6, pp. 691-699, June 1988, doi:10.1109/12.2207
Usage of this product signifies your acceptance of the Terms of Use.