{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/69526"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/69526","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Task Assignment in Distributed Systems","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.","abstract_html":"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.","abstract_has_math":false,"creators":["Lo, Virginia Mary"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2014,"date_issued":"2014-12-15T19:25:30Z","date_published":"2014-12-15T19:25:30Z","updated_at":"2026-07-22T22:26:01Z","subjects":["Computer Science"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["(UMI)AAI8409989"],"render_values":[{"text":"(UMI)AAI8409989","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/69526","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Lo, Virginia Mary"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2014-12-15T19:25:30Z","10000-01-01","1983"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Computer Science"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/69526","(UMI)AAI8409989"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["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.","Made available in DSpace on 2014-12-15T19:25:30Z (GMT). No. of bitstreams: 1 8409989.pdf: 3868480 bytes, checksum: 9f1269d53ac270278b391b203c706e6e (MD5) Previous issue date: 1983","Embargo set by: Seth Robbins for item 69692 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","140 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1983."]},{"key":"dc:title","label":"Title","values":["Task Assignment in Distributed Systems"]}]}],"canonical_facts":{"dc:creator":["Lo, Virginia Mary"],"dc:date":["2014-12-15T19:25:30Z","10000-01-01","1983"],"dc:description":["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.","Made available in DSpace on 2014-12-15T19:25:30Z (GMT). No. of bitstreams: 1 8409989.pdf: 3868480 bytes, checksum: 9f1269d53ac270278b391b203c706e6e (MD5) Previous issue date: 1983","Embargo set by: Seth Robbins for item 69692 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","140 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1983."],"dc:identifier":["http://hdl.handle.net/2142/69526","(UMI)AAI8409989"],"dc:subject":["Computer Science"],"dc:title":["Task Assignment in Distributed Systems"],"dc:type":["text"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Ph.D."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:26:01Z"}