Identificador persistente para citar o vincular este elemento: http://hdl.handle.net/10553/73913
Título: Allocation of precedence-constrained tasks to parallel processors for optimal execution
Autores/as: Das, Rina
Fay, D. Q. M.
Das, Pradip K.
Clasificación UNESCO: 3325 Tecnología de las telecomunicaciones
Fecha de publicación: 1992
Publicación seriada: Microprocessing and Microprogramming 
Conferencia: 18 th Euromicro Symposium on Microprocessing and Microprogramming 
Resumen: The present work describes two methods for allocating m precedence-constrained tasks to n identical processors for optimal execution, uniform static load balancing and minimum interprocessor communication. The comparative studies made between two methods, the Simulated Annealing and a well-chosen Heuristic, indicate the suitability of the latter for complex precedence graphs. Examples from Matrix algebra have been chosen for the experiments. The resulting methods can be readily applied to optimize performance of practical problems on distributed memory parallel processor systems such as transputer-based systems.
URI: http://hdl.handle.net/10553/73913
ISSN: 0165-6074
DOI: 10.1016/0165-6074(92)90322-X
Fuente: Microprocessing and Microprogramming [ISSN 0165-6074], v. 35 (1-5), p. 237-244, (Septiembre 1992)
Colección:Actas de congresos
Vista completa

Google ScholarTM

Verifica

Altmetric


Comparte



Exporta metadatos



Los elementos en ULPGC accedaCRIS están protegidos por derechos de autor con todos los derechos reservados, a menos que se indique lo contrario.