Please use this identifier to cite or link to this item: http://hdl.handle.net/10553/73913
Title: Allocation of precedence-constrained tasks to parallel processors for optimal execution
Authors: Das, Rina
Fay, D. Q. M.
Das, Pradip K.
UNESCO Clasification: 3325 Tecnología de las telecomunicaciones
Issue Date: 1992
Journal: Microprocessing and Microprogramming 
Conference: 18 th Euromicro Symposium on Microprocessing and Microprogramming 
Abstract: 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
Source: Microprocessing and Microprogramming [ISSN 0165-6074], v. 35 (1-5), p. 237-244, (Septiembre 1992)
Appears in Collections:Actas de congresos
Show full item record

SCOPUSTM   
Citations

2
checked on Oct 2, 2022

WEB OF SCIENCETM
Citations

1
checked on Oct 2, 2022

Page view(s)

78
checked on May 28, 2022

Google ScholarTM

Check

Altmetric


Share



Export metadata



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