Sciweavers

2034 search results - page 230 / 407
» On the Comparability of Software Clustering Algorithms
Sort
View
103
Voted
CLUSTER
2000
IEEE
15 years 3 months ago
Dynamic Max-Min fairness in ring networks
Ring networks are enjoying renewed interest as Storage Area Networks (SANs), i.e., networks for interconnecting storage devices (e.g., disk, disk arrays and tape drives) and stora...
Giuseppe Anastasi, Luciano Lenzini, M. La Porta, Y...
129
Voted
EUROSYS
2007
ACM
16 years 17 days ago
Tashkent+: memory-aware load balancing and update filtering in replicated databases
We present a memory-aware load balancing (MALB) technique to dispatch transactions to replicas in a replicated database. Our MALB algorithm exploits knowledge of the working sets ...
Sameh Elnikety, Steven G. Dropsho, Willy Zwaenepoe...
139
Voted
AOSD
2007
ACM
15 years 7 months ago
Efficiently mining crosscutting concerns through random walks
Inspired by our past manual aspect mining experiences, this paper describes a random walk model to approximate how crosscutting concerns can be discovered in the absence of domain...
Charles Zhang, Hans-Arno Jacobsen
167
Voted
CN
2006
100views more  CN 2006»
15 years 3 months ago
Small-world overlay P2P networks: Construction, management and handling of dynamic flash crowds
We consider how to construct and maintain a structured overlay P2P network based on the small-world paradigm. Two main attractive properties of a small-world network are (1) a low...
Ken Y. K. Hui, John C. S. Lui, David K. Y. Yau
150
Voted
HIPC
2009
Springer
15 years 1 months ago
Fast checkpointing by Write Aggregation with Dynamic Buffer and Interleaving on multicore architecture
Large scale compute clusters continue to grow to ever-increasing proportions. However, as clusters and applications continue to grow, the Mean Time Between Failures (MTBF) has redu...
Xiangyong Ouyang, Karthik Gopalakrishnan, Tejus Ga...