<?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-19T03:40:50Z</responseDate>
  <request identifier="oai:www.ideals.illinois.edu:2142/45276" metadataPrefix="etdms" verb="GetRecord">https://www.ideals.illinois.edu/oai-pmh</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:www.ideals.illinois.edu:2142/45276</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>Vaidya, Nitin H.</dc:contributor>
          <dc:creator>Lin, Philbert</dc:creator>
          <dc:date>2013-08-22T16:34:24Z</dc:date>
          <dc:date>2013-08-22T16:34:24Z</dc:date>
          <dc:date>2013-08</dc:date>
          <dc:date>2013-08-22T16:34:24Z</dc:date>
          <dc:date>2013-08</dc:date>
          <dc:description>Recent work in replicated datastores has focused on making availability and low latency the primary requirements. We present two directory-based data- stores which make strong application semantics a primary requirement based on ideas from cache coherence in multiprocessors and distributed shared memory. The two datastores are implemented and evaluated against the Apache Cassandra distributed datastore in a simulated geo-distributed envi- ronment with workloads generated by the Yahoo! Cloud Serving Benchmark. We find that while there are cases where our systems perform with better average latency, the variability in the request latencies is undesirable due to expensive synchronization operations.</dc:description>
          <dc:description>Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2013-06-17T22:02:24Z
Item was in collections:
University of Illinois Theses &amp; Dissertations (ID: 1)
No. of bitstreams: 1
Lin_Philbert.pdf: 1219235 bytes, checksum: ce44e483d0f12256be2f2f18be2576fb (MD5)</dc:description>
          <dc:description>Made available in DSpace on 2013-08-22T16:34:24Z (GMT). No. of bitstreams: 2
Philbert_Lin.pdf: 1219235 bytes, checksum: ce44e483d0f12256be2f2f18be2576fb (MD5)
license.txt: 4060 bytes, checksum: 7fca32af9b0202379e9f10af041b3955 (MD5)</dc:description>
          <dc:identifier>http://hdl.handle.net/2142/45276</dc:identifier>
          <dc:language>en</dc:language>
          <dc:rights>Copyright 2013 Philbert Lin</dc:rights>
          <dc:subject>Replicated datastorage</dc:subject>
          <dc:subject>Distributed Systems</dc:subject>
          <dc:title>A lazy directory-based implementation of consistent replicated storage</dc:title>
          <dc:type>text</dc:type>
          <degree>
            <department>Electrical &amp; Computer Eng</department>
            <departmentCode>1933</departmentCode>
            <discipline>Electrical &amp; Computer Engr</discipline>
            <disciplineCode>1200</disciplineCode>
            <grantor>University of Illinois at Urbana-Champaign</grantor>
            <level>Thesis</level>
            <name>M.S.</name>
            <program>MS:Electr &amp; Computer Eng-UIUC</program>
            <programCode>10KS1200MS</programCode>
          </degree>
        </thesis>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
