Scheduling Algorithms Optimizing Throughput and Energy for Networked Systems

Simple item page
dc.contributor.advisorLi, Fe
dc.contributor.authorZhang, Zhi
dc.creatorZhang, Zhi
dc.date2013-08
dc.date.accessioned2013-08-20T15:21:42Z
dc.date.available2014-09-02T15:34:45Z
dc.date.issued2013-08-20
dc.description.abstractScheduling 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.description.noteThis work is embargoed by the author and will not be available until September 2014.
dc.identifier.urihttps://hdl.handle.net/1920/8374
dc.language.isoen_US
dc.rightsCopyright 2013 Zhi Zhang
dc.subjectOnline scheduling algorithms
dc.subjectThroughput-aware scheduling algorithms
dc.subjectCompetitive analysis
dc.subjectEnergy-aware scheduling algorithms
dc.subjectNetworked systems
dc.titleScheduling Algorithms Optimizing Throughput and Energy for Networked Systems
dc.typeDissertation
thesis.degree.disciplineComputer Science
thesis.degree.grantorGeorge Mason University
thesis.degree.levelDoctoral
thesis.degree.namePhD in Computer Science

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Zhang_gmu_0883E_10399.pdf
Size:
1.96 MB
Format:
Adobe Portable Document Format
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.65 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

College of Engineering and Computing