Optimal Scheduling Results for Parallel Computing
Blekinge Institute of Technology, Department of Computer Science and Business Administration1994 (English)In: SIAM news, ISSN 1557-9573, Vol. 27, no 7Article in journal (Refereed) Published
The situation of having jobs of some kind which may be dependent, and having several possible executors of jobs, is a very common one and appears in very diverse contexts. Clearly some kind of scheduling is needed: who shall do what? Also one often wants to have it all done as quicky as possible. One central scheduling question is whether to allow transferring of jobs between executors. The antipoles here are allowing unlimited transferring, usually called dynamic allocation of jobs, and allowing no transferring, which is static allocation.
Place, publisher, year, edition, pages
Philadelphia, Pa.: SIAM , 1994. Vol. 27, no 7
IdentifiersURN: urn:nbn:se:bth-9479Local ID: oai:bth.se:forskinfoD9FD95BF23E139FCC12568A3002CAB50OAI: oai:DiVA.org:bth-9479DiVA: diva2:837339
To be printed in Applications on Advanced Architectures2012-09-182000-03-152015-06-30Bibliographically approved