SCALABLE LOW COMPLEXITY TASK SCHEDULING ALGORITHM FOR CLUSTER OF WORKSTATIONS
Static scheduling is the temporal and spatial mapping of a program to the resources of parallel system. Scheduling algorithms use the Directed Cyclic Graph (DAG) to represent sub-tasks and the precedence constraints of the program to be parallelized. It has been shown to be NP-Complete in general as...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor's University
2010-09-01
|
| Series: | Journal of Engineering Science and Technology |
| Subjects: | |
| Online Access: | http://jestec.taylors.edu.my/Vol%205%20Issue%203%20September%2010/Vol_5_3_332_341_SPadmavathi.pdf |