Universitat de Lleida
Our research is focussed on keeping both local and parallel jobs together in a time-sharing NOW and efficiently scheduling them by means of coscheduling mechanisms. In such systems, the proper length of the time slice still remains an open question. In this paper, an algorithm is presented to adjust the length of the quantum dynamically to the necessity of the distributed tasks while keeping good response time for interactive processes. It is implemented and evaluated in a Linux cluster.
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.
Anglès
Springer Verlag
MICYT/PN2000-2003/TIC2001-2592
Reproducció del document publicat a https://doi.org/10.1007/3-540-45706-2_30
Lecture Notes in Computer Science, 2002, vol. 2400, p. 234-239
(c) Springer Verlag, 2002
Documents de recerca [17848]
