<?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-21T04:36:37Z</responseDate>
  <request identifier="oai:www.ideals.illinois.edu:2142/19520" metadataPrefix="etdms" verb="GetRecord">https://www.ideals.illinois.edu/oai-pmh</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:www.ideals.illinois.edu:2142/19520</identifier>
        <datestamp>2023-07-10</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>Fuchs, W. Kent</dc:contributor>
          <dc:creator>Wang, Yi-Min</dc:creator>
          <dc:date>2011-05-07T12:10:04Z</dc:date>
          <dc:date>2011-05-07T12:10:04Z</dc:date>
          <dc:date>10000-01-01</dc:date>
          <dc:date>1993</dc:date>
          <dc:description>Checkpointing and rollback recovery are techniques that can provide efficient recovery from transient process failures. In a message-passing system, the rollback of a message sender may cause the rollback of the corresponding receiver, and the system needs to roll back to a consistent set of checkpoints called the recovery line. If the processes are allowed to take uncoordinated checkpoints, the above rollback propagation may result in the domino effect which prevents recovery line progression. Traditionally, only obsolete checkpoints before the global recovery line can be discarded, and the necessary and sufficient condition for identifying all garbage checkpoints has remained an open problem.</dc:description>
          <dc:description>In this thesis, we derive a necessary and sufficient condition for achieving optimal garbage collection, and we prove that the number of useful checkpoints is in fact bounded by N(N + 1)/2 where N is the number of processes. Our approach is based on the maximum-sized antichain model of consistent global checkpoints and the technique of recovery line transformation and decomposition. We also show that, for systems requiring message logging to record in-transit messages, the same approach can be used to achieve optimal message log reclamation. As a final topic, we describe a unifying framework by considering checkpoint coordination and exploiting piecewise determinism as mechanisms for bounding rollback propagation, and demonstrate the applicability of the optimal garbage collection algorithm to domino-free recovery protocols.</dc:description>
          <dc:description>Made available in DSpace on 2011-05-07T12:10:04Z (GMT). No. of bitstreams: 2
license.txt: 4922 bytes, checksum: 910b249b4beec47e7ab768910c8f966f (MD5)
9411816.pdf: 3974481 bytes, checksum: db87f56136818435a243af171b7ebdc0 (MD5)
  Previous issue date: 1993</dc:description>
          <dc:description>Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by Howard Ding (hding2@illinois.edu) on 2011-05-07T14:37:35Z
Item is restricted indefinitely.</dc:description>
          <dc:description>Restriction data tranferred 2014-07-01T11:15:27-05:00
Original Data
Group with Access UIUC Users [automated]
Release Date: none
Reason: ETDs are only available to UIUC Users without author permission</dc:description>
          <dc:description>ETDs are only available to UIUC Users without author permission</dc:description>
          <dc:description>U of I Only</dc:description>
          <dc:identifier>AAI9411816</dc:identifier>
          <dc:identifier>(UMI)AAI9411816</dc:identifier>
          <dc:identifier>http://hdl.handle.net/2142/19520</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>Copyright 1993 Wang, Yi-Min</dc:rights>
          <dc:subject>Engineering, Electronics and Electrical</dc:subject>
          <dc:subject>Computer Science</dc:subject>
          <dc:title>Space reclamation for uncoordinated checkpointing in message-passing systems</dc:title>
          <dc:type>text</dc:type>
          <degree>
            <department>Electrical and Computer 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>
