Server scheduling in the L p norm: a rising tide lifts all boat

Server scheduling in the L_p norm: a rising tide lifts all boat

Full Text:

PDF

Buy this Article

Authors:	Nikhil Bansal	Carnegie Mellon University, Pittsburgh, PA
	Kirk Pruhs	University of Pittsburgh, Pittsburgh, PA

Published in:

· Proceeding

STOC '03 Proceedings of the thirty-fifth annual ACM symposium on Theory of computing

Pages 242-250
ACM New York, NY, USA ©2003
table of contents ISBN:1-58113-674-9 doi>10.1145/780542.780580

	2003 Article
Bibliometrics
· Downloads (6 Weeks): 1 · Downloads (12 Months): 31 · Downloads (cumulative): 343 · Citation Count: 23

Tags: algorithms flow time multilevel feedback performance performance attributes resource augmentation scheduling sequencing and scheduling shortest elapsed time first shortest job first shortest remaining processing time theory