Sciweavers

Share
6 search results - page 1 / 2
» Combinatorial Algorithms for Data Migration to Minimize Aver...
Sort
View
APPROX
2006
Springer
124views Algorithms» more  APPROX 2006»
11 years 12 months ago
Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
The data migration problem is to compute an efficient plan for moving data stored on devices in a network from one configuration to another. It is modeled by a transfer graph, wher...
Rajiv Gandhi, Julián Mestre
ADBIS
2006
Springer
93views Database» more  ADBIS 2006»
12 years 2 months ago
An On-Line Reorganization Framework for SAN File Systems
While the cost per megabyte of magnetic disk storage is economical, organizations are alarmed by the increasing cost of managing storage. Storage Area Network (SAN) architectures ...
Shahram Ghandeharizadeh, Shan Gao, Chris Gahagan, ...
APPROX
2007
Springer
112views Algorithms» more  APPROX 2007»
12 years 2 months ago
Encouraging Cooperation in Sharing Supermodular Costs
Abstract Consider a situation where a group of agents wishes to share the costs of their joint actions, and needs to determine how to distribute the costs amongst themselves in a f...
Andreas S. Schulz, Nelson A. Uhan
SCCC
2005
IEEE
12 years 1 months ago
Balancing active objects on a peer to peer infrastructure
We present a contribution on dynamic load balancing for distributed and parallel object-oriented applications. We specially target on peer to peer systems and its capability to di...
Javier Bustos-Jiménez, Denis Caromel, Alexa...
CORR
2011
Springer
210views Education» more  CORR 2011»
10 years 12 months ago
Transmission with Energy Harvesting Nodes in Fading Wireless Channels: Optimal Policies
Wireless systems comprised of rechargeable nodes have a significantly prolonged lifetime and are sustainable. A distinct characteristic of these systems is the fact that the node...
Omur Ozel, Kaya Tutuncuoglu, Jing Yang, Sennur Ulu...
books