|Institution:||George Mason University|
|Keywords:||online scheduling algorithms; throughput-aware scheduling algorithms; competitive analysis; energy-aware scheduling algorithms; networked systems|
|Full text PDF:||http://hdl.handle.net/1920/8374|
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.