Sciweavers

969 search results - page 37 / 194
» Clustering performance data efficiently at massive scales
Sort
View
OSDI
2008
ACM
15 years 8 months ago
DryadLINQ: A System for General-Purpose Distributed Data-Parallel Computing Using a High-Level Language
DryadLINQ is a system and a set of language extensions that enable a new programming model for large scale distributed computing. It generalizes previous execution environments su...
Yuan Yu, Michael Isard, Dennis Fetterly, Mihai Bud...
COLCOM
2005
IEEE
15 years 11 months ago
Providing both scale and security through a single core probabilistic protocol
Distributed systems are typically designed for scale and performance first, which makes it difficult to add security later without affecting the original properties. This paper ...
Ramsés Morales, Indranil Gupta
DAC
2002
ACM
16 years 7 months ago
Dynamic and leakage power reduction in MTCMOS circuits using an automated efficient gate clustering technique
Reducing power dissipation is one of the most principle subjects in VLSI design today. Scaling causes subthreshold leakage currents to become a large component of total power diss...
Mohab Anis, Mohamed Mahmoud, Mohamed I. Elmasry, S...
IAT
2010
IEEE
15 years 4 months ago
An Interactive Tool for Constrained Clustering with Human Sampling
Abstract--This paper describes an interactive tool for constrained clustering that helps users to select effective constraints efficiently during the constrained clustering process...
Masayuki Okabe, Seiji Yamada
WADS
2009
Springer
223views Algorithms» more  WADS 2009»
16 years 19 days ago
Fault Tolerant External Memory Algorithms
Abstract. Algorithms dealing with massive data sets are usually designed for I/O-efficiency, often captured by the I/O model by Aggarwal and Vitter. Another aspect of dealing with ...
Gerth Stølting Brodal, Allan Grønlun...