Greedy-available non-contiguous processor allocation strategy and job scheduling for 2D mesh connected multicomputers

Bani-Mohammad, S., Ould-Khaoua, M. and Abaneh, I. (2008) Greedy-available non-contiguous processor allocation strategy and job scheduling for 2D mesh connected multicomputers. International Journal of Computers and their Applications, 15(4), pp. 283-296.

Full text not currently available from Enlighten.

Abstract

No abstract available.

Item Type:Articles
Status:Published
Refereed:Yes
Glasgow Author(s) Enlighten ID:Ould-Khaoua, Dr Mohamed
Authors: Bani-Mohammad, S., Ould-Khaoua, M., and Abaneh, I.
Subjects:Q Science > QA Mathematics > QA75 Electronic computers. Computer science
College/School:College of Science and Engineering > School of Computing Science
Journal Name:International Journal of Computers and their Applications
ISSN:1076-5204

University Staff: Request a correction | Enlighten Editors: Update this record