Using ant colonies for solve the multiprocessor task graph scheduling
The problem of scheduling a parallel program presented by a weighted directed acyclic graph (DAG) to the set of homogeneous processors for minimizing the completion time of the program has been extensively studied as academic optimization problem which occurs in optimizing the execution time of para...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | English |
| Published: |
Högskolan Dalarna, Datateknik
2006
|
| Subjects: | |
| Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:se:du-2381 |