Files in this item
|(no description provided)|
|Title:||Task Assignment in Distributed Systems|
|Author(s):||Lo, Virginia Mary|
|Department / Program:||Computer Science|
|Degree Granting Institution:||University of Illinois at Urbana-Champaign|
|Abstract:||This thesis addresses the problem of task assignment in distributed systems. A distributed system is defined as any configuration of two or more processors, each with private memory, in which computations utilize the combined resources of the component machines. A distributed process is defined as a set of tasks which together work towards some common goal. Each task spends a portion of its time executing on one of the processors and a portion of its time communicating with other tasks in the distributed process. An assignment of tasks to processors designates one processor for each task to reside on for its lifetime.
We consider five different performance goals (cost functions) and investigate the problem of achieving optimal assignments with respect to each of these functions. In particular, we investigate task assignment to minimize (1) total execution and communication costs, (2) completion time, (3) total execution, communication, and interference costs, (4) total execution and communication costs with bounds on the number of tasks assigned to each processor, and (5) a weighted product of cost functions (1) and (2).
In all cases the problem of finding an optimal assignment for an arbitrary number of processors is found to be NP-complete. This thesis focuses on the development and simulation of suboptimal algorithms and on consideration of special cases for each of the five performance criteria.
Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1983.
|Date Available in IDEALS:||2014-12-15|