Optimizing throughput and energy in online deadline scheduling

doi:10.1145/1644015.1644025

Optimizing throughput and energy in online deadline scheduling

Full Text:

Pdf

Buy this Article

Authors:	Ho-Leung Chan	University of Hong Kong, Hong Kong
	Joseph Wun-Tat Chan	King's College London, UK
	Tak-Wah Lam	University of Hong Kong, Hong Kong
	Lap-Kei Lee	University of Hong Kong, Hong Kong
	Kin-Sum Mak	University of Hong Kong, Hong Kong
	Prudence W. H. Wong	University of Liverpool, UK

	2009 Article Research Refereed
Bibliometrics
· Downloads (6 Weeks): 7 · Downloads (12 Months): 51 · Downloads (cumulative): 257 · Citation Count: 3

Published in:

	· Journal
	ACM Transactions on Algorithms (TALG) TALG Homepage archive
	Volume 6 Issue 1, December 2009 Article No. 10 ACM New York, NY, USA table of contents doi>10.1145/1644015.1644025

Tools and Resources

Buy this Article
Request Permissions
TOC Service:
- Email
- RSS
Save to Binder
Export Formats:
- BibTeX
- EndNote
- ACM Ref

Share:

|

Tags: algorithms combinatorial algorithms competitive analysis deadline scheduling online algorithms power saving sequencing and scheduling speed scaling theory

Feedback | Switch to single page view (no tabs)

**Javascript is not enabled and is required for the "tabbed view" or switch to the single page view**

Powered by

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage Privacy Policy Code of Ethics Contact Us

Useful downloads:

Adobe Acrobat

QuickTime

Windows Media Player

Real Player

The ACM Guide to Computing Literature

All Tags

Export Formats

Save to Binder