Design space exploration for massively parallel processor arrays

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2127, Issue , 2001, Pages 51-65

  Hannig, Frank ^a   Teich, Jürgen ^a  

^a UNIVERSITY OF PADERBORN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COSTS; HARDWARE; INTEGRATED CIRCUIT DESIGN; MAPPING; SYSTEMS ANALYSIS;

DESIGN SPACE EXPLORATION; HETEROGENEOUS HARDWARE; MASSIVE PARALLEL SYSTEMS; MASSIVELY PARALLEL PROCESSORS; MASSIVELY PARALLELS; MULTIPLE-OBJECTIVES; PROCESSING ELEMENTS; STATE-OF-THE-ART TECHNIQUES;

PARALLEL PROCESSING SYSTEMS;

EID: 84937567590     PISSN: None     EISSN: None     Source Type: Journal    
DOI: 10.1007/3-540-44743-1_5     Document Type: Article

References (16)

1. Philippe Clauss. Counting Solutions to Linear and Nonlinear Constraints through Ehrhart polynomials: Applications to Analyse and Transform Scientific Programs. In Tenth ACM International Conference on Supercomputing, Philadelphia, Pennsylvania, May 1996
2. Philippe Clauss and Vincent Loechner. Parametric Analysis of Polyhedral Iteration Spaces. Journal of VLSI Signal Processing, 19(2):179-194, July 1998
3. Dirk Fimmel and Renate Merker. Determination of Processor Allocation in the Design of Processor Arrays. Microprocessors and Microsystems, 22(3-4):149-155, 1998
4. Bart Kienhuis, Edwin Rijpkema, Ed F. Deprettere, and Paul Lieverse. High Level Modeling for Parallel Executions of Nested Loop Algorithms. In IEEE International Conference on Application-specific Systems, Architectures and Processors, pages 79-91, Boston, Massachusetts, 2000
5. Robert H. Kuhn. Transforming Algorithms for Single-Stage and VLSI Architectures. In Workshop on Interconnection Networks for Parallel and Distributed Processing, pages 11-19, West Layfaette, IN, April 1980
6. Christian Lengauer. Loop Parallelization in the Polytope Model. In Eike Best, editor, CONCUR’93, Lecture Notes in Computer Science 715, pages 398-416. Springer-Verlag, 1993
7. Dan I. Moldovan. On the Design of Algorithms for VLSI Systolic Arrays. In Proceedings of the IEEE, volume 71, pages 113-120, January 1983
8. John V. Oldfield and Richard C. Dorf. Field Programmable Gate Arrays: Reconfigurable Logic for Rapid Prototyping and Implementation of Digital Systems. John Wiley & Sons, Chichester, New York, 1995
9. Vilfredo Pareto. Cours d’Economie Politique, volume 1. F. Rouge & Cie., Lausanne, Switzerland, 1896
10. S. K. Rao. Regular Iterative Algorithms and their Implementations on Processor Arrays. PhD thesis, Stanford University, 1985
11. Robert Schreiber, Shail Aditya, B. Ramakrishna Rau, Vinod Kathail, Scott Mahlke, Santosh Abraham, and Greg Snider. High-Level Synthesis of Nonprogrammable Hardware Accelerators. In IEEE International Conference on Application-specific Systems, Architectures and Processors, pages 113-124, Boston, Massachusetts, 2000
12. Jürgen Teich. A Compiler for Application-Specific Processor Arrays. PhD thesis, Institut für Mikroelektronik, Universität des Saarlandes, Saarbrücken, Germany, 1993
13. Jürgen Teich, Lothar Thiele, and Li Zhang. Scheduling of Partitioned Regular Algorithms on Processor Arrays with Constrained Resources. Journal of VLSI Signal Processing, 17(1):5-20, September 1997
14. Lothar Thiele. Resource Constrained Scheduling of Uniform Algorithms. Journal of VLSI Signal Processing, 10:295-310, 1995
15. Yiwan Wong and Jean-Marc Delosme. Optimization of Processor Count for Systolic Arrays. Technical Report YALEEU/DCS/RR-697, Yale University, Department of Computer Science, New Haven, Conneticut, 1989
16. Xilinx, Inc. http://www.xilinx.com/products/software/jbits/