<?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-19T19:53:30Z</responseDate>
  <request identifier="oai:www.ideals.illinois.edu:2142/78658" metadataPrefix="etdms" verb="GetRecord">https://www.ideals.illinois.edu/oai-pmh</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:www.ideals.illinois.edu:2142/78658</identifier>
        <datestamp>2023-07-11</datestamp>
        <setSpec>col_2142_5131</setSpec>
        <setSpec>col_2142_10761</setSpec>
        <setSpec>com_2142_5130</setSpec>
        <setSpec>com_2142_10755</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:creator>Lu, Yi</dc:creator>
          <dc:date>2015-07-22T22:33:49Z</dc:date>
          <dc:date>2015-07-22T22:33:49Z</dc:date>
          <dc:date>2017-07-23T09:15:38Z</dc:date>
          <dc:date>2015-05</dc:date>
          <dc:date>2015-04-23</dc:date>
          <dc:description>The delay composition theorem, by taking into account the fact that pipeline systems allow concurrent execution, expresses the upper-bounded delay of a real-time task as the sum of two summations, where the first one is linear to the number of stages of the system, and the second one is linear to the number of tasks running on the system. The schedulability analysis based on delay composition theorem performs better than traditional analysis techniques. In this paper we break one assumption that has been hold by previous works on delay composition theorem, namely each task has the same relative priority across all stages. We extend the theorem to pipeline systems running non-preemptive scheduling algorithm which may assign different relative priorities to a task on different stages.</dc:description>
          <dc:description>Submission published under a 24 month embargo labeled 'U of I only', the embargo will last until 2017-05-01</dc:description>
          <dc:description>The student, Yi Lu, accepted the attached license on 2015-04-22 at 15:41.</dc:description>
          <dc:description>The student, Yi Lu, submitted this Thesis for approval on 2015-04-22 at 15:47.</dc:description>
          <dc:description>This Thesis was approved for publication on 2015-04-23 at 14:22.</dc:description>
          <dc:description>DSpace SAF Submission Ingestion Package generated from Vireo submission #8032 on 2015-07-22 at 14:18:39</dc:description>
          <dc:date>2015-5</dc:date>
          <dc:description>Made available in DSpace on 2015-07-22T22:33:49Z (GMT). No. of bitstreams: 2
LU-THESIS-2015.pdf: 499391 bytes, checksum: 9f7d9e76fd2c3ee3b431ed4e5d279286 (MD5)
LICENSE.txt: 4202 bytes, checksum: 73ba1baff29c8bf91b20b7e227425a2d (MD5)
  Previous issue date: 2015-04-23</dc:description>
          <dc:description>Embargo set by: Seth Robbins for item 79899
Lift date: 2017-07-22T22:34:16Z
Reason: Author requested U of Illinois access only (OA after 2yrs) in Vireo ETD system</dc:description>
          <dc:description>U of I Only Restriction Lifted for Item 79899 on 2017-07-23T09:15:38Z.</dc:description>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>http://hdl.handle.net/2142/78658</dc:identifier>
          <dc:language>en</dc:language>
          <dc:rights>Copyright 2015 Yi Lu</dc:rights>
          <dc:subject>real-time scheduling</dc:subject>
          <dc:subject>pipeline systems</dc:subject>
          <dc:title>The delay composition theorem on pipeline systems with non-preemptive priority varying scheduling algorithms</dc:title>
          <dc:type>text</dc:type>
          <dc:type>text</dc:type>
          <degree>
            <department>Computer Science</department>
            <discipline>Computer Science</discipline>
            <grantor>University of Illinois at Urbana-Champaign</grantor>
            <level>Thesis</level>
            <name>M.S.</name>
          </degree>
        </thesis>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
