Data migration to minimize the average completion time

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Data migration to minimize the average completion time

Full text

Pdf (218 KB)

Source

Symposium on Discrete Algorithms archive
Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms table of contents

Baltimore, Maryland

SESSION: Session 1C table of contents

Pages: 97 - 98

Year of Publication: 2003

ISBN:0-89871-538-5

Author

Yoo-Ah Kim

University of Maryland, College Park, MD

Sponsors

: SIAM Activity Group on Discrete Mathematics
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

Society for Industrial and Applied Mathematics Philadelphia, PA, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 33, Citation Count: 0

Additional Information:

references index terms collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Amotz Bar-Noy , Mihir Bellare , Magnús M. Halldórsson , Hadas Shachnai , Tami Tamir, On chromatic sums and distributed resource allocation, Information and Computation, v.140 n.2, p.183-202, Feb. 1, 1998 [doi>10.1006/inco.1997.2677]
	2	E. G. Coffman, M. R. Garey, D. S. Johnson, and A. S. Lapaugh, Scheduling file transfers, SIAM J. on Computing, 14(3):744--780, 1985.
	3	M. K. Goldberg, Edge-coloring of multigraphs:recoloring technique, J. Graph Theory, 8:121--137, 1984.
	4	L. Golubchik , S. Khanna , S. Khuller , R. Thurimella , A. Zhu, Approximation algorithms for data placement on parallel disks, Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms, p.223-232, January 09-11, 2000, San Francisco, California, United States
	5	Joseph Hall , Jason Hartline , Anna R. Karlin , Jared Saia , John Wilkes, On algorithms for efficient data migration, Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms, p.620-629, January 07-09, 2001, Washington, D.C., United States
	6	Leslie A. Hall , Andreas S. Schulz , David B. Shmoys , Joel Wein, Scheduling to minimize average completion time: off-line and on-line approximation algorithms, Mathematics of Operations Research, v.22 n.3, p.513-544, Aug. 1997 [doi>10.1287/moor.22.3.513]
	7	Magnús M. Halldórsson , Guy Kortsarz , Hadas Shachnai, Minimizing Average Completion of Dedicated Tasks and Interval Graphs, Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization, p.114-126, August 18-20, 2001
	8	Dorit S Hochbaum , Takao Nishizeki , David B Shmoys, A better than “best possible” algorithm to edge color multigraphs, Journal of Algorithms, v.7 n.1, p.79-104, March 1986 [doi>10.1016/0196-6774(86)90039-8]
	9	Y. Kim, Data migration to minimize the average completion time, http://www.cs.umd.edu/~ykim/s03f.ps.
	10	Maurice Queyranne, Structure of a simple scheduling polyhedron, Mathematical Programming: Series A and B, v.58 n.2, p.263-285, Feb. 2, 1993 [doi>10.1007/BF01581271]