Sciweavers

202 search results - page 11 / 41
» Dynamic and Redundant Data Placement
Sort
View
SYSTOR
2009
ACM
14 years 2 months ago
DHIS: discriminating hierarchical storage
A typical storage hierarchy comprises of components with varying performance and cost characteristics, providing multiple options for data placement. We propose and evaluate a hie...
Chaitanya Yalamanchili, Kiron Vijayasankar, Erez Z...
ICS
2005
Tsinghua U.
14 years 28 days ago
Continuous Replica Placement schemes in distributed systems
The Replica Placement Problem (RPP) aims at creating a set of duplicated data objects across the nodes of a distributed system in order to optimize certain criteria. Typically, RP...
Thanasis Loukopoulos, Petros Lampsas, Ishfaq Ahmad
ICEIS
2002
IEEE
14 years 13 days ago
Thin Servers - An Architecture to Support Arbitrary Placement of Computation in the Internet
: The Internet is experiencing an overwhelming growth that will have a negative impact on its performance and quality of service. In this paper we describe a new architecture that ...
Juan Carlos Diaz y Carballo, Alan Dearle, Richard ...
MDM
2009
Springer
123views Communications» more  MDM 2009»
14 years 2 months ago
Operator Placement for Snapshot Multi-predicate Queries in Wireless Sensor Networks
— This work aims at minimize the cost of answering snapshot multi-predicate queries in high-communication-cost networks. High-communication-cost (HCC) networks is a family of net...
Georgios Chatzimilioudis, Huseyin Hakkoymaz, Nikos...
ICDCS
2006
IEEE
14 years 1 months ago
Greedy is Good: On Service Tree Placement for In-Network Stream Processing
This paper is concerned with reducing communication costs when executing distributed user tasks in a sensor network. We take a service-oriented abstraction of sensor networks, whe...
Zoë Abrams, Jie Liu