Sciweavers

58
Voted
SIGMETRICS
2008
ACM
123views Hardware» more  SIGMETRICS 2008»
15 years 18 days ago
Applying formal methods to gossiping networks with mCRL and groove
Pepijn Crouzen, Jaco van de Pol, Arend Rensink
SIGMETRICS
2008
ACM
127views Hardware» more  SIGMETRICS 2008»
15 years 18 days ago
Image management in a virtualized data center
Industrial research firms such as Gartner and IDC are predicting an explosion in the number of online services in the coming years. Virtualization technologies could play an impor...
Tingxi Tan, Rob Simmonds, Bradley Arlt, Martin F. ...
58
Voted
SIGMETRICS
2008
ACM
15 years 18 days ago
CoMoM: class-oriented evaluation of multiclass models
Giuliano Casale
76
Voted
SIGMETRICS
2008
ACM
144views Hardware» more  SIGMETRICS 2008»
15 years 18 days ago
Co-designing the failure analysis and monitoring of large-scale systems
Large-scale distributed systems provide the backbone for numerous distributed applications and online services. These systems span over a multitude of computing nodes located at d...
Abhishek Chandra, Rohini Prinja, Sourabh Jain, Zhi...
83
Voted
SIGMETRICS
2008
ACM
15 years 18 days ago
A view-probability-matrix approach to the modelling of gossiping protocols
This paper addresses the quantitative analysis of gossiping protocols. In contrast to existing approaches which are entirely based on the simulation of the individual nodes' ...
Thomas Krieger, Martin Riedl, Johann Schuster, Mar...
103
Voted
SIGMETRICS
2008
ACM
109views Hardware» more  SIGMETRICS 2008»
15 years 18 days ago
Automatic request categorization in internet services
Modeling system performance and workload characteristics has become essential for efficiently provisioning Internet services and for accurately predicting future resource requirem...
Abhishek Sharma, Ranjita Bhagwan, Monojit Choudhur...
SIGMETRICS
2008
ACM
118views Hardware» more  SIGMETRICS 2008»
15 years 18 days ago
Finding the optimal quantum size: Sensitivity analysis of the M/G/1 round-robin queue
We consider the round robin (RR) scheduling policy where the server processes each job in its buffer for at most a fixed quantum, q, in a round-robin fashion. The processor sharin...
Varun Gupta
94
Voted
SIGMETRICS
2008
ACM
15 years 18 days ago
DRAM is plenty fast for wirespeed statistics counting
Per-flow network measurement at Internet backbone links requires the efficient maintanence of large arrays of statistics counters at very high speeds (e.g. 40 Gb/s). The prevailin...
Bill Lin, Jun (Jim) Xu
60
Voted
SIGMETRICS
2008
ACM
15 years 18 days ago
The effect of local scheduling in load balancing designs
Ho-Lin Chen, Jason R. Marden, Adam Wierman
67
Voted
SIGMETRICS
2008
ACM
15 years 18 days ago
A stochastic model for BitTorrent-like systems
Pei Li, John C. S. Lui, Yinlong Xu