Data migration to minimize the total completion time

DOI10.1016/J.JALGOR.2004.07.009MaRDI QIDQ4675488zbMATHOpenAlexFDO

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

SchedulingApproximation algorithmsLinear programmingData migration

Mathematics Subject Classification ID

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

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)

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

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)