<?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-19T15:47:07Z</responseDate>
  <request identifier="oai:www.ideals.illinois.edu:2142/81347" metadataPrefix="etdms" verb="GetRecord">https://www.ideals.illinois.edu/oai-pmh</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:www.ideals.illinois.edu:2142/81347</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>Polychronopoulos, Constantine D.</dc:contributor>
          <dc:creator>Dimitriou, Georgios</dc:creator>
          <dc:date>2015-09-25T20:10:40Z</dc:date>
          <dc:date>2015-09-25T20:10:40Z</dc:date>
          <dc:date>10000-01-01</dc:date>
          <dc:date>2000</dc:date>
          <dc:date>2000</dc:date>
          <dc:description>We tested MSWP on a Coral 2000 simulator, using several synthetic and SPEC benchmarks. The results we obtained encourage us to continue our research. In particular, we obtained speedups of up to 30% with respect to highly optimized superblock-based schedules on loops with unpredictable branches. We also obtained a speedup of up to 15% on perl, a highly sequential SPEC95 benchmark, utilizing task-level speculation in an attempt to increase the available instruction-level parallelism.</dc:description>
          <dc:description>Made available in DSpace on 2015-09-25T20:10:40Z (GMT). No. of bitstreams: 2
license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5)
9989980.pdf: 11919804 bytes, checksum: f907dfa6a5df227b2b7387223f16866a (MD5)
  Previous issue date: 2000</dc:description>
          <dc:description>Embargo set by: Seth Robbins for item 82628
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>226 p.</dc:description>
          <dc:description>Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2000.</dc:description>
          <dc:identifier>http://hdl.handle.net/2142/81347</dc:identifier>
          <dc:identifier>(MiAaPQ)AAI9989980</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:subject>Engineering, Electronics and Electrical</dc:subject>
          <dc:title>Loop Scheduling for Multithreaded Processors</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>
