Our research is focused on keeping both local and parallel jobs together in a non-dedicated cluster or NOW (Network of Workstations) and efficiently scheduling them by means of coscheduling mechanisms. The performance of a good coscheduling policy can decrease drastically if memory requirements are not kept in mind. The overflow of the physical memory into the virtual memory usually provokes a severe performance penalty. A real implementation of a coscheduling technique for reducing the number of page faults across a non-dedicated Linux cluster is presented in this article. Our technique is based on knowledge of events obtained during execution, such as communication activity, page faults and memory size of every task. Its performance is analyzed and compared with other coscheduling algorithms. © Springer-Verlag Berlin Heidelberg 2003.
|Journal||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Publication status||Published - 1 Dec 2003|
- Cluster and Grid Computing
- Distributed Computing