Sciweavers

33 search results - page 3 / 7
» Lossless compression for large scale cluster logs
Sort
View
IPPS
2003
IEEE
13 years 11 months ago
Quantifying Locality Effect in Data Access Delay: Memory logP
The application of hardware-parameterized models to distributed systems can result in omission of key bottlenecks such as the full cost of inter-node communication in a shared mem...
Kirk W. Cameron, Xian-He Sun
CLUSTER
2003
IEEE
13 years 11 months ago
Coordinated Checkpoint versus Message Log for Fault Tolerant MPI
— Large Clusters, high availability clusters and Grid deployments often suffer from network, node or operating system faults and thus require the use of fault tolerant programmin...
Aurelien Bouteiller, Pierre Lemarinier, Gér...
SIGMOD
2001
ACM
200views Database» more  SIGMOD 2001»
14 years 6 months ago
Data Bubbles: Quality Preserving Performance Boosting for Hierarchical Clustering
In this paper, we investigate how to scale hierarchical clustering methods (such as OPTICS) to extremely large databases by utilizing data compression methods (such as BIRCH or ra...
Markus M. Breunig, Hans-Peter Kriegel, Peer Kr&oum...
SIGMETRICS
2011
ACM
270views Hardware» more  SIGMETRICS 2011»
12 years 9 months ago
Scalable monitoring via threshold compression in a large operational 3G network
Threshold-based performance monitoring in large 3G networks is very challenging for two main factors: large network scale and dynamics in both time and spatial domains. There exis...
Suk-Bok Lee, Dan Pei, MohammadTaghi Hajiaghayi, Io...
SIROCCO
2008
13 years 7 months ago
Distributed Approximation Algorithm for Resource Clustering
In this paper, we consider the clustering of resources on large scale platforms. More precisely, we target parallel applications consisting of independant tasks, where each task is...
Olivier Beaumont, Nicolas Bonichon, Philippe Ducho...