Optimization and interconnection complexity for: parallel processors, single-stage networks, and decision trees
- Author:
- Robert Henry Kuhn
Abstract
No abstract available.
Cited By
- Ganapathy K and Wah B (1996). Optimal Synthesis of Algorithm-Specific Lower-Dimensional Processor Arrays, IEEE Transactions on Parallel and Distributed Systems, 7:3, (274-287), Online publication date: 1-Mar-1996.
- Lee G (2019). Parallelizing Iterative Loops with Conditional Branching, IEEE Transactions on Parallel and Distributed Systems, 6:2, (185-189), Online publication date: 1-Feb-1995.
Gu J, Li Z and Lee G Symbolic array dataflow analysis for array privatization and program parallelization Proceedings of the 1995 ACM/IEEE conference on Supercomputing, (47-es)- Tzen T and Ni L (2019). Dependence Uniformization, IEEE Transactions on Parallel and Distributed Systems, 4:5, (547-558), Online publication date: 1-May-1993.
- O'Keefe M and Dietz H (2019). Loop Coalescing and Scheduling for Barrier MIMD Architectures, IEEE Transactions on Parallel and Distributed Systems, 4:9, (1060-1064), Online publication date: 1-Sep-1993.
- Wolfe M and Tseng C (1992). The Power Test for Data Dependence, IEEE Transactions on Parallel and Distributed Systems, 3:5, (591-601), Online publication date: 1-Sep-1992.
- Shang W and Fortes J (2019). Time Optimal Linear Schedules for Algorithms with Uniform Dependencies, IEEE Transactions on Computers, 40:6, (723-742), Online publication date: 1-Jun-1991.
- Goff G, Kennedy K and Tseng C Practical dependence testing Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation, (15-29)
- Goff G, Kennedy K and Tseng C (1991). Practical dependence testing, ACM SIGPLAN Notices, 26:6, (15-29), Online publication date: 1-Jun-1991.
- Li Z, Yew P and Zhu C Data dependence analysis on multi-dimensional array references Proceedings of the 3rd international conference on Supercomputing, (215-224)
- Li Z and Yew P Efficient interprocedural analysis for program parallelization and restructuring Proceedings of the ACM/SIGPLAN conference on Parallel programming: experience with applications, languages and systems, (85-99)
- Li Z and Yew P (2019). Efficient interprocedural analysis for program parallelization and restructuring, ACM SIGPLAN Notices, 23:9, (85-99), Online publication date: 1-Sep-1988.
- Irigoin F and Triolet R Supernode partitioning Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (319-329)
- Fortes J and Moldovan D (2019). Data broadcasting in linearly scheduled array processors, ACM SIGARCH Computer Architecture News, 12:3, (224-231), Online publication date: 1-Jun-1984.
- Fortes J and Moldovan D Data broadcasting in linearly scheduled array processors Proceedings of the 11th annual international symposium on Computer architecture, (224-231)
- Moldovan D (1982). On the Analysis and Synthesis of VLSI Algorithms, IEEE Transactions on Computers, 31:11, (1121-1126), Online publication date: 1-Nov-1982.
- Kuhn R Efficient mapping of algorithms to single-stage interconnections Proceedings of the 7th annual symposium on Computer Architecture, (182-189)
- Casavant A, Gajski D and Kuck D Automatic design with dependence graphs Proceedings of the 17th Design Automation Conference, (506-515)
- Padua D, Kuck D and Lawrie D (1980). High-Speed Multiprocessors and Compilation Techniques, IEEE Transactions on Computers, 29:9, (763-776), Online publication date: 1-Sep-1980.
Recommendations
Evolutionary optimization of multistage interconnection networks performance
GECCO '09: Proceedings of the 11th Annual conference on Genetic and evolutionary computationThe paper deals with optimization of collective communications on multistage interconnection networks (MINs). In the experimental work, unidirectional MINs like Omega, Butterfly and Clos are investigated. The study is completed by bidirectional binary, ...