
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
I. Lee, D. Smitley, "A Synthesis Algorithm for Reconfigurable Interconnection Networks," IEEE Transactions on Computers, vol. 37, no. 6, pp. 691699, June, 1988.  
BibTex  x  
@article{ 10.1109/12.2207, author = {I. Lee and D. Smitley}, title = {A Synthesis Algorithm for Reconfigurable Interconnection Networks}, journal ={IEEE Transactions on Computers}, volume = {37}, number = {6}, issn = {00189340}, year = {1988}, pages = {691699}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.2207}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  A Synthesis Algorithm for Reconfigurable Interconnection Networks IS  6 SN  00189340 SP691 EP699 EPD  691699 A1  I. Lee, A1  D. Smitley, PY  1988 KW  simulation; synthesis algorithm; reconfigurable interconnection networks; performance; parallel algorithm; target parallel system; task graph; averagecase performance prediction; graph theory; parallel algorithms; performance evaluation. VL  37 JA  IEEE Transactions on Computers ER   
[1] L. Wittie, "Communication structures for large networks of microcomputers,"IEEE Trans. Comput., vol. C30, pp. 264273, Apr. 1981.
[2] D. P. Agrawalet al., "Evaluating the performance of multicomputer configurations,"IEEE Comput. Mag., vol. 19, pp. 2337, May 1986.
[3] A. L. Rosenberg, "Data encodings and their costs,"Acta Informatica, vol. 9, pp. 273292, 1978.
[4] H. Li, C. Wang, and M. Lavin, "The V language for polymorphic architectures and algorithms," inIntermediateLevel Image Processing, M. B. Duff, Ed. New York: Academic, 1986.
[5] K. E. Batcher, "Design of a massively parallel processor,"IEEE Trans. Comput., pp. 836840, Sept. 1980.
[6] L. Snyder, "Introduction to the configurable, highly parallel computer,"Computer, vol. 15, pp. 4756, 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. 388392.
[9] S. Bokhari, "On the mapping problem,"IEEE Trans. Comput., vol. C30, pp. 207214, Mar. 1981.
[10] F. Haray,Graph Theory. Reading, MA: AddisonWesley, 1969.
[11] M. Yannakakis, "Edge deletion problems,"SIAM J. Comput., vol. 10, pp. 297309, May 1981.
[12] M. R. Garey and D. S. Johnson,Computers and Intractability: A Guide to Theory of NPCompleteness. San Francisco, CA: Freeman, 1979.
[13] I. Lee and D. Smitley, "A synthesis algorithm for reconfigurable interconnection networks," Tech. Rep., MSCIS8646, Dep. Comput. Inform. Sci., Univ. Pennsylvania, May 1986.
[14] J. Edmonds and E. L. Johnson, "Matching: A wellsolved class of integer linear programs," inCombinatorical Structures Appl., Proc. Calgary Int. Conf. Comb. Struct. Appl., New York: Gordon and Breach, June 1969, pp. 8992.
[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 degreeconstrained subgraph and bidirected network flow problems," inProc. 1983 ACM Symp. Theory Comput., 1983, pp. 448456.
[17] A. V. Aho, J. E. Hopcroft, and J. D. Ullman,The Design and Analysis of Computer Algorithms. Menlo Park, CA: AddisonWesley, 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. 221234.
[19] M. Kano and A. Saito, "[a, b]factors of graphs,"Discrete Math., vol. 47, pp. 113116, 1983.
[20] B. Bollobas,Graph Theory, An Introductory Course. New York: SpringerVerlag, 1979.
[21] E. Shamir and E. Upfal, "On factors in random graphs,"Israel J. Math., vol. 39, pp. 297302, 1981.
[22] N. C. Wormald, "The asymptotic connectivity of labelled regular graphs,"J. Combinatorial Theory Series B 31, pp. 156167, 1981.