[КНИГА][B] Handbook of approximation algorithms and metaheuristics

TF Gonzalez - 2007 - taylorfrancis.com
Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …

A data replica placement strategy for IoT workflows in collaborative edge and cloud environments

Y Shao, C Li, H Tang - Computer Networks, 2019 - Elsevier
The convergence of edge and cloud computing shares their strengths, such as unlimited
shared storage and computing resources from cloud, low-latency data preprocessing of …

[КНИГА][B] High-performance parallel database processing and grid databases

D Taniar, CHC Leung, W Rahayu, S Goel - 2008 - books.google.com
The latest techniques and principles of parallel and grid database processing The growth in
grid databases, coupled with the utility of parallel query processing, presents an important …

On algorithms for efficient data migration

J Hall, J Hartline, AR Karlin, J Saia… - Proceedings of the twelfth …, 2001 - dl.acm.org
The data migration problem is the problem of computing an efficient plan for moving data
stored on devices in a network from one configuration to another. Load balancing or …

An experimental study of data migration algorithms

E Anderson, J Hall, J Hartline, M Hobbs… - … Workshop, WAE 2001 …, 2001 - Springer
The data migration problem is the problem of computing a plan for moving data objects
stored on devices in a network from one configuration to another. Load balancing or …

Learning-based approximation of interconnect delay and slew in signoff timing tools

AB Kahng, S Kang, H Lee, S Nath… - 2013 ACM/IEEE …, 2013 - ieeexplore.ieee.org
Incremental static timing analysis (iSTA) is the backbone of iterative sizing and Vt-swap**
heuristics for post-layout timing recovery and leakage power reduction. Performing such …

A novel workflow-level data placement strategy for data-sharing scientific cloud workflows

X Li, L Zhang, Y Wu, X Liu, E Zhu, H Yi… - IEEE Transactions …, 2016 - ieeexplore.ieee.org
Cloud computing can provide a more cost-effective way to deploy scientific workflows than
traditional distributed computing environments such as cluster and grid. Due to the large …

Algorithms for data migration with cloning

S Khuller, YA Kim, YC Wan - Proceedings of the twenty-second ACM …, 2003 - dl.acm.org
Our work is motivated by the problem of managing data on storage devices, typically a set of
disks. Such high demand storage servers are used as web servers, or multimedia servers for …

Polynomial time approximation schemes for class‐constrained packing problems

H Shachnai, T Tamir - Journal of Scheduling, 2001 - Wiley Online Library
We consider variants of the classic bin packing and multiple knapsack problems, in which
sets of items of different classes (colours) need to be placed in bins; the items may have …

Approximation algorithms for scheduling with class constraints

K Jansen, A Lassota, M Maack - … of the 32nd ACM Symposium on …, 2020 - dl.acm.org
Assigning jobs onto identical machines with the objective to minimize the maximal load is
one of the most basic problems in combinatorial optimization and has many practical …