Towards the automatic optimal mapping of pipeline algorithms

Parallel Computing

Volumn 29, Issue 2, 2003, Pages 241-254

  Gonzalez D ^a   Almeida, F ^a   Moreno, L ^a   Rodriguez C ^a  

^a UNIVERSIDAD DE LA LAGUNA   (Spain)

Author keywords

Analytical models; Mapping; Parallel tools; Pipeline algorithms

Indexed keywords

COMPUTATION THEORY; MAPPING; PARALLEL PROCESSING SYSTEMS; RESOURCE ALLOCATION;

PIPELINE ALGORITHMS;

PARALLEL ALGORITHMS;

EID: 0037303964     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8191(02)00216-8     Document Type: Article

References (16)

1. R. Andonov, P.-Y. Calland, S. Niar, S. Rajopadhye, N. Yanev, First steps towards optimal oblique tiling of two-dimensional iterations, CPC2000, Compilers for Parallel Computers, 2000.
2. R. Andonov, S. Balev, S. Rajopadhye, N. Yanev, Optimal semi-oblique tiling and its application to sequence comparison, in: 13th ACM Symposium on Parallel Algorithms and Architectures (SPAA), 2001.
3. T. Brandes, Exploiting advanced task parallelism in high performance Fortran via a task library, in: Euro-Par'99 Parallel Processing Lecture Notes in Computer Science, vol. 1685, Springer-Verlag, 1999, pp. 833-844.
4. D. Culler, Karp Richard, D. Patterson, A. Sahay, K.E. Schauser, E. Santos, R. Subramonian, T. von Eicken, LogP: towards a realistic model of parallel computation, in: Proceedings of the 4th ACM SIGPLAN, Sym. Principles and Practice of Parallel Programming, May 1993.
5. Danelutto M., di Meglio R., Orlando S., Pelagatti S., Vanneschi M. A methodology for the development and the support of massively parallel programs. Future Gen. Comp. Syst. 8:1992;205-220.
6. M. Danelutto, F. Pasqualetti, S. Pelagatti, Skeletons for data parallelism in p. 31, Europar'97, Lecture Notes in Computer Science, vol. 1470, Springer-Verlag, 1997, pp. 619-628.
7. High Performance Fortran Language Specification Version 2.0, http://www.ntua.gr/parallel/standards/hpf/.
8. Ibaraki T. Enumerative approaches to combinatorial optimization, Part II. Ann. Operat. Res. 11(1-4):1988.
9. Li G., Wah B. Parallel processing of serial dynamic programming problems. IEEE. 1985.
10. Miguet S., Robert Y. Path planning on a ring of processors. Int. J. Comp. Math. 32:1990;61-74.
11. Moldovan D., Fortes J. Partitioning and mapping algorithms into fixed size systolic arrays. IEEE Trans. Comput. C-35(1):1986;1-12.
12. Morales D., Almeida F., Roda J., Rodríguez C. From the theory to the tools: parallel dynamic programming. Concurrency: Prac. Experience. 2000;21-34.
13. D. Morales, J. Roda, F. Almeida, C. Rodríguez, F. García, Integral Knapsack problems: parallel algorithms and their implementations on distributed systems, in: Proceedings of the 1995 International Conference on Supercomputing, ACM Press, 1995, pp. 218-226.
14. Press W.et al. Numerical Recipes in C: The Art of Scientific Computing. 1993;Cambridge University Press.
15. J. Ramanujam, Sadayappan, Tiling multidimensional iterations spaces for non shared-memory machines, Supercomputing'91, 1991, pp. 111-120.
16. C. Rodriguez, J. Roda, F. Garcia, F. Almeida, D. Gonzalez, Paradigms for parallel dynamic programming, in: Proceedings of the 22nd Euromicro Conference, Beyond 2000: Hardware and Software Strategies, IEEE, 1996, pp. 553-563.