Sciweavers

1422 search results - page 71 / 285
» How to measure a large open-source distributed system
Sort
View
SIGSOFT
2007
ACM
16 years 7 months ago
Measuring empirical computational complexity
The standard language for describing the asymptotic behavior of algorithms is theoretical computational complexity. We propose a method for describing the asymptotic behavior of p...
Simon Goldsmith, Alex Aiken, Daniel Shawcross Wilk...
IMC
2010
ACM
15 years 4 months ago
Speed testing without speed tests: estimating achievable download speed from passive measurements
How fast is the network? The speed at which real users can download content at different locations and at different times is an important metric for service providers. Knowledge o...
Alexandre Gerber, Jeffrey Pang, Oliver Spatscheck,...
ICDCS
2007
IEEE
16 years 18 days ago
Distributed Resource Management and Admission Control of Stream Processing Systems with Max Utility
A fundamental problem in a large scale decentralized stream processing system is how to best utilize the available resources and admission control the bursty and high volume input...
Cathy H. Xia, Donald F. Towsley, Chun Zhang
ICASSP
2011
IEEE
14 years 10 months ago
Fast estimation of the state of the power grid using synchronized phasor measurements
—Both the communication limitation and the measurement properties based algorithm become the bottleneck of enhancing the traditional power system state estimation speed. The avai...
Tao Yang, Anjan Bose
NCA
2007
IEEE
16 years 16 days ago
Impact of request dispatching granularity in geographically distributed Web systems
The advent of the mobile Web and the increasing demand for personalized contents arise the need for computationally expensive services, such as dynamic generation and on-thefly a...
Mauro Andreolini, Claudia Canali, Riccardo Lancell...