Combinatorial algorithms for data migration to minimize average completion time
From MaRDI portal
Publication:1024212
DOI10.1007/S00453-007-9118-2zbMATH Open1168.90015OpenAlexW2175640098MaRDI QIDQ1024212FDOQ1024212
Authors: Rajiv Gandhi, Julián Mestre 
Publication date: 16 June 2009
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-007-9118-2
Recommendations
- Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
- Automata, Languages and Programming
- Improved results for data migration and open shop scheduling
- Corrigendum: ``Improved results for data migration and open shop scheduling
- Data migration to minimize the total completion time
- On algorithms for efficient data migration
- Algorithms for data migration
- scientific article; zbMATH DE number 1848399
- Improved Algorithms for Data Migration
- Improved approximation algorithms for data migration
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25)
Cites Work
- Bounds for Certain Multiprocessing Anomalies
- Algorithms for Edge Coloring Bipartite Graphs and Multigraphs
- Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
- Scheduling File Transfers
- On chromatic sums and distributed resource allocation
- On the $1.1$ Edge-Coloring of Multigraphs
- Approximation algorithms for shop scheduling problems with minsum objective
- Structure of a simple scheduling polyhedron
- Title not available (Why is that?)
- Sum coloring interval and \(k\)-claw free graphs with application to scheduling dependent jobs
- On algorithms for efficient data migration
- Improved results for data migration and open shop scheduling
- Title not available (Why is that?)
- Data migration to minimize the total completion time
- Title not available (Why is that?)
- A (2+ε)-approximation algorithm for the generalized preemptive open shop problem with minsum objective
- Algorithms for Data Migration with Cloning
- Complexity results for minimum sum edge coloring
- Improved Algorithms for Data Migration
- Adaptive local ratio
- Approximation and Online Algorithms
Cited In (9)
- Improved Algorithms for Data Migration
- Security-aware database migration planning
- Scheduling problems over network of machines
- Data migration to minimize the total completion time
- Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
- Minimum sum set coloring of trees and line graphs of trees
- Scheduling problems over a network of machines
- On a local protocol for concurrent file transfers
- Improved approximation algorithms for data migration
This page was built for publication: Combinatorial algorithms for data migration to minimize average completion time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1024212)
