<?xml version="1.0" encoding="UTF-8"?>
<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-07-22T04:11:04Z</responseDate>
  <request identifier="1375" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:1375</identifier>
        <datestamp>2024-03-06T11:07:42Z</datestamp>
        <setSpec>ddc:004</setSpec>
        <setSpec>open_access</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>A Case for Deconstructing Hardware Transactional Memory Systems</dc:title>
          <dc:creator>Hill, Mark D.</dc:creator>
          <dc:creator>Hower, Derek</dc:creator>
          <dc:creator>Moore, Kevin E.</dc:creator>
          <dc:creator>Swift, Michael M.</dc:creator>
          <dc:creator>Volos, Haris</dc:creator>
          <dc:creator>Wood, David A.</dc:creator>
          <dc:subject>Hardware transactional memory</dc:subject>
          <dc:description>Major hardware and software vendors are curious about transactional memory (TM),&#13;
but are understandably cautious about committing to hardware changes.&#13;
&#13;
Our thesis is that deconstructing transactional memory into separate, interchangeable&#13;
components facilitates TM adoption in two ways. First, it aids hardware TM refinement,&#13;
allowing vendors to adopt TM earlier, knowing that they can more easily refine aspects later.&#13;
Second, it enables the components to be applied to other uses, including reliability, security,&#13;
performance, and correctness, providing value even if TM is not widely used. We develop&#13;
some evidence for our thesis via experience with LogTM variants and preliminary case&#13;
studies of scalable watchpoints and race recording for deterministic replay.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Mark D. Hill and Derek Hower and Kevin E. Moore and Michael M. Swift and Haris Volos and David A. Wood</dc:contributor>
          <dc:date>2008</dc:date>
          <dc:relation>Is Part Of Dagstuhl Seminar Proceedings, Volume 7361, Programming Models for Ubiquitous Parallelism (2008)</dc:relation>
          <dc:type>InProceedings</dc:type>
          <dc:type>Text</dc:type>
          <dc:type>doc-type:ResearchArticle</dc:type>
          <dc:type>publishedVersion</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>doi:10.4230/DagSemProc.07361.3</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-13759</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.07361.3</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/4.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
