<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet type="text/xsl" href="/oai-pmh.xsl"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-09-19T07:11:04Z</responseDate>
  <request identifier="oai:www.ideals.illinois.edu:2142/71975" metadataPrefix="etdms" verb="GetRecord">https://www.ideals.illinois.edu/oai-pmh</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:www.ideals.illinois.edu:2142/71975</identifier>
        <datestamp>2023-07-11</datestamp>
        <setSpec>col_2142_5131</setSpec>
        <setSpec>col_2142_8888</setSpec>
        <setSpec>com_2142_5130</setSpec>
        <setSpec>com_2142_8887</setSpec>
        <setSpec>com_2142_234</setSpec>
      </header>
      <metadata>
        <thesis xmlns="http://www.ndltd.org/standards/metadata/etdms/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:dc="http://purl.org/dc/elements/1.1/" xsi:schemaLocation="http://www.ndltd.org/standards/metadata/etdms/1.1/ http://www.ndltd.org/standards/metadata/etdms/1.1/etdms11.xsd http://purl.org/dc/elements/1.1/ http://www.ndltd.org/standards/metadata/etdms/1.1/etdmsdc.xsd">
          <dc:contributor>Patel, Janak H.</dc:contributor>
          <dc:creator>Baxter, Jeffrey John</dc:creator>
          <dc:date>2014-12-16T22:22:56Z</dc:date>
          <dc:date>2014-12-16T22:22:56Z</dc:date>
          <dc:date>10000-01-01</dc:date>
          <dc:date>1992</dc:date>
          <dc:date>1992</dc:date>
          <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.</dc:description>
          <dc:description>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.</dc:description>
          <dc:description>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</dc:description>
          <dc:description>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</dc:description>
          <dc:description>Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs</dc:description>
          <dc:description>U of I Only</dc:description>
          <dc:description>203 p.</dc:description>
          <dc:description>Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1992.</dc:description>
          <dc:identifier>http://hdl.handle.net/2142/71975</dc:identifier>
          <dc:identifier>(UMI)AAI9305464</dc:identifier>
          <dc:subject>Engineering, Electronics and Electrical</dc:subject>
          <dc:subject>Computer Science</dc:subject>
          <dc:title>Resource Management for Distributed Memory Multicomputers</dc:title>
          <dc:type>text</dc:type>
          <degree>
            <department>Electrical Engineering</department>
            <discipline>Electrical Engineering</discipline>
            <grantor>University of Illinois at Urbana-Champaign</grantor>
            <level>Dissertation</level>
            <name>Ph.D.</name>
          </degree>
        </thesis>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
