Sciweavers

1422 search results - page 199 / 285
» How to measure a large open-source distributed system
Sort
View
SIGMOD
2009
ACM
157views Database» more  SIGMOD 2009»
16 years 6 months ago
Asynchronous view maintenance for VLSD databases
The query models of the recent generation of very large scale distributed (VLSD) shared-nothing data storage systems, including our own PNUTS and others (e.g. BigTable, Dynamo, Ca...
Parag Agrawal, Adam Silberstein, Brian F. Cooper, ...
ACSC
2009
IEEE
16 years 1 months ago
The Impact of Quanta on the Performance of Multi-level Time Sharing Policy under Heavy-tailed Workloads
Recent research indicates that modern computer workloads (e.g. processing time of web requests) follow heavy-tailed distributions. In a heavy-tailed distribution there are a large...
Malith Jayasinghe, Zahir Tari, Panlop Zeephongseku...
ICDE
2003
IEEE
73views Database» more  ICDE 2003»
16 years 7 months ago
Scalable Application-Aware Data Freshening
Distributed databases and other networked information systems use copies or mirrors to reduce latency and to increase availability. Copies need to be refreshed. In a loosely coupl...
Donald Carney, Sangdon Lee, Stanley B. Zdonik
COMPUTER
1999
108views more  COMPUTER 1999»
15 years 6 months ago
Distance Visualization: Data Exploration on the Grid
Scientific visualization has emerged as an important tool for extracting meaning from the large volumes of data produced by scientific instruments and simulations. Increasingly, t...
Ian T. Foster, Joseph A. Insley, Gregor von Laszew...
STOC
1997
ACM
125views Algorithms» more  STOC 1997»
15 years 10 months ago
An Interruptible Algorithm for Perfect Sampling via Markov Chains
For a large class of examples arising in statistical physics known as attractive spin systems (e.g., the Ising model), one seeks to sample from a probability distribution π on an...
James Allen Fill