Skip to main content

2015 | OriginalPaper | Buchkapitel

Mean-Field Analysis for Heterogeneous Work Stealing Models

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

In this paper, we provide a simple framework for applying the mean-field theory to dealing with a heterogeneous work stealing model of M clusters, each of which consists of N same servers and operates under two types of work stealing schemes: One within a cluster, and another between any two clusters. We first set up an infinite-dimensional system of mean-field equations, which is related to the M clusters. Then we use the martingale limit theory to prove the asymptotic independence of this heterogeneous work stealing model. Finally, we analyze and compute the fixed point, which can give performance analysis of this heterogeneous stealing model.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat Anselmi, J., Gaujal, B.: Performance evaluation of a work stealing algorithm for streaming applications. In: Abdelzaher, T., Raynal, M., Santoro, N. (eds.) OPODIS 2009. LNCS, vol. 5923, pp. 1–12. Springer, Heidelberg (2009)CrossRef Anselmi, J., Gaujal, B.: Performance evaluation of a work stealing algorithm for streaming applications. In: Abdelzaher, T., Raynal, M., Santoro, N. (eds.) OPODIS 2009. LNCS, vol. 5923, pp. 1–12. Springer, Heidelberg (2009)CrossRef
2.
Zurück zum Zitat Benaim, M., Le Boudec, J.Y.: A class of mean field interaction models for computer and communication systems. Perform. Eval. 65(11), 823–838 (2008)CrossRef Benaim, M., Le Boudec, J.Y.: A class of mean field interaction models for computer and communication systems. Perform. Eval. 65(11), 823–838 (2008)CrossRef
3.
Zurück zum Zitat Berenbrink, P., Friedetzky, T., Goldberg, L.: The natural work-stealing algorithm is stable. SIAM J. Comput. 32(5), 1260–1279 (2003)MathSciNetCrossRefMATH Berenbrink, P., Friedetzky, T., Goldberg, L.: The natural work-stealing algorithm is stable. SIAM J. Comput. 32(5), 1260–1279 (2003)MathSciNetCrossRefMATH
4.
5.
Zurück zum Zitat Blumofe, R.D., Papadopoulos, D.: The performance of work stealing in multiprogrammed environments. ACM SIGMETRICS Perform. Eval. Rev. 26(1), 266–267 (1998)CrossRef Blumofe, R.D., Papadopoulos, D.: The performance of work stealing in multiprogrammed environments. ACM SIGMETRICS Perform. Eval. Rev. 26(1), 266–267 (1998)CrossRef
7.
Zurück zum Zitat Gast, N., Gaujal, B.: A mean field model of work stealing in large-scale systems. ACM SIGMETRICS Perform. Eval. Rev. 38(1), 13–24 (2010)CrossRef Gast, N., Gaujal, B.: A mean field model of work stealing in large-scale systems. ACM SIGMETRICS Perform. Eval. Rev. 38(1), 13–24 (2010)CrossRef
8.
Zurück zum Zitat Harchol-Balter, M., Li, C., Osogami, T., Scheller-Wolf, A., Squillante, M.S.: Analysis of task assignment with cycle stealing under central queue. In: The 23rd International Conference of IEEE on Distributed Computing Systems, pp. 628–637 (2003) Harchol-Balter, M., Li, C., Osogami, T., Scheller-Wolf, A., Squillante, M.S.: Analysis of task assignment with cycle stealing under central queue. In: The 23rd International Conference of IEEE on Distributed Computing Systems, pp. 628–637 (2003)
9.
Zurück zum Zitat Hendler, D., Shavit, N.: Non-blocking steal-half work queues. In: Proceedings of the Twenty-First Annual Symposium on Principles of Distributed Computing, ACM, pp. 280–289 (2002) Hendler, D., Shavit, N.: Non-blocking steal-half work queues. In: Proceedings of the Twenty-First Annual Symposium on Principles of Distributed Computing, ACM, pp. 280–289 (2002)
11.
Zurück zum Zitat Li, Q.L., Dai, G., Lui, J.C.S., Wang, Y.: The mean-field computation in a supermarket model with server multiple vacations. Discrete Event Dyn. Syst. 24(4), 473–522 (2014)MathSciNetCrossRefMATH Li, Q.L., Dai, G., Lui, J.C.S., Wang, Y.: The mean-field computation in a supermarket model with server multiple vacations. Discrete Event Dyn. Syst. 24(4), 473–522 (2014)MathSciNetCrossRefMATH
12.
Zurück zum Zitat Li, Q.L., Lui, J.C.S.: Block-structured supermarket models. Discrete Event Dynamic Systems, 1–36, 29 June 2014 Li, Q.L., Lui, J.C.S.: Block-structured supermarket models. Discrete Event Dynamic Systems, 1–36, 29 June 2014
13.
Zurück zum Zitat Lu, Y., Xie, Q., Kliot, G., Geller, A., Larus, J.R., Greenberg, A.: Join-Idle-Queue: a novel load balancing algorithm for dynamically scalable web services. Perform. Eval. 68(11), 1056–1071 (2011)CrossRef Lu, Y., Xie, Q., Kliot, G., Geller, A., Larus, J.R., Greenberg, A.: Join-Idle-Queue: a novel load balancing algorithm for dynamically scalable web services. Perform. Eval. 68(11), 1056–1071 (2011)CrossRef
14.
Zurück zum Zitat Minnebo, W., Van Houdt, B.: A fair comparison of pull and push strategies in large distributed networks. IEEE/ACM Trans. Netw. 22(3), 996–1006 (2014)CrossRef Minnebo, W., Van Houdt, B.: A fair comparison of pull and push strategies in large distributed networks. IEEE/ACM Trans. Netw. 22(3), 996–1006 (2014)CrossRef
15.
Zurück zum Zitat Mitzenmacher, M.D.: The power of two choices in randomized load balancing. Ph.D. thesis, Department of Computer Science, University of California at Berkeley, USA (1996) Mitzenmacher, M.D.: The power of two choices in randomized load balancing. Ph.D. thesis, Department of Computer Science, University of California at Berkeley, USA (1996)
16.
Zurück zum Zitat Mitzenmacher, M.D.: Analyses of load stealing models based in di erential equations. In: The 10th ACM Symposium on Parallel Algorithms and Architectures, pp. 212–221 (1998) Mitzenmacher, M.D.: Analyses of load stealing models based in di erential equations. In: The 10th ACM Symposium on Parallel Algorithms and Architectures, pp. 212–221 (1998)
17.
Zurück zum Zitat Osogami, T., Harchol-Balter, M., Scheller-Wolf, A.: Analysis of cycle stealing with switching cost. J. ACM 31(1), 184–195 (2003) Osogami, T., Harchol-Balter, M., Scheller-Wolf, A.: Analysis of cycle stealing with switching cost. J. ACM 31(1), 184–195 (2003)
18.
Zurück zum Zitat Rogers, L.C.G., Williams, D.: Diffusions, Markov Processes, and Martingales 2: Itô Calculus. Wiley, New York (1987)MATH Rogers, L.C.G., Williams, D.: Diffusions, Markov Processes, and Martingales 2: Itô Calculus. Wiley, New York (1987)MATH
19.
Zurück zum Zitat Squillante, M.S.: Stochastic analysis of multiserver systems. ACM SIGMETRICS Perform. Eval. Rev. 34(4), 44–51 (2007)CrossRef Squillante, M.S.: Stochastic analysis of multiserver systems. ACM SIGMETRICS Perform. Eval. Rev. 34(4), 44–51 (2007)CrossRef
20.
Zurück zum Zitat Squillante, M.S., Nelson, R.: Analysis of task migration in shared-memory multiprocessor scheduling. J. ACM 19(1), 143–155 (1991) Squillante, M.S., Nelson, R.: Analysis of task migration in shared-memory multiprocessor scheduling. J. ACM 19(1), 143–155 (1991)
21.
Zurück zum Zitat Vvedenskaya, N.D., Dobrushin, R.L., Karpelevich, F.I.: Queueing system with selection of the shortest of two queues: an asymptotic approach. Probl. Inf. Transmissions 32(1), 20–34 (1996)MATH Vvedenskaya, N.D., Dobrushin, R.L., Karpelevich, F.I.: Queueing system with selection of the shortest of two queues: an asymptotic approach. Probl. Inf. Transmissions 32(1), 20–34 (1996)MATH
Metadaten
Titel
Mean-Field Analysis for Heterogeneous Work Stealing Models
verfasst von
Quan-Lin Li
Feifei Yang
Copyright-Jahr
2015
DOI
https://doi.org/10.1007/978-3-319-25861-4_3