Dynamic Multiprocessor Scheduling Model For The Reconfigurable Mesh Computing Networks
Task scheduling is a combinatorial optimisation problem that is known to have large interacting degrees of freedom and is generally classified as NP-complete. Most solutions to the problem have been proposed in the form of heuristics. These include approaches using list scheduling, queueing theory,...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Penerbit UTM Press
2002
|
| Subjects: | |
| Online Access: | http://eprints.utm.my/1428/1/JT37C5.pdf |