Normal view MARC view ISBD view

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

By:

De Giusti, Laura Cristina

Contributor(s):

Material type: Article

ArticleDescription: 1 archivo (448 KB)Subject(s):

Online resources:

Click here to access online

Summary: 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 multi- cluster. 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.

Average rating: 0.0 (0 votes)

Holdings ( 1 )
Title notes ( 3 )

Holdings
Item type	Home library	Collection	Call number	URL	Status	Date due	Barcode
Capítulo de libro	Biblioteca de la Facultad de Informática	Biblioteca digital	A0416 (Browse shelf(Opens below))	Link to resource	No corresponde

Browsing Biblioteca de la Facultad de Informática shelves, Collection: Biblioteca digital Close shelf browser (Hides shelf browser)

Previous								Next
Previous	A0413 A virtual learning environment development : some experiences at the University of La Plata	A0414 Book Review : Distributed Computing: principles and applications, M. L. Liu	A0415 Framework for web application agile development	A0416 A model for the automatic mapping of tasks to processors in heterogeneous multi-cluster architectures	A0417 A lightweight method for computing ball spin in real time	A0418 Knowledge discovery for knowledge based systems : some experimental results	A0419 Robustness analysis for the method of assignment MATEHa	Next

Formato de archivo: PDF. -- Este documento es producción intelectual de la Facultad de Informática - UNLP (Colección BIPA/Biblioteca)

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 multi- cluster. 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.

Journal of Computer Science & Technology, 7(1), pp. 39-44