Sciweavers

44 search results - page 6 / 9
» Replica Placement and Access Policies in Tree Networks
Sort
View
KDD
1998
ACM
122views Data Mining» more  KDD 1998»
13 years 11 months ago
Memory Placement Techniques for Parallel Association Mining
Many data mining tasks (e.g., Association Rules, Sequential Patterns) use complex pointer-based data structures (e.g., hash trees) that typically suffer from sub-optimal data loca...
Srinivasan Parthasarathy, Mohammed Javeed Zaki, We...
WCNC
2010
IEEE
13 years 11 months ago
A Lightweight Distributed Solution to Content Replication in Mobile Networks
Abstract—Performance and reliability of content access in mobile networks is conditioned jointly by the number and location of content replicas deployed at the network nodes. The...
C.-A. La, Pietro Michiardi, Claudio Casetti, Carla...
SAINT
2007
IEEE
14 years 1 months ago
Data Management on Grid Filesystem for Data-Intensive Computing
In parallel computing environments such as HPC clusters and the Grid, data-intensive applications involve large overhead costs due to a concentration of access to the files on co...
Hitoshi Sato, Satoshi Matsuoka
EUROMICRO
1996
IEEE
13 years 11 months ago
Experience of Adaptive Replication in Distributed File Systems
Replication is a key strategy for improving locality, fault tolerance and availability in distributed systems. The paper focuses on distributed file systems and presents a system ...
Giacomo Cabri, Antonio Corradi, Franco Zambonelli
NOSSDAV
2005
Springer
14 years 25 days ago
Interactive media server with media synchronized RAID storage system
We propose an efficient placement algorithm and per-disk prefetching method to effectively support interactive operations in the media server. Our placement policy is incorporate...
Seung Ho Lim, Yo-Won Jeong, Kyu Ho Park