<?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-19T21:42:29Z</responseDate>
  <request identifier="oai:www.ideals.illinois.edu:2142/24039" metadataPrefix="etdms" verb="GetRecord">https://www.ideals.illinois.edu/oai-pmh</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:www.ideals.illinois.edu:2142/24039</identifier>
        <datestamp>2023-07-10</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:contributor>Torrellas, Josep</dc:contributor>
          <dc:creator>Agarwal, Rishi</dc:creator>
          <dc:date>2011-05-25T15:07:06Z</dc:date>
          <dc:date>2011-05-25T15:07:06Z</dc:date>
          <dc:date>2011-05-25T15:07:06Z</dc:date>
          <dc:date>2011-05</dc:date>
          <dc:description>As we move to large manycores, the hardware-based global checkpointing schemes that have
been proposed for small shared-memory machines do not scale. Scalability barriers include global
operations, work lost to global rollback, and inefficiencies in imbalanced or I/O-intensive loads.
Scalable checkpointing requires tracking inter-thread dependences and building the checkpoint
and rollback operations around dynamic groups of communicating processors.
To address this problem, this paper introduces Rebound, the first hardware-based scheme for co-
ordinated local checkpointing in multiprocessors with directory-based cache coherence. Rebound
leverages the transactions of a directory protocol to track inter-thread dependences. In addition, it
boosts checkpointing efficiency by: (i) delaying the writeback of data to safe memory at check-
points, (ii) supporting operation with multiple checkpoints, and (iii) optimizing checkpointing at
barrier synchronization. Finally, Rebound introduces distributed algorithms for checkpointing and
rollback sets of processors. Simulations of parallel programs with up to 64 threads show that Re-
bound is scalable and has very low overhead. For 64 processors, its average performance overhead
is only 2%, compared to 15% for global checkpointing.</dc:description>
          <dc:description>Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2011-04-25T18:48:52Z
Item was in collections:
University of Illinois Theses &amp; Dissertations (ID: 1)
No. of bitstreams: 1
Agarwal_Rishi.pdf: 284155 bytes, checksum: af9d80322eb3597f5165ec0ce53f3c68 (MD5)</dc:description>
          <dc:description>Made available in DSpace on 2011-05-25T15:07:06Z (GMT). No. of bitstreams: 2
Agarwal_Rishi.pdf: 284155 bytes, checksum: af9d80322eb3597f5165ec0ce53f3c68 (MD5)
license.txt: 4063 bytes, checksum: d32f7c3e2a2ffebf8eea929a95839206 (MD5)</dc:description>
          <dc:identifier>http://hdl.handle.net/2142/24039</dc:identifier>
          <dc:language>en</dc:language>
          <dc:rights>Copyright 2011 Rishi Agarwal</dc:rights>
          <dc:subject>Scalable Checkpointing</dc:subject>
          <dc:subject>Shared-Memory Multiprocessors</dc:subject>
          <dc:subject>Faults</dc:subject>
          <dc:title>Rebound: Scalable checkpointing for coherent shared memory</dc:title>
          <degree>
            <department>Computer Science</department>
            <departmentCode>1434</departmentCode>
            <discipline>Computer Science</discipline>
            <disciplineCode>0112</disciplineCode>
            <grantor>University of Illinois at Urbana-Champaign</grantor>
            <level>Thesis</level>
            <name>M.S.</name>
            <program>MS:Computer Science -UIUC</program>
            <programCode>10KS0112MS</programCode>
          </degree>
        </thesis>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
