This paper deals with the profitability, the design and the implementation of coordinated process scheduling under PVM. Firstly the principal coscheduling techniques proposed in the literature are reviewed, paying particular attention to those that can be effective in network of workstations. Then the problems linked to the design of a coscheduling scheme for PVM are discussed, and a prototypal implementation is presented. The obtained results show that coscheduling support can reduce significantly the response time of PVM programs, without affecting in a meaningful way the performance of sequential workload.
CITATION STYLE
Gaito, A., Rak, M., & Villano, U. (2001). Adding dynamic Coscheduling support to PVM. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2131, pp. 106–113). Springer Verlag. https://doi.org/10.1007/3-540-45417-9_19
Mendeley helps you to discover research relevant for your work.