Mason Archival Repository Service

Scheduling Algorithms Optimizing Throughput and Energy for Networked Systems

Show simple item record

dc.contributor.advisor Li, Fe Zhang, Zhi
dc.creator Zhang, Zhi 2013-08 2013-08-20T15:21:42Z 2014-09-02T15:34:45Z 2013-08-20
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 PhD in Computer Science en_US Doctoral en Computer Science en George Mason University en

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search MARS


My Account