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,...

Full description

Saved in:
Bibliographic Details
Main Authors: Salleh, Shaharuddin, Aziz, Nur Arina Bazilah, Azmee, Nor Afzalina, Mohamed, Nurul Huda
Format: Article
Language:English
Published: Penerbit UTM Press 2002
Subjects:
Online Access:http://eprints.utm.my/id/eprint/1428/1/JT37C5.pdf
http://eprints.utm.my/id/eprint/1428/
http://www.penerbit.utm.my/onlinejournal/37/C/JT37C5.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!