dc.contributor.author
Giné, Francesc
dc.contributor.author
Solsona Tehàs, Francesc
dc.contributor.author
Hernandez, Porfidio
dc.contributor.author
Luque, Emilio
dc.date.accessioned
2024-12-05T21:58:08Z
dc.date.available
2024-12-05T21:58:08Z
dc.date.issued
2016-07-08T08:41:31Z
dc.date.issued
2025-01-01
dc.identifier
https://doi.org/10.1007/3-540-45825-5_30
dc.identifier
http://hdl.handle.net/10459.1/57397
dc.identifier.uri
http://hdl.handle.net/10459.1/57397
dc.description.abstract
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.
dc.description.abstract
This work was supported by the MCyT under contract TIC 2001-2592 and partially supported by the Generalitat de Catalunya -Grup de Recerca Consolidat 2001SGR- 00218.
dc.publisher
Springer Verlag
dc.relation
MICYT/PN2000-2003/TIC2001-2592
dc.relation
Reproducció del document publicat a https://doi.org/10.1007/3-540-45825-5_30
dc.relation
Lecture Notes in Computer Science, 2002, vol. 2474, p. 156-164
dc.rights
(c) Springer Verlag, 2002
dc.rights
info:eu-repo/semantics/restrictedAccess
dc.title
Adjusting the Lengths of Time Slices when Scheduling PVM Jobs with High Memory Requirements
