Cited By
View all- Li CSun HChen YLuo Y(2019)Edge cloud resource expansion and shrinkage based on workload for minimizing the costFuture Generation Computer Systems10.1016/j.future.2019.05.026Online publication date: May-2019
Corrigendum: Improved results for data migration and open shop scheduling
Article No.: 34, Pages 1 - 7
Abstract
In Gandhi et al. [2006], we gave an algorithm for the data migration and non-deterministic open shop scheduling problems in the minimum sum version, that was claimed to achieve a 5.06-approximation. Unfortunately, it was pointed to us by Maxim Sviridenko that the argument contained an unfounded assumption that has eluded all of its readers until now. We detail in this document how this error can be amended. A side effect is an improved approximation ratio of 4.96.
References
[1]
Gandhi, R., Halldórsson, M. M., Kortsarz, G., and Shachnai, H. 2006. Improved results for data migration and open shop scheduling. ACM Trans. Algor. 2, 1, 116--129.
[2]
Hall, L., Schulz, A. S., Shmoys, D. B., and Wein, J. 1997. Scheduling to minimize average completion time: Off-line and on-line approximation algorithms. Math. Oper. Res. 22, 513--544.
Index Terms
- Corrigendum: Improved results for data migration and open shop scheduling
Recommendations
Improved results for data migration and open shop scheduling
The data migration problem is to compute an efficient plan for moving data stored on devices in a network from one configuration to another. We consider this problem with the objective of minimizing the sum of completion times of all storage devices. It ...
Improved bounds for scheduling conflicting jobs with minsum criteria
We consider a general class of scheduling problems where a set of conflicting jobs needs to be scheduled (preemptively or nonpreemptively) on a set of machines so as to minimize the weighted sum of completion times. The conflicts among jobs are formed ...
Data migration to minimize the total completion time
We consider the data migration problem, which is the problem of finding an efficient schedule to migrate data in a network. The data layout of a large storage server needs to be computed based on the expected data access pattern for load balancing. As ...
Comments
Information & Contributors
Information
Published In
Copyright © 2013 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 03 October 2013
Accepted: 01 December 2011
Revised: 01 October 2011
Received: 01 September 2011
Published in TALG Volume 9, Issue 4
Check for updates
Author Tags
Qualifiers
- Research-article
- Research
- Refereed
Funding Sources
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 163Total Downloads
- Downloads (Last 12 months)5
- Downloads (Last 6 weeks)0
Reflects downloads up to 22 Sep 2024
Other Metrics
Citations
Cited By
View all- Li CSun HChen YLuo Y(2019)Edge cloud resource expansion and shrinkage based on workload for minimizing the costFuture Generation Computer Systems10.1016/j.future.2019.05.026Online publication date: May-2019
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in