Applying extra-resource analysis to load balancing

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Applying extra-resource analysis to load balancing

Full text

Pdf (212 KB)

Source

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

San Francisco, California, United States

Pages: 560 - 561

Year of Publication: 2000

ISBN:0-89871-453-2

Authors

Mark Brehob	Department of Computer Science and Engineering, Michigan State University
Eric Torng	Department of Computer Science and Engineering, Michigan State University
Patchrawat Uthaisombut	Department of Computer Science and Engineering, Michigan State University

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIAM : Society for Industrial and Applied Mathematics

Publisher

Society for Industrial and Applied Mathematics Philadelphia, PA, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 16, Citation Count: 5

Additional Information:

references cited by index terms collaborative colleagues peer to peer

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	Susanne Albers, Better bounds for online scheduling, Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, p.130-139, May 04-06, 1997, El Paso, Texas, United States [doi>10.1145/258533.258566]
	2	E. G. Coffman, Jr. , M. R. Garey , D. S. Johnson, Approximation algorithms for bin packing: a survey, Approximation algorithms for NP-hard problems, PWS Publishing Co., Boston, MA, 1996
	3	Jeff Edmonds, Scheduling in the dark, Proceedings of the thirty-first annual ACM symposium on Theory of computing, p.179-188, May 01-04, 1999, Atlanta, Georgia, United States [doi>10.1145/301250.301299]
	4	R.L. Graham. Bounds for certain multiprocessing anomalies. Bell System Tech. J., 45:1563-1581, 1966.
	5	I~.L. Graham. Bounds on multiprocessing anomalies. SIAM J. on Applied Mathematics, 17:263-269, 1969.
	6	D.S. Johnson, A. Demers, J.D. Ullman, M.R. Garey, and R.L. Graham. Worst case performance bounds for simple one-dimensional packing algorithms. SIAM J. on Computing, 3:299-325, 1974.
	7	B. Kalyanasundaram , Kirk Pruhs, Speed is as powerful as clairvoyance [scheduling problems], Proceedings of the 36th Annual Symposium on Foundations of Computer Science (FOCS'95), p.214, October 23-25, 1995
	8	Tak Wah Lam , Kar Keung To, Trade-offs between speed and processor in hard-deadline scheduling, Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, p.623-632, January 17-19, 1999, Baltimore, Maryland, United States
	9	Cynthia A. Phillips , Cliff Stein , Eric Torng , Joel Wein, Optimal time-critical scheduling via resource augmentation (extended abstract), Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, p.140-149, May 04-06, 1997, El Paso, Texas, United States [doi>10.1145/258533.258570]

CITED BY 5

	Chiu-Yuen Koo , Tak-Wah Lam , Tsuen-Wan Ngan , Kunihiko Sadakane , Kar-Keung To, On-line scheduling with tight deadlines, Theoretical Computer Science, v.295 n.1-3, p.251-261, 24 February 2003
	Chiu-Yuen Koo , Tak-Wah Lam , Tsuen-Wan Ngan , Kar-Keung To, Extra processors versus future information in optimal deadline scheduling, Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures, August 10-13, 2002, Winnipeg, Manitoba, Canada
	Tak-Wah Lam , Tsuen-Wan Johnny Ngan , Kar-Keung To, Performance guarantee for EDF under overload, Journal of Algorithms, v.52 n.2, p.193-206, August 2004
	Tak-Wah Lam , Kar-Keung To, Performance guarantee for online deadline scheduling in the presence of overload, Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms, p.755-764, January 07-09, 2001, Washington, D.C., United States
	Chiu-Yuen Koo , Tak-Wah Lam , Tsuen-Wan Ngan , Kar-Keung To, Competitive deadline scheduling via additional or faster processors, Journal of Scheduling, v.6 n.2, p.213-223, March/April 2003