Loading...
Please wait, while we are loading the content...
Similar Documents
On Algorithms for EÆcient Data Migration
| Content Provider | Semantic Scholar |
|---|---|
| Author | Hall, Joseph Hartline, Jason D. Karlin, Anna R. Saia, Jared Wilkes, John |
| Abstract | The data migration problem is the problem of computing an eÆcient plan for moving data stored on devices in a network from one con guration to another. Load balancing or changing usage patterns could necessitate such a rearrangement of data. In this paper, we consider the case where the objects are xed-size and the network is complete. The direct migration problem is closely related to edge-coloring. However, because there are space constraints on the devices, the problem is more complex. Our main results are polynomial time algorithms for nding a near-optimal migration plan in the presence of space constraints when a certain number of additional nodes is available as temporary storage, and a 3/2-approximation for the case where data must be migrated directly to its destination. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://www.e-wilkes.com/john/papers/SODA-2001.pdf |
| Alternate Webpage(s) | http://www.researchgate.net/profile/Jared_Saia/publication/220779981_On_algorithms_for_efficient_data_migration/links/00b4951a65ab430960000000.pdf |
| Alternate Webpage(s) | https://www.researchgate.net/profile/Jared_Saia/publication/220779981_On_algorithms_for_efficient_data_migration/links/00b4951a65ab430960000000.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
