Sciweavers

1636 search results - page 303 / 328
» Distributed application management using Plush
Sort
View
CIKM
2006
Springer
15 years 1 months ago
Efficiently clustering transactional data with weighted coverage density
In this paper, we propose a fast, memory-efficient, and scalable clustering algorithm for analyzing transactional data. Our approach has three unique features. First, we use the c...
Hua Yan, Keke Chen, Ling Liu
SIGMETRICS
2010
ACM
217views Hardware» more  SIGMETRICS 2010»
14 years 11 months ago
Optimal recovery of single disk failure in RDP code storage systems
Modern storage systems use thousands of inexpensive disks to meet the storage requirement of applications. To enhance the data availability, some form of redundancy is used. For e...
Liping Xiang, Yinlong Xu, John C. S. Lui, Qian Cha...
REPLICATION
2010
14 years 9 months ago
A History of the Virtual Synchrony Replication Model
In this chapter, we discuss a widely used fault-tolerant data replication model called virtual synchrony. The model responds to two kinds of needs. First, there is the practical qu...
Ken Birman
HPCA
2009
IEEE
15 years 11 months ago
Techniques for bandwidth-efficient prefetching of linked data structures in hybrid prefetching systems
Linked data structure (LDS) accesses are critical to the performance of many large scale applications. Techniques have been proposed to prefetch such accesses. Unfortunately, many...
Eiman Ebrahimi, Onur Mutlu, Yale N. Patt
KDD
2009
ACM
159views Data Mining» more  KDD 2009»
15 years 11 months ago
Adapting the right measures for K-means clustering
Clustering validation is a long standing challenge in the clustering literature. While many validation measures have been developed for evaluating the performance of clustering al...
Junjie Wu, Hui Xiong, Jian Chen