{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/21154"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/21154","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Empirical study of load distribution strategies on multicomputers","abstract":"In this thesis, we examine an important issue in the execution of parallel programs on multicomputers. We consider parallel programs that consist of dynamically created tasks. These tasks communicate via message passing. The important issue is: how to assign the tasks of a parallel program on multicomputer nodes, such that the program execution time is minimal. This is but one facet of the class of resource allocation problems known as load distribution.","abstract_html":"In this thesis, we examine an important issue in the execution of parallel programs on multicomputers. We consider parallel programs that consist of dynamically created tasks. These tasks communicate via message passing. The important issue is: how to assign the tasks of a parallel program on multicomputer nodes, such that the program execution time is minimal. This is but one facet of the class of resource allocation problems known as load distribution.","abstract_has_math":false,"creators":["Nazief, Bobby Achirul Awal"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Reed, Daniel"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2011,"date_issued":"2011-05-07T12:59:56Z","date_published":"2011-05-07T12:59:56Z","updated_at":"2026-07-22T22:25:17Z","subjects":["Computer Science"],"languages":["eng"],"rights":["Copyright 1991 Nazief, Bobby Achirul Awal"],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["AAI9210934","(UMI)AAI9210934"],"render_values":[{"text":"AAI9210934","href":null,"code":true},{"text":"(UMI)AAI9210934","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/21154","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Reed, Daniel"]},{"key":"dc:creator","label":"Author","values":["Nazief, Bobby Achirul Awal"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2011-05-07T12:59:56Z","10000-01-01","1991"]},{"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":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 1991 Nazief, Bobby Achirul Awal"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["AAI9210934","(UMI)AAI9210934","http://hdl.handle.net/2142/21154"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["In this thesis, we examine an important issue in the execution of parallel programs on multicomputers. We consider parallel programs that consist of dynamically created tasks. These tasks communicate via message passing. The important issue is: how to assign the tasks of a parallel program on multicomputer nodes, such that the program execution time is minimal. This is but one facet of the class of resource allocation problems known as load distribution.","We have identified two groups of load distribution strategies on multicomputers. The first contains task placement strategies that assign newly created tasks to nodes. Once a task starts executing, it cannot be reassigned to a different node. The second group contains task migration strategies that manage initial task placement, and potential task relocation. Tasks may now be relocated to different nodes even after they have begun execution. To determine the performance of these strategies, we must study their behavior for a given range of machine architectures and a set of computational models.","In this thesis, we study the behavior of task placement and task migration strategies on multicomputers by comparing their static and dynamic performance through parametric simulations. In particular, we study the interaction between task placement strategies and parallel programs under different hardware and machine architectures. We also study whether task migration strategies can improve the performance obtained by task placement strategies alone. Because the cost of task migration may potentially be more expensive than that of task placement, we also study the possibility of reducing the task migration overhead.","Made available in DSpace on 2011-05-07T12:59:56Z (GMT). No. of bitstreams: 2 license.txt: 4922 bytes, checksum: 910b249b4beec47e7ab768910c8f966f (MD5) 9210934.pdf: 7541364 bytes, checksum: 01b7613bcfc558db6a8b2b5af7201273 (MD5) Previous issue date: 1991","Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by Howard Ding (hding2@illinois.edu) on 2011-05-07T14:48:51Z Item is restricted indefinitely.","Restriction data tranferred 2014-07-01T11:22:10-05:00 Original Data Group with Access UIUC Users [automated] Release Date: none Reason: ETDs are only available to UIUC Users without author permission","ETDs are only available to UIUC Users without author permission","U of I Only"]},{"key":"dc:title","label":"Title","values":["Empirical study of load distribution strategies on multicomputers"]}]}],"canonical_facts":{"dc:contributor":["Reed, Daniel"],"dc:creator":["Nazief, Bobby Achirul Awal"],"dc:date":["2011-05-07T12:59:56Z","10000-01-01","1991"],"dc:description":["In this thesis, we examine an important issue in the execution of parallel programs on multicomputers. We consider parallel programs that consist of dynamically created tasks. These tasks communicate via message passing. The important issue is: how to assign the tasks of a parallel program on multicomputer nodes, such that the program execution time is minimal. This is but one facet of the class of resource allocation problems known as load distribution.","We have identified two groups of load distribution strategies on multicomputers. The first contains task placement strategies that assign newly created tasks to nodes. Once a task starts executing, it cannot be reassigned to a different node. The second group contains task migration strategies that manage initial task placement, and potential task relocation. Tasks may now be relocated to different nodes even after they have begun execution. To determine the performance of these strategies, we must study their behavior for a given range of machine architectures and a set of computational models.","In this thesis, we study the behavior of task placement and task migration strategies on multicomputers by comparing their static and dynamic performance through parametric simulations. In particular, we study the interaction between task placement strategies and parallel programs under different hardware and machine architectures. We also study whether task migration strategies can improve the performance obtained by task placement strategies alone. Because the cost of task migration may potentially be more expensive than that of task placement, we also study the possibility of reducing the task migration overhead.","Made available in DSpace on 2011-05-07T12:59:56Z (GMT). No. of bitstreams: 2 license.txt: 4922 bytes, checksum: 910b249b4beec47e7ab768910c8f966f (MD5) 9210934.pdf: 7541364 bytes, checksum: 01b7613bcfc558db6a8b2b5af7201273 (MD5) Previous issue date: 1991","Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by Howard Ding (hding2@illinois.edu) on 2011-05-07T14:48:51Z Item is restricted indefinitely.","Restriction data tranferred 2014-07-01T11:22:10-05:00 Original Data Group with Access UIUC Users [automated] Release Date: none Reason: ETDs are only available to UIUC Users without author permission","ETDs are only available to UIUC Users without author permission","U of I Only"],"dc:identifier":["AAI9210934","(UMI)AAI9210934","http://hdl.handle.net/2142/21154"],"dc:language":["eng"],"dc:rights":["Copyright 1991 Nazief, Bobby Achirul Awal"],"dc:subject":["Computer Science"],"dc:title":["Empirical study of load distribution strategies on multicomputers"],"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:25:17Z"}