Adjusting the Lengths of Time Slices when Scheduling PVM Jobs with High Memory Requirements
MetadataShow full item record
Our research is focussed on keeping both local and parallel jobs together in a non-dedicated cluster and scheduling them efficiently. In such systems, the overflow of the physical memory into the virtual memory usually causes a severe performance penalty for distributed jobs. This impact can be
reduced by means of giving more time slice length to parallel tasks in order better to exploit their memory reference locality. Thus, an algorithm is presented to adjust the length of the time slice dynamically to the necessity of the distributed and local tasks. It is implemented in a Linux cluster and evaluated with PVM jobs.
Is part ofLecture Notes in Computer Science, 2002, vol. 2474, p. 156-164
Showing items related by title, author, creator and subject.
Hanzich, Mauricio; Giné, Francesc; Hernández Budé, Porfidio; Solsona Tehàs, Francesc; Luque, Emilio (Springer Verlag, 2005)Wasted resources are a common reality in open laboratories in any University today . Our aim is to take advantage of those resources to do parallel computation without disturbing the local tasks excessively. In order ...
Hanzich, Mauricio; Giné, Francesc; Hernández Budé, Porfidio; Solsona Tehàs, Francesc; Luque, Emilio (Springer Verlag, 2005)Our main interest is oriented towards keeping both local and parallel jobs together in a non-dedicated cluster. In order to obtain some profits from the parallel applications, it is important to consider time and space ...
Giné, Francesc; Solsona Tehàs, Francesc; Hanzich, Mauricio; Hernández Budé, Porfidio; Luque, Emilio (Springer Verlag, 2007)Implicit coscheduling techniques applied to non-dedicated homogeneous Networks Of Workstations (NOWs) have shown they can perform well when many local users compete with a single parallel job. Implicit coscheduling deals ...