Please use this identifier to cite or link to this item:
https://olympias.lib.uoi.gr/jspui/handle/123456789/11104Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Anastasiadis, S. V. | en |
| dc.contributor.author | Sevcik, K. C. | en |
| dc.date.accessioned | 2015-11-24T17:02:52Z | - |
| dc.date.available | 2015-11-24T17:02:52Z | - |
| dc.identifier.issn | 0743-7315 | - |
| dc.identifier.uri | https://olympias.lib.uoi.gr/jspui/handle/123456789/11104 | - |
| dc.rights | Default Licence | - |
| dc.subject | multiprocessor systems | en |
| dc.subject | processor allocation | en |
| dc.title | Parallel application scheduling on networks of workstations | en |
| heal.type | journalArticle | - |
| heal.type.en | Journal article | en |
| heal.type.el | Άρθρο Περιοδικού | el |
| heal.language | en | - |
| heal.access | campus | - |
| heal.recordProvider | Πανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικής | el |
| heal.publicationDate | 1997 | - |
| heal.abstract | Parallel 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.journalName | Journal of Parallel and Distributed Computing | en |
| heal.journalType | peer reviewed | - |
| heal.fullTextAvailability | TRUE | - |
| Appears in Collections: | Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά) | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Anastasiadis-1997-Parallel application scheduling on networks of workstation clusters and network based computing.pdf | 538.23 kB | Adobe PDF | View/Open Request a copy |
This item is licensed under a Creative Commons License
