A model for the automatic mapping of tasks to processors in heterogeneous multi-cluster architectures

• Autores: Laura Cristina De Giusti, Franco Chichizola, Marcelo Naiouf , Ana Ripoll Aracil , Armando De Giusti
• Localización: Journal of Computer Science and Technology, ISSN-e 1666-6038, Vol. 7, Nº. 1, 2007 (Ejemplar dedicado a: Nineteenth Issue), págs. 39-44
• Idioma: inglés
• Enlaces
  • Texto completo
• Resumen

  • This paper discusses automatic mapping methods for concurrent tasks to processors applying graph analysis for the relation among tasks, in which processing and communicating times are incorporated. Starting by an analysis in which processors are homogeneous and data transmission times do not depend on the processors that are communicating (a typical case in homogeneous clusters), we progress to extend the model to heterogeneous processors having the possibility of different communication levels, applicable to a multicluster. Some results obtained with the model and future work lines are presented, particularly, the possibility of obtaining the required optimal number of processors, keeping a constant efficiency level.

• Referencias bibliográficas
  • References [1] Grama A., Gupta A., Karypis G., Kumar V., "An Introduction to Parallel Computing. Design and Analysis of Algorithms",...
  • [2] Leopold C., "Parallel and Distributed Computing. A survey of Models, Paradigms, and Approaches", Wiley Series on Parallel and...
  • [3] A.V. Aho, J.E. Hopcroft, and J.D. Ullman.The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Massachusetts, 1974
  • [4] S. Akl, “Parallel Computation. Models and Methods”, Prentice-Hall, Inc., 1997.
  • [5] M. J. Flynn, Computer Architecture: Pipelined and Parallel Processor Design. Jones and Bartlett, 1995
  • [6] Baker M., R. Buyya. "Cluster Computing at a Glance". R. Buyya Ed., High Performance Cluster Computing: Architectures and Systems,...
  • [7] Zoltan Juhasz (Editor), Peter Kacsuk (Editor), Dieter Kranzlmuller (Editor), Distributed and Parallel Systems : Cluster and Grid Computing...
  • [8] D. Culler, R. Karp, D. Patterson, A. Sahay, K. E. Schauser, E. Santos, R. Suramonian and T. von Eicken, “LogP: Towards a Realistic Model...
  • [9]C. Roig, “Algoritmos de asignación basados en un nuevo modelo de representación de programas paralelos”, Tesis Doctoral, Universidad Autónoma...
  • [10] Valiant L.G.. A Bridging Model for Parallel Computation. Communications of the ACM, 33(8): 103-111, August 1990.
  • [11] A. Kalinov, S. Klimov. Optimal Mapping of a Parallel Application Processes onto Heterogeneous Platform. Proceedings of the 19th IEEE...
  • [12] J. Cuenca, D. Gimenez, and J. Martinez, “Heuristics for Work Distribution of a Homogeneous Parallel Dynamic Programming Scheme on Heterogeneous...
  • [13] Y. Kishimoto and S. Ichikawa, “An Execution-Time Estimation Model for Heterogeneous Clusters”, Proceedings of the 18th International...
  • [14] M. Garey and D. Johnson. Computers and Intractability. W.H. Freeman and Co. S. Francisco, 1979.