Affiliation:
1. University of California at Berkeley
Abstract
We measure the distribution of lifetimes for UNIX processes and propose a functional form that fits this distribution well. We use this functional form to derive a policy for preemptive migration, and then use a trace-driven simulator to compare our proposed policy with other preemptive migration policies, and with a non-preemptive load balancing strategy. We find that, contrary to previous reports, the performance benefits of preemptive migration are significantly greater than those of non-preemptive migration, even when the memory-transfer cost is high. Using a model of migration costs representative of current systems, we find that preemptive migration reduces the mean delay (queueing and migration) by 35 - 50%, compared to non-preemptive migration.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Networks and Communications,Hardware and Architecture,Software
Reference39 articles.
1. Location Independent Remote Execution in NEST
2. Designing a process migration facility: the Charlotte experience
3. Raymond M. Bryant and Raphael A. Finkel. A stable distributed scheduling algorithm. In 2rid International Conference on Distributed Computing Systems pages 314-323 1981. Raymond M. Bryant and Raphael A. Finkel. A stable distributed scheduling algorithm. In 2rid International Conference on Distributed Computing Systems pages 314-323 1981.
4. Adaptive optimal load balancing in a nonhomogeneous multiserver system with a central job scheduler
5. Avner Braverman 1995. Personal Communication. Avner Braverman 1995. Personal Communication.
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Load Balancing with Job-Size Testing: Performance Improvement or Degradation?;ACM Transactions on Modeling and Performance Evaluation of Computing Systems;2024-04-17
2. Balanced Nonadaptive Redundancy Scheduling;IEEE Journal on Selected Areas in Information Theory;2022-06
3. Open problems in queueing theory inspired by datacenter computing;Queueing Systems;2021-01-27
4. Borg;Proceedings of the Fifteenth European Conference on Computer Systems;2020-04-15
5. Scheduling parallel identical machines to minimize makespan:A parallel approximation algorithm;Journal of Parallel and Distributed Computing;2019-11