Hessah alsaaran 1 dras motivation problem statement

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: epeat steps b and c (without changing the amount of requested load). 43 44 Comments/Critique Ê༌  If an algorithm is balancing the load through “equalization”, it covers the case of not wanting idle nodes. Ê༌  The requested load only covers the next time interval, then it will need to request another load Ê༌  Repeating process migration process continually (including message passing). Ê༌  Trade- off between time interval size and the incurred overhead. Ê༌  The node should not only have “enough” load, it should have Comparisons & Discussion a mixture of tasks (e.g. CPU- bound and I/O bound) to effectively utilize the resources. 45 46 Comparisons & Discussion (1) Comparisons & Discussion (2) Ê༌  Balancing Goal: Ê༌  Full vs. Partial Process Migration Ê༌  MOSIX, Sprite, Mach à༎ partial migration Ê༌  RoC- LB, LSF à༎ full migration Ê༌  MOSIX, Mach, LSF à༎ full load balancing Ê༌  RoC- LB, and Sprite à༎ utilizing idle nodes. Ê༌  In partial migration: (Dependency between the source and destination nodes.) Ê༌  Increased transparency. Ê༌  Management and network overhead. (Inefficiency) Ê༌  Compromises fault- tolerance of the system. (Inefficiency) Ê༌  In full migration: Ê༌  Node compatibility becomes an issue. Ê༌  More information needs to be disseminated. (Inefficiency) Ê༌  Longer migration time, but less run- time overhead. 47 48 8 10/9/13 Comparisons & Discussion (3) Inefficiency à༎ Load Representation Ê༌  Distributed vs. Centralized load balancing algorithm: Ê༌  A node’s load is estimated based on the number of load units. Ê༌  MOSIX, Mach, RoC- LB à༎ Distributed. Ê༌  Examples:...
View Full Document

{[ snackBarMessage ]}

Ask a homework question - tutors are online