Scalable and adaptive resource sharing in PVM

  • Michael Kemelmakher
  • Orly Kremien
Conference paper

DOI: 10.1007/BFb0056576

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1497)
Cite this paper as:
Kemelmakher M., Kremien O. (1998) Scalable and adaptive resource sharing in PVM. In: Alexandrov V., Dongarra J. (eds) Recent Advances in Parallel Virtual Machine and Message Passing Interface. EuroPVM/MPI 1998. Lecture Notes in Computer Science, vol 1497. Springer, Berlin, Heidelberg

Abstract

PVM uses round-robin as its default policy for process allocation to processors. The main drawbacks of this policy are the fact that PVM ignores load variations among different nodes and also the inability of PVM to distinguish between machines of different speeds. To redress this deficiency a Resource Manager (RM) is implemented which replaces round-robin with a scalable and adaptive algorithm for resource sharing [11] providing a High Performance Computing Cluster (HPCC). In this paper an implementation of a Resource Manager is proposed. The RM can be transparently plugged into PVM to offer improved performance to its users. The design of a resource manager to extend PVM is described. A prototype implementation in PVM is then measured to illustrate the utility of the approach. Finally, performance results favorably comparing the enhanced version to the original PVM are presented ...

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1998

Authors and Affiliations

  • Michael Kemelmakher
    • 1
  • Orly Kremien
    • 1
  1. 1.Department of Mathematics and Computer ScienceBar Ilan UniversityRamat GanIsrael

Personalised recommendations