Algorithms for data migration
From MaRDI portal
Publication:2379927
DOI10.1007/s00453-008-9214-yzbMath1184.68629OpenAlexW2029872107MaRDI QIDQ2379927
J. Wilkes, M. Hobbes, Jared Saia, Eric J. Anderson, J. Hall, Ram Swaminathan, Anna R. Karlin, Jason D. Hartline
Publication date: 23 March 2010
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-008-9214-y
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Packet routing in fixed-connection networks: A survey
- Preemptive versus nonpreemptive scheduling for biprocessor tasks on dedicated processors
- Data migration on parallel disks: Algorithms and evaluation
- On the $1.1$ Edge-Coloring of Multigraphs
- Improved Algorithms for Data Migration
- Scheduling File Transfers
- Algorithms for Data Migration with Cloning
- Data migration to minimize the total completion time
- A Theorem on Coloring the Lines of a Network
This page was built for publication: Algorithms for data migration