Sciweavers

553 search results - page 13 / 111
» Cluster computing for web-scale data processing
Sort
View
HPDC
2007
IEEE
14 years 1 months ago
A fast topology inference: a building block for network-aware parallel processing
Adapting to the network is the key to achieving high performance for communication-intensive applications, including scientific computing, data intensive computing, and multicast...
Tatsuya Shirai, Hideo Saito, Kenjiro Taura
DSN
2000
IEEE
13 years 12 months ago
Data Replication Strategies for Fault Tolerance and Availability on Commodity Clusters
Recent work has shown the advantages of using persistent memory for transaction processing. In particular, the Vista transaction system uses recoverable memory to avoid disk I/O, ...
Cristiana Amza, Alan L. Cox, Willy Zwaenepoel
CIDR
2011
234views Algorithms» more  CIDR 2011»
12 years 11 months ago
SWissBox: An Architecture for Data Processing Appliances
Database appliances offer fully integrated hardware, storage, operating system, database, and related software in a single package. Database appliances have a relatively long hist...
Gustavo Alonso, Donald Kossmann, Timothy Roscoe
ICMLA
2008
13 years 9 months ago
Farthest Centroids Divisive Clustering
A method is presented to partition a given set of data entries embedded in Euclidean space by recursively bisecting clusters into smaller ones. The initial set is subdivided into ...
Haw-ren Fang, Yousef Saad
SDM
2009
SIAM
176views Data Mining» more  SDM 2009»
14 years 4 months ago
Constraint-Based Subspace Clustering.
In high dimensional data, the general performance of traditional clustering algorithms decreases. This is partly because the similarity criterion used by these algorithms becomes ...
Élisa Fromont, Adriana Prado, Céline...