Advertisement

PLATINUM: A Placement Tool Based on Process Initiative

  • Christophe Lang
  • Michel Trehel
  • Pierre Baptiste
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1662)

Abstract

This paper presents a new load sharing method based on process initiative. The method can be applied either for individual pro- cesses in networks of workstations or for parallel computation. We know that the global computing power is most of the time much underutilized. Our goal is to share the load among the different processors. Usually, load sharing algorithms are based on the fact that information and de- cision of distribution are on the processor. We aim to give processes the abilityt o decide where they are going to run. This method is based on the independence and the initiative of entities. We have written behav- ior algorithms for independent processes. We have used them to realize a dynamic placement tool on a network of UNIX workstations : PLAT- INUM. The aim of this paper is to present our new method through PLATINUM.

Keywords

Load Balance Load Share Communication Rate Distribute Computing System Load Indicator 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Arnold. O Allen: Probability, statistics and queuing theory with computer science applications. Academic Press. 1990.Google Scholar
  2. 2.
    Rajeev Motwani and Prabhakar Raghavan: Randomized Algorithms. Cambridge UniversityPress. 1995.Google Scholar
  3. 3.
    Andrea C. Arpaci-Dusseau and David E. Culler and Alan Mainwaring: Scheduling with Implicit Information in Distributed Systems. 1998 SIGMETRICS Conference on the Measurement and Modeling of Computer Systems, 233–243. June 24-26, 1998. Madison, Wisconsin.Google Scholar
  4. 4.
    D. J. Farber: The Distributed Computing System. Compcon Spring 73, pages 31–34. 1973.Google Scholar
  5. 5.
    Bertil Folliot: Méthodes et Outils de Partage de Charge pour la Conception et la Mise en Oeuvre d’Applications dans les Systémes Répartis Hétérogénes. Institute Blaise Pascal, MASI. 1993.Google Scholar
  6. 6.
    D. Ferrari and S. Zhou: An Empirical Investigation of Load Indices for Load Balancing Applications. Performances 87, 515–528. Bruxelles, Belgique.Google Scholar
  7. 7.
    Mor Harchol-Balter and Allen B. Downey: Exploiting Process Lifetime Distributions for Dynamic Load Balancing. ICSI. University of California at Berkeley, 1995.Google Scholar
  8. 8.
    M. J. Litzkow and M. Livny and M. W. Mutka: Condor: A Hunter of Idle Workstations. 8th International Conference on Distributed Computing Systems. IEEE Computer Society Press, 104–111. Washington, D. C., USA, 1988. 504Google Scholar
  9. 9.
    James S. Plank and Micah Beck and Gerry Kingsley: Libckpt: Transparent Checkpointing under UNIX. USENIX Winter 1995 Technical Conference. New Orleans Louisiana, 1995.Google Scholar
  10. 10.
    Jonathan M. Smith: A Surveyof Process Migration Mechanisms. Operating Systems Review, 22(3), pages 28–40. 1988.CrossRefGoogle Scholar
  11. 11.
    M. Theimer and K. A. Lantz: Finding Idle Machines in a Workstation-based Distributed System. IEEE Transactions on Software Engineering, 15(11) pages 1444–1458. 1989.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Christophe Lang
    • 1
    • 2
  • Michel Trehel
    • 1
  • Pierre Baptiste
    • 2
  1. 1.Laboratoire d’Informatique de BesançonUniversité de Franche-ComtéBesançon CedexFrance
  2. 2.Laboratoire d’Automatique de Besançon, UMR CNRS 6596, Université de Franche-ComtéEcole Nationale Supérieure de Mécanique et des MicrotechniquesBesançonFrance

Personalised recommendations