1422 search results - page 120 / 285 » How to measure a large open-source distributed system |
176
click to vote
SIGCOMM
2004
ACM
15 years 12 months ago
2004
ACM
Large-scale Internet applications can benefit from an ability to predict round-trip times to other hosts without having to contact them first. Explicit measurements are often un...
143
click to vote
SIGMOD
1991
ACM
15 years 10 months ago
1991
ACM
In this paper, Dept. of Computer Science, University of Waterloo Waterloo, Ontario, Canada, N2L 3G1 we consider how to exploit multiple disks to improve the performance of B-tree ...
172
click to vote
SIGMETRICS
1998
ACM
15 years 10 months ago
1998
ACM
We consider the problem of scheduling tasks with unpredictable service times on distinct processing nodes so as to meet a real-time deadline, given that all communication among no...
179
click to vote
TKDE
2002
15 years 6 months ago
2002
The construction and maintenance of data warehouses (views) in large-scale environments composed of numerous distributed and evolving information sources (ISs) such as the WWW has ...
181
click to vote
SIGMETRICS
2004
ACM
15 years 12 months ago
2004
ACM
The performance of IP networks depends on a wide variety of dynamic conditions. Traffic shifts, equipment failures, planned maintenance, and topology changes in other parts of th...