An On-line Algorithm for Fair-Share Node Allocations in a Cluster

@article{Amar2007AnOA,
  title={An On-line Algorithm for Fair-Share Node Allocations in a Cluster},
  author={Lior Amar and Amnon Barak and Ely Levy and Michael Okun},
  journal={Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07)},
  year={2007},
  pages={83-91}
}
Proportional (fair) share schedulers are designed to provide applications with predefined portions of system resources. Single node operating systems use context-switch (preemption) to dynamically allocate the CPU(s) to running processes. This paper presents an online algorithm for proportional share allocations of nodes in a cluster, in a fashion that resembles a single-node system. The algorithm relies on preemptive process migrations for dynamic allocations of nodes to users. The paper… CONTINUE READING
Highly Cited
This paper has 27 citations. REVIEW CITATIONS
15 Citations
10 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 15 extracted citations

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…