Theses and Dissertations from UMD >
UMD Theses and Dissertations >
Please use this identifier to cite or link to this item:
|Title: ||Resource Allocation in Networked and Distributed Environments|
|Authors: ||Parthasarathy, Srinivasan|
|Advisors: ||Srinivasan, Aravind|
|Department/Program: ||Computer Science|
|Sponsors: ||Digital Repository at the University of Maryland|
University of Maryland (College Park, Md.)
|Keywords: ||Computer Science (0984)|
combinatorial optimization, randomization, approximation algorithms, parallel scheduling, wireless communication, wireless capacity
|Issue Date: ||30-Aug-2006|
|Abstract: ||A central challenge in networked and distributed systems is resource management: how can we partition the available resources in the system across competing users, such that individual users are satisfied and certain system-wide objectives of interest are optimized? In this thesis, we deal with many such fundamental and practical resource allocation problems that arise in networked and distributed environments. We invoke two sophisticated paradigms -- linear programming and probabilistic methods -- and develop <em>provably-good approximation algorithms</em> for a diverse collection of applications. Our main contributions are as follows.
Assignment problems: An assignment problem involves a collection of objects and locations, and a load value associated with each object-location pair. Our goal is to assign the objects to locations while minimizing various cost functions of the assignment. This setting models many applications in manufacturing, parallel processing, distributed storage, and wireless networks. We present a <em>single</em> algorithm for assignment which generalizes many classical assignment schemes known in the literature. Our scheme is derived through a fusion of linear algebra and randomization. In conjunction with other ideas, it leads to novel guarantees for multi-criteria parallel scheduling, broadcast scheduling, and social network modeling.
Precedence constrained scheduling: We consider two precedence constrained scheduling problems, namely sweep scheduling and tree scheduling, which are inspired by emerging applications in high performance computing. Through a careful use of randomization, we devise the first approximation algorithms for these problems with near-optimal performance guarantees.
Wireless communication: Wireless networks are prone to interference. This prohibits proximate network nodes from transmitting simultaneously, and introduces fundamental challenges in the design of wireless communication protocols. We develop fresh geometric insights for characterizing wireless interference. We combine our geometric analysis with linear programming and randomization, to derive near-optimal algorithms for latency minimization and throughput capacity estimation in wireless networks.
In summary, the innovative use of linear programming and probabilistic techniques for resource allocation, and the novel ways of connecting them with application-specific ideas is the pivotal theme and the focal point of this thesis.|
|Appears in Collections:||UMD Theses and Dissertations|
Computer Science Theses and Dissertations
All items in DRUM are protected by copyright, with all rights reserved.