Abstract
This paper describes DynamicPVM, an extension to PVM (Parallel Virtual Machine) [1]. PVM enables users to write parallel applications using message passing primitives and statically places the parallel tasks on a collection of nodes. System schedulers schedule atomic jobs over a predefined number of nodes. DynamicPVM addresses the problem of scheduling parallel tasks over a set of nodes. It therefore has to integrate a process checkpointing, migration and restart restart mechanism with the PVM runtime support system. DynamicPVM facilitates an efficient use of existing computational resources for computational jobs consisting of parallel subtasks. Typical target HPC platforms for DynamicPVM are multi user, multi tasking, loosely coupled processors.
Cite
CITATION STYLE
Dikken, L., van der Linden, F., Vesseur, J., & Sloot, P. (1994). DynamicPVM: Dynamic load balancing on parallel systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 797 LNCS, pp. 273–277). Springer Verlag. https://doi.org/10.1007/3-540-57981-8_130
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
