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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Arnold. O Allen: Probability, statistics and queuing theory with computer science applications. Academic Press. 1990.
Rajeev Motwani and Prabhakar Raghavan: Randomized Algorithms. Cambridge UniversityPress. 1995.
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.
D. J. Farber: The Distributed Computing System. Compcon Spring 73, pages 31–34. 1973.
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.
D. Ferrari and S. Zhou: An Empirical Investigation of Load Indices for Load Balancing Applications. Performances 87, 515–528. Bruxelles, Belgique.
Mor Harchol-Balter and Allen B. Downey: Exploiting Process Lifetime Distributions for Dynamic Load Balancing. ICSI. University of California at Berkeley, 1995.
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. 504
James S. Plank and Micah Beck and Gerry Kingsley: Libckpt: Transparent Checkpointing under UNIX. USENIX Winter 1995 Technical Conference. New Orleans Louisiana, 1995.
Jonathan M. Smith: A Surveyof Process Migration Mechanisms. Operating Systems Review, 22(3), pages 28–40. 1988.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lang, C., Trehel, M., Baptiste, P. (1999). PLATINUM: A Placement Tool Based on Process Initiative. In: Malyshkin, V. (eds) Parallel Computing Technologies. PaCT 1999. Lecture Notes in Computer Science, vol 1662. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48387-X_59
Download citation
DOI: https://doi.org/10.1007/3-540-48387-X_59
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66363-8
Online ISBN: 978-3-540-48387-8
eBook Packages: Springer Book Archive