Sciweavers

5448 search results - page 175 / 1090
» Breakpoints and Time in Distributed Computations
Sort
View
SPAA
2009
ACM
15 years 11 months ago
Weak graph colorings: distributed algorithms and applications
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
Fabian Kuhn
CCGRID
2007
IEEE
15 years 10 months ago
Performance Evaluation in Grid Computing: A Modeling and Prediction Perspective
Experimental performance studies on computer systems, including Grids, require deep understandings on their workload characteristics. The need arises from two important and closel...
Hui Li
PODC
2010
ACM
15 years 8 months ago
Adaptive randomized mutual exclusion in sub-logarithmic expected time
Mutual exclusion is a fundamental distributed coordination problem. Shared-memory mutual exclusion research focuses on local-spin algorithms and uses the remote memory references ...
Danny Hendler, Philipp Woelfel
SC
2005
ACM
15 years 9 months ago
Bridging the Macro and Micro: A Computing Intensive Earthquake Study Using Discovery Net
We present the development and use of a novel distributed geohazard modeling environment for the analysis and interpretation of large scale earthquake data sets. Our work demonstr...
Yike Guo, Jian Guo Liu, Moustafa Ghanem, Kyran Mis...
ICDE
2005
IEEE
106views Database» more  ICDE 2005»
16 years 5 months ago
Effective Computation of Biased Quantiles over Data Streams
Skewis prevalentin manydata sourcessuchas IP traffic streams. To continually summarize the distribution of such data, a highbiased set of quantiles (e.g., 50th, 90th and 99th perc...
Graham Cormode, Flip Korn, S. Muthukrishnan, Dives...