Data migration to minimize the total completion time

DOI10.1016/J.JALGOR.2004.07.009MaRDI QIDQ4675488zbMATH OpenOpenAlexFDO

Authors Yoo-Ah Kim

Publication date 4 May 2005

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jalgor.2004.07.009

zbMATH Keywords

Approximation algorithmsData migrationLinear programmingScheduling

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Deterministic scheduling theory in operations research (90B35) Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Algorithms for data migration
• Combinatorial algorithms for data migration to minimize average completion time
• Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
• Improved results for data migration and open shop scheduling
• On algorithms for efficient data migration

Cited in

(9)

• Combinatorial algorithms for data migration to minimize average completion time
• Algorithms for data migration
• Min Sum Edge Coloring in Multigraphs Via Configuration LP
• Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
• Improved Algorithms for Data Migration
• On a local protocol for concurrent file transfers
• Facility location models to locate data in information networks: a literature review
• Automata, Languages and Programming
• Security-aware database migration planning

This page was built for publication: Data migration to minimize the total completion time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4675488)