Change search
ReferencesLink to record
Permanent link

Direct link
Optimal Scheduling Results for Parallel Computing
Responsible organisation
1994 (English)In: SIAM news, ISSN 1557-9573, Vol. 27, no 7Article in journal (Refereed) Published
Abstract [en]

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
National Category
Computer Science
URN: urn:nbn:se:bth-9479Local ID: diva2:837339
To be printed in Applications on Advanced ArchitecturesAvailable from: 2012-09-18 Created: 2000-03-15 Last updated: 2015-06-30Bibliographically approved

Open Access in DiVA

fulltext(156 kB)17 downloads
File information
File name FULLTEXT01.pdfFile size 156 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Lennerstad, HåkanLundberg, Lars
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 17 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 32 hits
ReferencesLink to record
Permanent link

Direct link