{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/71975"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/71975","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Resource Management for Distributed Memory Multicomputers","abstract":"In this thesis we explore the problem of resource management for multicomputer systems. A variety of algorithms were developed for different task graph models. We first present a suite of static resource management algorithms. For acyclic graphs, the LAST algorithm provides fast processor allocation and intelligent processor usage. For nondeterministic task graphs, the remap algorithm uses profiling data to iteratively improve the allocation decisions. The remap algorithm provides an efficient, distributed implementation with each processor analyzing the tasks assigned to it. Finally, the template strategy provided a static allocation to dynamic tree-based flow graphs.","abstract_html":"In this thesis we explore the problem of resource management for multicomputer systems. A variety of algorithms were developed for different task graph models. We first present a suite of static resource management algorithms. For acyclic graphs, the LAST algorithm provides fast processor allocation and intelligent processor usage. For nondeterministic task graphs, the remap algorithm uses profiling data to iteratively improve the allocation decisions. The remap algorithm provides an efficient, distributed implementation with each processor analyzing the tasks assigned to it. Finally, the template strategy provided a static allocation to dynamic tree-based flow graphs.","abstract_has_math":false,"creators":["Baxter, Jeffrey John"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Electrical Engineering","degree_department":null,"school":null,"contributors":["Patel, Janak H."],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2014,"date_issued":"2014-12-16T22:22:56Z","date_published":"2014-12-16T22:22:56Z","updated_at":"2026-07-22T22:26:05Z","subjects":["Engineering, Electronics and Electrical","Computer Science"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["(UMI)AAI9305464"],"render_values":[{"text":"(UMI)AAI9305464","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/71975","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Patel, Janak H."]},{"key":"dc:creator","label":"Author","values":["Baxter, Jeffrey John"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2014-12-16T22:22:56Z","10000-01-01","1992"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Electrical Engineering"]},{"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":["Engineering, Electronics and Electrical","Computer Science"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/71975","(UMI)AAI9305464"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["In this thesis we explore the problem of resource management for multicomputer systems. A variety of algorithms were developed for different task graph models. We first present a suite of static resource management algorithms. For acyclic graphs, the LAST algorithm provides fast processor allocation and intelligent processor usage. For nondeterministic task graphs, the remap algorithm uses profiling data to iteratively improve the allocation decisions. The remap algorithm provides an efficient, distributed implementation with each processor analyzing the tasks assigned to it. Finally, the template strategy provided a static allocation to dynamic tree-based flow graphs.","Next we developed the concept of hybrid resource management, combining static and dynamic strategies. Profiling-based migration uses a migration algorithm to address runtime load imbalances for nondeterministic task costs. The algorithm uses profiled data to make migration decisions with data strictly local to each processor. For dynamic flow graphs, we developed two hybrid resource management techniques, t$\\sb-$hybrid, and hybrid2. The t$\\sb-$hybrid strategy is a decoupled hybrid strategy, where the static and dynamic portions of the management operate independently from one another. In the hybrid2 strategy, a coupled hybrid strategy, decisions in one strategy affect decisions taken in the other strategy.","Made available in DSpace on 2014-12-16T22:22:56Z (GMT). No. of bitstreams: 1 9305464.pdf: 7467541 bytes, checksum: cdbfa35b6b7ad89c318f0e9e21b9423b (MD5) Previous issue date: 1992","Embargo set by: Seth Robbins for item 72141 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","203 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1992."]},{"key":"dc:title","label":"Title","values":["Resource Management for Distributed Memory Multicomputers"]}]}],"canonical_facts":{"dc:contributor":["Patel, Janak H."],"dc:creator":["Baxter, Jeffrey John"],"dc:date":["2014-12-16T22:22:56Z","10000-01-01","1992"],"dc:description":["In this thesis we explore the problem of resource management for multicomputer systems. A variety of algorithms were developed for different task graph models. We first present a suite of static resource management algorithms. For acyclic graphs, the LAST algorithm provides fast processor allocation and intelligent processor usage. For nondeterministic task graphs, the remap algorithm uses profiling data to iteratively improve the allocation decisions. The remap algorithm provides an efficient, distributed implementation with each processor analyzing the tasks assigned to it. Finally, the template strategy provided a static allocation to dynamic tree-based flow graphs.","Next we developed the concept of hybrid resource management, combining static and dynamic strategies. Profiling-based migration uses a migration algorithm to address runtime load imbalances for nondeterministic task costs. The algorithm uses profiled data to make migration decisions with data strictly local to each processor. For dynamic flow graphs, we developed two hybrid resource management techniques, t$\\sb-$hybrid, and hybrid2. The t$\\sb-$hybrid strategy is a decoupled hybrid strategy, where the static and dynamic portions of the management operate independently from one another. In the hybrid2 strategy, a coupled hybrid strategy, decisions in one strategy affect decisions taken in the other strategy.","Made available in DSpace on 2014-12-16T22:22:56Z (GMT). No. of bitstreams: 1 9305464.pdf: 7467541 bytes, checksum: cdbfa35b6b7ad89c318f0e9e21b9423b (MD5) Previous issue date: 1992","Embargo set by: Seth Robbins for item 72141 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","203 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1992."],"dc:identifier":["http://hdl.handle.net/2142/71975","(UMI)AAI9305464"],"dc:subject":["Engineering, Electronics and Electrical","Computer Science"],"dc:title":["Resource Management for Distributed Memory Multicomputers"],"dc:type":["text"],"thesis:degree_discipline":["Electrical Engineering"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Ph.D."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:26:05Z"}