The master-slave paradigm on heterogeneous systems: A dynamic programming approach for the optimal mapping

Proceedings - Euromicro Conference on Parellel, Distribeted and Network-based Proceeding

Volumn , Issue , 2004, Pages 266-272

  Almeida, Francisco ^a   González, Daniel ^a   Moreno, Luz Marina ^a  

^a UNIVERSIDAD DE LA LAGUNA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

HETEROGENEOUS SYSTEMS; OPTIMAL MAPPING; OPTIMIZATION PROBLEMS;

ALGORITHMS; COMPUTATIONAL METHODS; COMPUTER ARCHITECTURE; DYNAMIC PROGRAMMING; MAPPING; MATHEMATICAL MODELS; PROBLEM SOLVING;

COMPUTER SCIENCE;

EID: 3042530925     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/EMPDP.2004.1271454     Document Type: Conference Paper

References (15)

1. S. Browne, J. Dongarra, N. Garner, G. Ho, and P. Mucci, "A Portable Programming Interface for Performance Evaluation on Modern Processors.," The International Journal of High Performance Computing Applications, pp. 189-204, 2000.
2. J.A. González, C. Rodríguez, J.M. Rodriguez, and F. de Sande, "A Tool for Performance Modeling of Parallel Programs.," Scientific Computing, p. To appear, 2002.
3. O. Beaumont, A. Legrand, and Y. Robert, "The Master-Slave Paradigm with Heterogeneous Processors," Rapport de recherche de l'INRIA- Rhone-Alpes, vol. RR-4156, pp. 21 pages, April 2001.
4. M. Banikazemi, J. Sampathkumar, S. Prabhu, D. K. Panda, and P. Sadayappan, "Communication modeling of heterogeneous networks of workstations for performance characterization of collective operations," in International Workshop on Heterogeneous Computing (HCW99), in conjunction with IPPS'99, April 1999, pp. 159-165.
5. M. Goldsmith G. Jones, "Programming in occam 2.," Prentice Hall, 1988.
6. P.B. Hansen, "Studies in Computational Science.," Prentice Hall, 1995.
7. J. Roda, C. Rodriguez, F. Almeida, and D. Morales, "Prediction of Parallel Algorithms Performance On Bus Based Networks Using PVM.," in Sixth Euromicro Workshop on Parallel and Distributed Processing., April 1998, pp. 57-63.
8. D. Turgay and Y. Paker, "Optimal Scheduling Algorithms for Communication Constrained Parallel Processing.," in Europar2002, LNCS 2400. Springer-Verlag., August 2002, pp. 197-211.
9. M. Cierniak, M. Zaki, and W. Li, "Compile-Time Scheduling Algorithms for Heterogeneous Nework of Workstations.," The Computer Journal, vol. 40(60), pp. 236-239, 1997.
10. M. Drozdowski and P. Wolnievicz, "Experiments with Scheduling Divisible Tasks in Clusters of Workstations.," in Europar2000, LNCS 1900. Springer-Verlag., September 2000, pp. 311-319.
11. J. Schopf, "Structural Prediction Models for High-Performace Distributed Applications.," in Cluster Computing Conference., 1 1997.
12. F. Almeida, D. Gonzalez, L. Moreno, C. Rodriguez, and J. Toledo, "On the Prediction of Master-Slave Algorithms over Heterogeneous Clusters," in Eleventh Euromicro Conference on Parallel, Distributed and Network-Based Processing., February 2003, pp. 433-437.
13. T. Ibaraki and N. Katoh, Resource Allocation Problems. Algorithmic Approaches, The MIT Press, 1988.
14. T. Ibaraki, "Enumerative approaches to combinatorial optimization, part ii," Annals of the Operational Research, vol. 11, 1988.
15. D. Gonzalez, F. Almeida, J. Roda, and C. Rodriguez, "From the theory to the tools: Parallel dynamic programming," Concurrency: Practice and Experience, pp. 21-34, 2000.