<?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-23T07:56:15Z</responseDate>
  <request identifier="813" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:813</identifier>
        <datestamp>2024-03-06T10:28:18Z</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>Analysis of Memory Latencies in Multi-Processor Systems</dc:title>
          <dc:creator>Stachulat, Jan</dc:creator>
          <dc:creator>Schliecker, Simon</dc:creator>
          <dc:creator>Ivers, Matthias</dc:creator>
          <dc:creator>Ernst, Rolf</dc:creator>
          <dc:subject>Multi-processor Performance Analysis</dc:subject>
          <dc:subject>Memory Access Latency</dc:subject>
          <dc:subject>Worst Case Execution Time</dc:subject>
          <dc:description>Predicting timing behavior is key to efficient embedded&#13;
real-time system design and verification. Current approaches&#13;
to determine end-to-end latencies in parallel heterogeneous&#13;
architectures focus on performance analysis either&#13;
on task or system level. Especially memory accesses,&#13;
basic operations of embedded application, cannot be accurately&#13;
captured on a single level alone: While task level&#13;
methods simplify system behavior, system level methods&#13;
simplify task behavior. Both perspectives lead to overly pessimistic&#13;
estimations.&#13;
To tackle these complex interactions we integrate task&#13;
and system level analysis. Each analysis level is provided&#13;
with the necessary data to allow precise computations,&#13;
while adequate abstraction prevents high time complexity.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Jan Stachulat and Simon Schliecker and Matthias Ivers and Rolf Ernst</dc:contributor>
          <dc:date>2007</dc:date>
          <dc:relation>Is Part Of OASIcs, Volume 1, 5th International Workshop on Worst-Case Execution Time Analysis (WCET'05) (2007)</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/OASIcs.WCET.2005.813</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-8130</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.WCET.2005.813</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
