Fault-tolerant scheduling

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Fault-tolerant scheduling

Full text

Pdf (984 KB)

Source

Annual ACM Symposium on Theory of Computing archive
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing table of contents

Montreal, Quebec, Canada

Pages: 115 - 124

Year of Publication: 1994

ISBN:0-89791-663-8

Authors

Bala Kalyanasundaram	Computer Science Department, University of Pittsburgh
Kirk R. Pruhs	Computer Science Department, University of Pittsburgh

Sponsor

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 1, Downloads (12 Months): 24, 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

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/195058.195115 What is a DOI?

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	Anja Feldmann , Jiří Sgall , Shang-Hua Teng, Dynamic scheduling on parallel machines, Proceedings of the 32nd annual symposium on Foundations of computer science, p.111-120, September 1991, San Juan, Puerto Rico [doi>10.1109/SFCS.1991.185355]
	2	R. Graham, E. Lawler, J. Lenstra, and A Rinnooy Kan, "Optimization and approximation in deterministic sequencing and scheduling: a survey", Annals of Discrete Mathematics, 5, 287- 326, 1979.
	3	Tsuyoshi Matsumoto, Competitive Analysis of the Round Robin Algorithm, Proceedings of the Third International Symposium on Algorithms and Computation, p.71-77, December 16-18, 1992
	4	Rajeev Motwani , Steven Phillips , Eric Torng, Non-clairvoyant scheduling, Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms, p.422-431, January 25-27, 1993, Austin, Texas, United States
	5	K. Pruhs, "Average-case scalable on-fine algorithms for fault replacement", Technical Report, Computer Science Department, University of Pittsburgh, 1993.
	6	Daniel D. Sleator , Robert E. Tarjan, Amortized efficiency of list update and paging rules, Communications of the ACM, v.28 n.2, p.202-208, Feb. 1985 [doi>10.1145/2786.2793]
	7	David B. Shmoys , Joel Wein , David P. Williamson, Scheduling parallel machines on-line, Proceedings of the 32nd annual symposium on Foundations of computer science, p.131-140, September 1991, San Juan, Puerto Rico [doi>10.1109/SFCS.1991.185361]
	8	Jan Vytopil, Formal Techniques in Real-Time and Fault-Tolerant Systems, Kluwer Academic Publishers, Norwell, MA, 1993
	9	A. Yao, "Probabilistic computations: towards a unified measure of complexity", Proceedings of IEEE Symposium on Foundations of Computing, 222- 227, 1977.

CITED BY 5

	Andrei Broder , Michael Mitzenmacher, Optimal plans for aggregation, Proceedings of the twenty-first annual symposium on Principles of distributed computing, July 21-24, 2002, Monterey, California
	Vincenzo Liberatore, Scheduling jobs before shut-down, Nordic Journal of Computing, v.7 n.3, p.204-226, Fall 2000
	Pieter Thysebaert , Marc De Leenheer , Bruno Volckaert , Filip De Turck , Bart Dhoedt , Piet Demeester, Scalable dimensioning of resilient Lambda Grids, Future Generation Computer Systems, v.24 n.6, p.549-560, June, 2008
	Baruch Awerbuch , Yossi Azar , Amos Fiat , Tom Leighton, Making commitments in the face of uncertainty: how to pick a winner almost every time (extended abstract), Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, p.519-530, May 22-24, 1996, Philadelphia, Pennsylvania, United States
	Nikhil Bansal , Kirk Pruhs, Server scheduling in the L_p norm: a rising tide lifts all boat, Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, June 09-11, 2003, San Diego, CA, USA