Skip to Main Content
 

Global Search Box

 
 
 
 

Files

File List


osu1067538505.pdf (1.1 MB)

ETD Abstract Container

Abstract Header

Stability analysis of network-based cooperative resource allocation strategies

Gil, Alvaro E.
http://rave.ohiolink.edu/etdc/view?acc_num=osu1067538505

Abstract Details

2003, Doctor of Philosophy, Ohio State University, Electrical Engineering.
Resource allocation involves deciding how to divide a resource of limited availability across multiple demands in a way that optimizes current objectives (e.g., allocating a processor's computing resources to the demand presented by tasks in order to maximize task completion throughput). In “distributed” resource allocation there are multiple resource types each of which can be subdivided, but then each can only be allocated to a subset of the demands (e.g., in a multiprocessor system where each processor can only process certain task types). In this dissertation we focus on three types of resource allocation problems where via an imperfect communication network multiple agents can share the workload presented by multiple task types. First, we define a model for a network of processors processing task types from buffers and show that they lead to the cumulative demand being bounded by a constant. We demonstrate via simulations when they can be superior to one noncooperative strategy. Second, we model a cooperative control problem for a network of uninhabited autonomous vehicles (UAVs) where it is assumed that before the mission starts a set of tasks is given to a set of UAVs, but then after deployment the UAVs must cooperate to decide which UAV should process each task. We introduce cooperative scheduling of tasks for a set of UAVs where the cooperation must occur over a network that has random but bounded delays. We show how to view this as a cooperative scheduling (resource allocation) problem, and how to derive bounds on mission-level performance metrics for cooperative scheduling methods. Simulations will be used to compare the approach to a noncooperative strategy and to provide design guidelines for the cooperative scheduler. Finally, we introduce an inexpensive laboratory testbed for networked cooperative scheduling strategies. We describe the apparatus, highlight the challenges it presents, and we compare the performance of two scheduling strategies that seek to optimize different objectives. This experiment establishes a basis for future research in networked cooperative scheduling strategies.
Kevin Passino (Advisor)
97 p.
Resource Allocation; Cooperative Control; Scheduling; Communication Networks; Discrete Systems

Recommended Citations

Citations

  • Gil, A. E. (2003). Stability analysis of network-based cooperative resource allocation strategies [Doctoral dissertation, Ohio State University]. OhioLINK Electronic Theses and Dissertations Center. http://rave.ohiolink.edu/etdc/view?acc_num=osu1067538505

    APA Style (7th edition)

  • Gil, Alvaro. Stability analysis of network-based cooperative resource allocation strategies. 2003. Ohio State University, Doctoral dissertation. OhioLINK Electronic Theses and Dissertations Center, http://rave.ohiolink.edu/etdc/view?acc_num=osu1067538505.

    MLA Style (8th edition)

  • Gil, Alvaro. "Stability analysis of network-based cooperative resource allocation strategies." Doctoral dissertation, Ohio State University, 2003. http://rave.ohiolink.edu/etdc/view?acc_num=osu1067538505

    Chicago Manual of Style (17th edition)

osu1067538505
1,482
© 2003, all rights reserved.
This open access ETD is published by The Ohio State University and OhioLINK.