Resource constrained and speculative scheduling of an algorithm class with run-time dependent conditionals

Proceedings of the International Conference on Application-Specific Systems, Architectures and Processors

Volumn , Issue , 2004, Pages 17-27

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

^a UNIVERSITY OF ERLANGEN NUREMBERG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SOFTWARE; CONSTRAINT THEORY; DATA FLOW ANALYSIS; FORMAL LANGUAGES; IMAGE PROCESSING; MATHEMATICAL MODELS; SCHEDULING;

AFFINE INDEXED ALGORITHMS (AIA); AFFINE RECURRENCE EQUATIONS (SARE); RUN-TIME DEPENDENTS; SINGLE ASSIGNMENT CODE (SAC);

PARALLEL ALGORITHMS;

EID: 11244260930     PISSN: 10636862     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (28)

1. R. Andonov and S. Rajopadhye. An Optimal Algo-Tech-Cuit for the Knapsack Problem. Technical Report PI-791, IRISA, Campus de Beaulieu, Rennes, France, January 1994.
2. M. Bednara and J. Teich. Automatic Synthesis of FPGA Processor Arrays from Loop Algorithms. The Journal of Supercomputing, 26(2): 149-165, 2003.
3. CELOXICA, Handel-C. www.celoxica.com.
4. J.-F. Collard, D. Barthou, and P. Feautrier. Fuzzy Array Dataflow Analysis. In Proceedings of the fifth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pages 92-101. ACM Press, 1995.
5. U. Eckhardt and R. Merker. Hierarchical Algorithm Partitioning at System Level for an Improved Utilization of Memory Structures. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 18(1):14-24, 1999.
6. P. Feautrier. Automatic Parallelization in the Polytope Model. Technical Report 8, Laboratoire PRiSM, Université des Versailles St-Quentin en Yvelines, 45, F-78035 Versailles Cedex, June 1996.
7. M. Griebl and C. Lengauer. The Loop Parallelizer LooPo. In M. Gerndt, editor, Proc. Sixth Workshop on Compilers for Parallel Computers, volume 21 of Konferenzen des Forschungszentrums Jülich, pages 311-320. Forschungszentrum Jülich, 1996.
8. S. Gupta, N. D. Dutt, R. K. Gupta, and A. Nicolau. SPARK: A High-Level Synthesis Framework for Applying Parallelizing Compiler Transformations. In Proceedings of the International Conference on VLSI Design, January 2003.
9. F. Hannig, H. Dutta, and J. Teich. Regular Mapping for Coarse-grained Reconfigurable Architectures. In Proceedings of the 2004 IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP 2004), volume V, pages 57-60, Montréal, Quebec, Canada, May 2004. IEEE.
10. F. Hannig and J. Teich. Dynamic Piecewise Linear/Regular Algorithms. In Proceedings of the Fourth International Conference on Parallel Computing in Electrical Engineering (PARELEC2004), Dresden, Germany, September 2004.
11. F. Hannig and J. Teich. Resource Constrained and Speculative Scheduling of Dynamic Piecewise Regular Algorithms. Technical Report 01-2004, University of Erlangen-Nuremberg, Department of CS 12, Hardware-Software-Co-Design, Am Weichselgarten 3, D-91058 Erlangen, Germany, June 2004.
12. C.-T. Hwang, Y.-C. Hsu, and Y.-L. Lin. Optimum and Heuristic Data Path Scheduling under Resource Constraints. In Conference proceedings on 27th ACM/IEEE design automation conference, pages 65-70. ACM Press, 1990.
13. R. M. Karp, R. E. Miller, and S. Winograd. The Organization of Computations for Uniform Recurrence Equations. Journal of the Association for Computing Machinery, 14(3):563-590, 1967.
14. V. Kathail, S. Aditya, R. Schreiber, B. R. Rau, D. C. Cronquist, and M. Sivaraman. PICO: Automatically Designing Custom Computers. Computer, 35(9):39-47, 2002.
15. B. Kienhuis. MatParser: An Array Dataflow Analysis Compiler. Technical Report UCB/ERL M00/9, University of California, Berkeley, CA-94720, U.S.A., February 2000.
16. B. Kienhuis, E. Rijpkema, and E. F. Deprettere. Compaan: Deriving Process Networks from Matlab for Embedded Signal Processing Architectures. In Proceedings of the 8th International Workshop on Hardware/Software Co-Design, pages 13-17. ACM Press, 2000.
17. R. 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.
18. G. M. Megson. Mapping a Class of Run-Time Dependencies onto Regular Arrays. In Proceedings 7th International Parallel Processing Symposium, pages 97-104, Newport Beach, CA, April 1993. IEEE.
19. D. I. Moldovan. On the Design of Algorithms for VLSI Systolic Arrays. In Proceedings of the IEEE, volume 71, pages 113-120, January 1983.
20. PARO Design System Project. www12.informatik.uni-erlangen.de/research/ paro.
21. S. K. Rao. Regular Iterative Algorithms and their Implementations on Processor Arrays. PhD thesis, Stanford University, 1985.
22. R. Schreiber, S. Aditya, B. R. Rau, V. Kathail, S. Mahlke, S. Abraham, and Or. Snider. High-Level Synthesis of Nonprogrammable Hardware Accelerators. Technical Report HPL-2000-31, Hewlett-Packard Laboratories, Palo Alto, May 2000.
23. G. S. Sohi, S. E. Breach, and T. N. Vijaykumar. Multiscalar Processors. In 25 Years of the International Symposia on Computer Architecture (selected papers), pages 521-532. ACM Press, 1998.
24. T. Stefanov and E. F. Deprettere. Deriving Process Networks from Weakly Dynamic Applications in System-Level Design. In Proceedings of the 1st IEEE/ACM/IFIP International Conference on Hardware/Software Codesign & System synthesis (CODES+ISSS'03), pages 90-96. ACM Press, 2003.
25. Synfora, Inc. www.synfora.com.
26. J. Teich. A Compiler for Application-Specific Processor Arrays. PhD thesis, Institut für Mikroelektronik, Universität des Saarlandes, Saarbrücken, Deutschland, 1993.
27. L. Thiele. Resource Constrained Scheduling of Uniform Algorithms. Journal of VLSI Signal Processing, 10:295-310, 1995.
28. D. Wilde and O. Sié. Regular Array Synthesis using Alpha. In Int. Conf. on Application Specific Array Processors, San Francsico, California, pages 200-211, August 1994.