SlideServe
Télécharger Obtenir Pro
Menu
Accueil Pro
Préférences
ApparenceLight Aide et commentaires
© SlideServe · v2026

### Exploiting Process Lifetime Distributions for Dynamic Load Balancing: A Case Study ###

jaimie avatar
jaimie
15 diapositives · 294 Views · Aug 23, 2014

This case study details a collaborative research journey undertaken by two Ph.D. students at Berkeley, focusing on dynamic load balancing through process lifetime distributions. From critiquing the limitations of the ELZ88 model on active process migration to proposing refined algorithms based on empirical distributions, this work emphasizes the importance of a balanced system model. By analyzing data from local time-sharing servers and developing simulation tools, the researchers aim to enhance the understanding of load sharing mechanisms, ultimately driving better performance in system resource management. ###

### Exploiting Process Lifetime Distributions for Dynamic Load Balancing: A Case Study ### - slide 1
01 / 15### Exploiting Process Lifetime Distributions for Dynamic Load Balancing: A Case Study ###
1 / 17

Télécharger la présentation

### Exploiting Process Lifetime Distributions for Dynamic Load Balancing: A Case Study ###
Une image / un lien ci-dessous est fourni (tel quel) pour télécharger la présentation

Politique de téléchargement : le contenu du site vous est fourni TEL QUEL pour votre information et votre usage personnel ; il ne peut être vendu, concédé sous licence ni partagé sur d’autres sites sans l’accord de son auteur.Le contenu vous est fourni TEL QUEL, pour votre information et votre usage personnel uniquement. Téléchargez la présentation en cliquant sur ce lien. Lors du téléchargement, si vous ne parvenez pas à télécharger une présentation, l’éditeur a peut-être supprimé le fichier de son serveur.Pendant le téléchargement, si vous ne parvenez pas à obtenir une présentation, le fichier a peut-être été supprimé par l’éditeur.

F I N

Plus de contenu associé

Transcription de la présentation

  1. CS Research – A Case Study Exploiting Process Lifetime Distributions for Dynamic Load Balancing

  2. The Players • Two Ph.D. students at Berkeley • Mor Harchol-Balter • Functional Analysis, Formal, Mathematical • Berkeley 1990-1996 • First Paper 1994 • Allen B. Downey • Systems Research • MS MIT 1990, Berkeley 1991-1997 • First Paper 1993 • Not part of either players Ph.D. Thesis!

  3. How it started • ELZ88 • The limited performance benefits of migrating active processes for load sharing • “There are likely no conditions under which migration could yield major performance improvements beyond those offered by non-migratory load sharing…”

  4. First Steps • Find the hole in ELZ’s argument • Its based on an “unusual” distribution • Is this the observed distribution in 1994? • Collect and Analyze • Something smells….

  5. Interim Status • ELZ Model is limited • ELZ metric is mean residence time, not mean slowdown • ELZ process lifetime distribution is artificial • Lots of zero length processes

  6. Tech Report • Not enough data for an article • It’s a work-in-progress • A note on “The Limited Performance Benefits of Migrating Active Processes for Load Sharing” • Document their results, no conclusions except that ELZ88 looks wrong

  7. Next Steps • Collect data • Identify the empirical distributions • Define system model • Propose Algorithm • Simulate, Analyze • Repeat until done

  8. Collect Data • So many machines, what to choose… • Start with local resources • 7 local time-sharing servers • I.E. Mangal, Pita, Inferno, Sands • Use available tools • lastcomm – print out information about previously executed commands

  9. Identify Empirical Distributions • Graph data • Matlab, ploticus, gnuplot • Eyeball against known distributions • “Looks to me like a lognormal” • Use statistical tests to determine fit • Iteratively weighted least-squares-fit • Document it...

  10. Define System Model • What is the definition of the system that you will analyze? • Real world systems are too complicated • Choose a model that has just the right amount of simplification • Too simple  obvious or incorrect results • Too complicated  much harder analysis

  11. Propose Algorithm • The paper presents the one that worked • Start with something • Throw it away • Complicate: Add parameters • Simplify: Remove parameters • Refine until • It works • You can explain it

  12. Simulate • Build a simulator of your model • Use Java, C++, Python, whatever • NS-2 • Prove empirically that the algorithm • Works • Is better than your competition

  13. Analyze • Collect data points • Statistics • Mean, Std-Dev, etc. • Sensitivity to parameters

  14. Compare to Competition • Choose the competition so that you look good • Change their algorithm to work in your model • Compare the options (using restricted parameters)

  15. Write Paper • Now document your work