Static vs. Dynamic List-Scheduling Performance Comparison
The problem of efficient task scheduling is one of the most important and most difficult issues in homogeneous computing environments. Finding an optimal solution for a scheduling problem is NP-complete. Therefore, it is necessary to have heuristics to find a reasonably good schedule rather than eva...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
CTU Central Library
2003-01-01
|
Series: | Acta Polytechnica |
Subjects: | |
Online Access: | https://ojs.cvut.cz/ojs/index.php/ap/article/view/490 |