SwePub
Sök i SwePub databas

  Utökad sökning

Träfflista för sökning "L773:0037 1998 OR L773:1613 3692 srt2:(2000-2004)"

Sökning: L773:0037 1998 OR L773:1613 3692 > (2000-2004)

  • Resultat 1-4 av 4
Sortera/gruppera träfflistan
   
NumreringReferensOmslagsbildHitta
1.
  •  
2.
  •  
3.
  •  
4.
  • Teo, Y. M., et al. (författare)
  • Comparison of load balancing strategies on cluster-based web servers
  • 2001
  • Ingår i: Simulation (San Diego, Calif.). - 0037-5497 .- 1741-3133. ; 77:05-6, s. 185-195
  • Tidskriftsartikel (refereegranskat)abstract
    • This paper focuses on an experimental analysis of the performance and scalability of cluster-based web servers. We carry out the comparative studies using two experimental platforms, namely, a hardware testbed consisting of sixteen PCs, and a trace-driven discrete-event simulator. Dispatcher and web server service times used in the simulator are determined by carrying out a set of experiments on the testbed. The simulator is validated against stochastic queuing models and the testbed. Experiments on the testbed are limited by the hardware configuration, but our complementary approach allows us to carry out scalability studies on the validated simulator. The three dispatcher-based scheduling algorithms analyzed are: round robin scheduling, least connected based scheduling, and least loaded based scheduling. The least loaded algorithm is used as the baseline (upper performance bound) in our analysis and the performance metrics include average waiting tune, average response time, and average web server utilization. A synthetic trace generated by the workload generator called SURGE, and a public-domain France Football World Cup 1998 trace are used. We observe that the round robin algorithm performs much worse in comparison with the other two algorithms for low to medium workload. However, as the request arrival rate increases, the performance of the three algorithms converge with the least connected algorithm approaching the baseline algorithm at a match faster rate than the round robin. The least connected algorithm performs well for medium to high workload. At very low load, the average waiting time is two to six times higher than the baseline algorithm but the absolute value between these two waiting times is very small.
  •  
Skapa referenser, mejla, bekava och länka
  • Resultat 1-4 av 4
Typ av publikation
tidskriftsartikel (4)
Typ av innehåll
refereegranskat (4)
Författare/redaktör
Sonesson, Göran (3)
Ayani, Rassul (1)
Teo, Y. M. (1)
Lärosäte
Lunds universitet (3)
Kungliga Tekniska Högskolan (1)
Språk
Engelska (4)
Forskningsämne (UKÄ/SCB)
Humaniora (3)

År

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy