This item is only available for download by members of the University of Illinois community. Students, faculty, and staff at the U of I may log in with your NetID and password to view the item. If you are trying to access an Illinois-restricted dissertation or thesis, you can request a copy through your library's Inter-Library Loan office or purchase a copy directly from ProQuest.
Permalink
https://hdl.handle.net/2142/69526
Description
Title
Task Assignment in Distributed Systems
Author(s)
Lo, Virginia Mary
Issue Date
1983
Department of Study
Computer Science
Discipline
Computer Science
Degree Granting Institution
University of Illinois at Urbana-Champaign
Degree Name
Ph.D.
Degree Level
Dissertation
Keyword(s)
Computer Science
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.
Use this login method if you
don't
have an
@illinois.edu
email address.
(Oops, I do have one)
IDEALS migrated to a new platform on June 23, 2022. If you created
your account prior to this date, you will have to reset your password
using the forgot-password link below.
