Parallel application scheduling on networks of workstations

dc.contributor.authorAnastasiadis, S. V.en
dc.contributor.authorSevcik, K. C.en
dc.date.accessioned2015-11-24T17:02:52Z
dc.date.available2015-11-24T17:02:52Z
dc.identifier.issn0743-7315-
dc.identifier.urihttps://olympias.lib.uoi.gr/jspui/handle/123456789/11104
dc.rightsDefault Licence-
dc.subjectmultiprocessor systemsen
dc.subjectprocessor allocationen
dc.titleParallel application scheduling on networks of workstationsen
heal.abstractParallel applications can be executed using the idle computing capacity of workstation clusters. However, it remains unclear how to schedule the processors among different applications most effectively, Processor scheduling algorithms that were successful for shared-memory machines have proven to be inadequate for distributed memory environments due to the high costs of remote memory accesses and redistributing data. We investigate how knowledge of system load and application characteristics can be used in scheduling decisions. We propose a new algorithm based on adaptive equipartitioning, which, by properly exploiting both the information types above, performs better than other nonpreemptive scheduling rules, and nearly as well as idealized versions of preemptive rules (with free preemption). We conclude that the new algorithm is suitable for use in scheduling parallel applications on networks of workstations. (C) 1997 Academic Press.en
heal.accesscampus-
heal.fullTextAvailabilityTRUE-
heal.journalNameJournal of Parallel and Distributed Computingen
heal.journalTypepeer reviewed-
heal.languageen-
heal.publicationDate1997-
heal.recordProviderΠανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικήςel
heal.typejournalArticle-
heal.type.elΆρθρο Περιοδικούel
heal.type.enJournal articleen

Αρχεία

Φάκελος/Πακέτο αδειών

Προβολή: 1 - 1 of 1
Φόρτωση...
Μικρογραφία εικόνας
Ονομα:
license.txt
Μέγεθος:
1.74 KB
Μορφότυπο:
Item-specific license agreed upon to submission
Περιγραφή: