Minimal Cost Reconfiguration of Data Placement in Storage Area Network-Reference-Cited by-同舟云学术

Minimal Cost Reconfiguration of Data Placement in Storage Area Network

Published:2010 Issue: Volume: Page:229-241
ISSN:0302-9743
Container-title:Approximation and Online Algorithms
language:
Short-container-title:

Author:

Shachnai Hadas,Tamir Gal,Tamir Tami

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-12450-1_21.pdf

Reference23 articles.

1. Chou, C.F., Golubchik, L., Lui, J.C.S.: A performance study of dynamic replication techniques in continuous media servers. In: IEEE MASCOTS (2000)

2. Caprara, A., Kellerer, H., Pferschy, U., Pisinger, D.: Approximation algorithms for knapsack problems with cardinality constraints. Euro. Journal of OR 123 (2000)

3. Lecture Notes in Computer Science;J. Dukes,2004

4. Gandhi, R., Halldórsson, M.M., Kortsarz, G., Shachnai, H.: Improved results for data migration and open shop scheduling. ACM Trans. on Algorithms 2(3) (2006)

5. Golubchik, L., Khanna, S., Khuller, S., Thurimella, R., Zhu, A.: Approximation algorithms for data placement on parallel disks. In: Proc. of SODA (2000)

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Theory and Algorithms for Combinatorial Reoptimization;Algorithmica;2017-01-27

2. Dynamic Scheduling of Requests Based on Impacting Parameters in Cloud Based Architectures;ICT and Critical Infrastructure: Proceedings of the 48th Annual Convention of Computer Society of India- Vol I;2014

3. Reoptimization of the Minimum Total Flow-Time Scheduling Problem;Lecture Notes in Computer Science;2012

4. A Theory and Algorithms for Combinatorial Reoptimization;LATIN 2012: Theoretical Informatics;2012

5. Incremental List Coloring of Graphs, Parameterized by Conservation;Lecture Notes in Computer Science;2010