Our research is focused on keeping both local and parallel jobs together in a non-dedicated cluster and scheduling them efficiently. In such a system, memory becomes a critical resource for both kinds of job. Thus, the minimization of the impact caused by the overflow of physical into virtual memory on the performance of distributed jobs together with the development of an efficient memory management adapted to the needs of NOWs (Networks of Workstations) are major issues in this kind of environment. An algorithm is presented to adjust time slices dynamically to the necessities of distributed and local tasks in order to reduce the number of page faults across the cluster. Additionally, a memory management policy aimed at preserving enough memory for both workloads is evaluated. Our proposals are implemented in a Linux cluster and compared with alternative algorithms.
|Journal||International Journal of High Performance Computing Applications|
|Publication status||Published - 1 Mar 2003|
- Cluster computing
- Memory constraints