A survey of process migration mechanisms
ACM SIGOPS Operating Systems Review
Finding Idle Machines in a Workstation-Based Distributed System
IEEE Transactions on Software Engineering
Probability, statistics, and queueing theory with computer science applications
Probability, statistics, and queueing theory with computer science applications
Randomized algorithms
Scheduling with implicit information in distributed systems
SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
An Empirical Investigation of Load Indices for Load Balancing Applications
Performance '87 Proceedings of the 12th IFIP WG 7.3 International Symposium on Computer Performance Modelling, Measurement and Evaluation
Libckpt: transparent checkpointing under Unix
TCON'95 Proceedings of the USENIX 1995 Technical Conference Proceedings
| Hi-index | 0.00 |
This paper presents a new load sharing method based on process initiative. The method can be applied either for individual processes 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 decision 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 behavior algorithms for independent processes. We have used them to realize a dynamic placement tool on a network of UNIX workstations : PLATINUM. The aim of this paper is to present our new method through PLATINUM.