dc.contributor.advisor |
Li, Fe |
|
dc.contributor.author |
Zhang, Zhi
|
|
dc.creator |
Zhang, Zhi |
|
dc.date |
2013-08 |
|
dc.date.accessioned |
2013-08-20T15:21:42Z |
|
dc.date.available |
2014-09-02T15:34:45Z |
|
dc.date.issued |
2013-08-20 |
|
dc.identifier.uri |
https://hdl.handle.net/1920/8374 |
|
dc.description.abstract |
Scheduling problems consider allocating limited resources under constraints among competing requests in order to fulfill their obligations. Practical resource management algorithms with provable performance guarantees are of great importance. In this dissertation, we study scheduling algorithms for resource management in networked systems. Mainly, we design, analyze, and implement two types of scheduling algorithms: (1) throughput-aware scheduling algorithms, and (2) energy-aware scheduling algorithms. |
|
dc.language.iso |
en_US |
en_US |
dc.rights |
Copyright 2013 Zhi Zhang |
en_US |
dc.subject |
online scheduling algorithms |
en_US |
dc.subject |
throughput-aware scheduling algorithms |
en_US |
dc.subject |
competitive analysis |
en_US |
dc.subject |
energy-aware scheduling algorithms |
en_US |
dc.subject |
networked systems |
en_US |
dc.title |
Scheduling Algorithms Optimizing Throughput and Energy for Networked Systems |
en_US |
dc.type |
Dissertation |
en |
dc.description.note |
This work is embargoed by the author and will not be available until September 2014. |
en_US |
thesis.degree.name |
PhD in Computer Science |
en_US |
thesis.degree.level |
Doctoral |
en |
thesis.degree.discipline |
Computer Science |
en |
thesis.degree.grantor |
George Mason University |
en |