Por favor utiliza este link para citar o compartir este documento: http://repositoriodigital.academica.mx/jspui/handle/987654321/8902
Título: Schedulling Malleable Task with Convex Processing Speed Functions
Palabras clave: ;MALLEABLE TASK; CONVEX PROCESSING SPEED FUNCTION; GANG SCHEDULING
Fecha de publicación: 10-Sep-2011
Editorial: Computación y Sistemas
Descripción: IN THE PAPER, THE PROBLEM IS CONSIDERED OF SHEDULING VERY LARGE APPLICATIONS ON PARALLEL COMPUTER SYSTEMS. THESE APPLICATIONS CAN BE MODELED AS MALLEABLE TASK, IE, TASKS WHICH PROCESSING SPEED DEPENDS ON A NUMBER OF PROCESSORS GRANTED. USING THIS CONCEPT IT IS PROVED ANALYTICALLY THAT FOR CONVEZ CURVES RELATING PROCESSING SPEED TO NUMBER OF PROCESSORR, GANG SHEDULING STRAEGY IS OPTIMAL FROM THE VIEWPOINT OF SCHE DULE DURATION.
IN THE PAPER, THE PROBLEM IS CONSIDERED OF SHEDULING VERY LARGE APPLICATIONS ON PARALLEL COMPUTER SYSTEMS. THESE APPLICATIONS CAN BE MODELED AS MALLEABLE TASK, IE, TASKS WHICH PROCESSING SPEED DEPENDS ON A NUMBER OF PROCESSORS GRANTED. USING THIS CONCEPT IT IS PROVED ANALYTICALLY THAT FOR CONVEZ CURVES RELATING PROCESSING SPEED TO NUMBER OF PROCESSORR, GANG SHEDULING STRAEGY IS OPTIMAL FROM THE VIEWPOINT OF SCHE DULE DURATION.
Other Identifiers: http://revistas.unam.mx/index.php/cys/article/view/2517
Aparece en las Colecciones:Computación y Sistemas

Archivos de este documento:
No hay archivos asociados a este documento.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.