Automatic rebalancing downscaling and up scaling

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: d, the node informs the nodes holding replicas to delete these replicas. only the number of units as if they are equal: Ê༌  Load units will be weighted by their expected running time. Ê༌  However, this estimation can be an issue. Ê༌  May use history if it has been executed recently on the node. Ê༌  Keeping a configurable ratio of CPU- bound and I/O- bound processes. Ê༌  This information can be extracted from processes profiles. Ê༌  Instead of sending load info. to 2 random nodes, let the number of random nodes increase with the scale of the system. 51 52 If I would build a system, how would I do it? Ê༌  (3) Implement the system in the application- level as in LSF à༎ For portability and simplicity, although it may degrade its performance. Thank You 53 54 9 10/9/13 References 1.  Milojicic, D. S., Douglis, F., Paindaveine, Y., Wheeler, R., and Zhou, S. “Process Migration”, ACM Computing Surveys, Vol. 32, No. 3, September 2000, pp. 241–299. 2.  Campos, L. M., and Scherson, I. “Rate of Change Load Balancing in Distributed and Parallel Systems”, 10th Symposium on Parallel and Distributed Processing, 1999. 3.  Barak, A. “Overview of MOSIX”, presentation, 2013, Computer Science, Hebrew University. (http://www.mosix.org) 4.  Barak, A., and Shiloh, A. “The MOSIX Cluster Operating System for High- Performance Computing on Linux Clusters, Multi- Clusters and Clouds”, white paper, 2013. (http://www.mosix.org) 55 10 10/15/13 Presentation #2 CS 655 – Advanced Topics in Distributed S...
View Full Document

This note was uploaded on 02/11/2014 for the course CS 655 taught by Professor Shrideeppallickara during the Fall '13 term at Colorado State.

Ask a homework question - tutors are online