Coscheduling under Memory Constraints in a NOW

Thumbnail
View/Open
Issue date
2001
Author
Giné, Francesc
Solsona Tehàs, Francesc
Hernández Budé, Porfidio
Luque, Emilio
Suggested citation
Giné, Francesc; Solsona Tehàs, Francesc; Hernández Budé, Porfidio; Luque, Emilio; . (2001) . Coscheduling under Memory Constraints in a NOW. Lecture Notes in Computer Science, 2000, vol. 2221, p. 41-65. https://doi.org/10.1007/3-540-45540-X_4.
Impact

Google Scholar logo  Google Scholar
Share
Export to Mendeley
Metadata
Show full item record
Abstract
Networks of Workstations (NOW) have become important and cost-effective parallel platforms for scientific computations. In practice, a NOW system is heterogeneous and non-dedicated. These two unique factors make scheduling policies on multiprocessor/multicomputer systems unsuitable for NOWs. However,
the coscheduling principle is still an important basis for parallel process scheduling in these environments. We propose a new coscheduling algorithm for reducing the number of page faults across a non-dedicated cluster by increasing the execution priority of parallel tasks with lower page fault rate. Our method is based on knowledge of events obtained during execution, as communication activity and memory size of every task. The performance of our proposal has been analyzed and compared with other coscheduling implementations by means of simulation.
URI
http://hdl.handle.net/10459.1/57273
DOI
https://doi.org/10.1007/3-540-45540-X_4
Is part of
Lecture Notes in Computer Science, 2000, vol. 2221, p. 41-65
Collections