<?xml version="1.0" encoding="utf-8"?>
<TEI xmlns="http://www.tei-c.org/ns/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:hal="http://hal.archives-ouvertes.fr/" xmlns:gml="http://www.opengis.net/gml/3.3/" xmlns:gmlce="http://www.opengis.net/gml/3.3/ce" version="1.1" xsi:schemaLocation="http://www.tei-c.org/ns/1.0 http://api.archives-ouvertes.fr/documents/aofr-sword.xsd">
  <teiHeader>
    <fileDesc>
      <titleStmt>
        <title>HAL TEI export of hal-00544444</title>
      </titleStmt>
      <publicationStmt>
        <distributor>CCSD</distributor>
        <availability status="restricted">
          <licence target="https://creativecommons.org/publicdomain/zero/1.0/">CC0 1.0 - Universal</licence>
        </availability>
        <date when="2026-05-22T14:22:35+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">The Fully Polynomial-Time Approximation Scheme for Feasibility Analysis in Static-Priority Systems with Arbitrary Relative Deadlines Revisited</title>
            <author role="aut">
              <persName>
                <forename type="first">Thi Huyen Chau</forename>
                <surname>Nguyen</surname>
              </persName>
              <email type="md5">5f4e39db8e2995677a5104c57d198343</email>
              <email type="domain">ensma.fr</email>
              <idno type="idhal" notation="numeric">888580</idno>
              <idno type="halauthorid" notation="string">362781-888580</idno>
              <affiliation ref="#struct-24191"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Pascal</forename>
                <surname>Richard</surname>
              </persName>
              <email type="md5">d47325f1eb3a20c7629586e9367c1917</email>
              <email type="domain">ensma.fr</email>
              <idno type="idhal" notation="string">pascal-richard</idno>
              <idno type="idhal" notation="numeric">855233</idno>
              <idno type="halauthorid" notation="string">147712-855233</idno>
              <idno type="IDREF">https://www.idref.fr/07333930X</idno>
              <idno type="VIAF">https://viaf.org/viaf/3654650</idno>
              <idno type="ORCID">https://orcid.org/0000-0003-0061-1971</idno>
              <idno type="ORCID">https://orcid.org/0009-0007-8225-3368</idno>
              <affiliation ref="#struct-24191"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Nathan</forename>
                <surname>Fisher</surname>
              </persName>
              <email type="md5">809a80014c71e275f20bf249910df4f7</email>
              <email type="domain">cs.wayne.edu</email>
              <idno type="idhal" notation="numeric">865618</idno>
              <idno type="halauthorid" notation="string">433537-865618</idno>
              <affiliation ref="#struct-105702"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Christine</forename>
                <surname>ROCHANGE</surname>
              </persName>
              <email type="md5">d42f08657c6c92964bbdf0be603a089d</email>
              <email type="domain">univ-tlse3.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2010-12-08 10:43:38</date>
              <date type="whenWritten">2010-11-04</date>
              <date type="whenModified">2024-11-23 03:10:56</date>
              <date type="whenReleased">2010-12-08 12:05:02</date>
              <date type="whenProduced">2010-11-04</date>
              <date type="whenEndEmbargoed">2010-12-08</date>
              <ref type="file" target="https://hal.science/hal-00544444v1/document">
                <date notBefore="2010-12-08"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://hal.science/hal-00544444v1/file/rtns2010_nguyen.pdf" id="file-544444-471633">
                <date notBefore="2010-12-08"/>
              </ref>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="888837">
                <persName>
                  <forename>Christine</forename>
                  <surname>ROCHANGE</surname>
                </persName>
                <email type="md5">d42f08657c6c92964bbdf0be603a089d</email>
                <email type="domain">univ-tlse3.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-00544444</idno>
            <idno type="halUri">https://hal.science/hal-00544444</idno>
            <idno type="halBibtex">nguyen:hal-00544444</idno>
            <idno type="halRefHtml">&lt;i&gt;18th International Conference on Real-Time and Network Systems&lt;/i&gt;, Nov 2010, Toulouse, France. pp.21-30</idno>
            <idno type="halRef">18th International Conference on Real-Time and Network Systems, Nov 2010, Toulouse, France. pp.21-30</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-544444-471633"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="UNIV-POITIERS">Université de Poitiers</idno>
            <idno type="stamp" n="ENSMA">Ecole Nationale Supérieure de Mécanique et d'Aérotechnique</idno>
            <idno type="stamp" n="RTNS2010">RTNS 2010 - 18th International Conference on Real-Time and Network Systems</idno>
            <idno type="stamp" n="LIAS">Laboratoire d'Informatique et d'Automatique pour les Systèmes</idno>
            <idno type="stamp" n="ISAE-ENSMA">École nationale supérieure de mécanique et d’aérotechnique</idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="2">International</note>
            <note type="invited" n="0">No</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
            <note type="proceedings" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">The Fully Polynomial-Time Approximation Scheme for Feasibility Analysis in Static-Priority Systems with Arbitrary Relative Deadlines Revisited</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Thi Huyen Chau</forename>
                    <surname>Nguyen</surname>
                  </persName>
                  <email type="md5">5f4e39db8e2995677a5104c57d198343</email>
                  <email type="domain">ensma.fr</email>
                  <idno type="idhal" notation="numeric">888580</idno>
                  <idno type="halauthorid" notation="string">362781-888580</idno>
                  <affiliation ref="#struct-24191"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Pascal</forename>
                    <surname>Richard</surname>
                  </persName>
                  <email type="md5">d47325f1eb3a20c7629586e9367c1917</email>
                  <email type="domain">ensma.fr</email>
                  <idno type="idhal" notation="string">pascal-richard</idno>
                  <idno type="idhal" notation="numeric">855233</idno>
                  <idno type="halauthorid" notation="string">147712-855233</idno>
                  <idno type="IDREF">https://www.idref.fr/07333930X</idno>
                  <idno type="VIAF">https://viaf.org/viaf/3654650</idno>
                  <idno type="ORCID">https://orcid.org/0000-0003-0061-1971</idno>
                  <idno type="ORCID">https://orcid.org/0009-0007-8225-3368</idno>
                  <affiliation ref="#struct-24191"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Nathan</forename>
                    <surname>Fisher</surname>
                  </persName>
                  <email type="md5">809a80014c71e275f20bf249910df4f7</email>
                  <email type="domain">cs.wayne.edu</email>
                  <idno type="idhal" notation="numeric">865618</idno>
                  <idno type="halauthorid" notation="string">433537-865618</idno>
                  <affiliation ref="#struct-105702"/>
                </author>
              </analytic>
              <monogr>
                <title level="m">Proceedings of the 18th International Conference on Real-Time and Network Systems</title>
                <meeting>
                  <title>18th International Conference on Real-Time and Network Systems</title>
                  <date type="start">2010-11-04</date>
                  <date type="end">2010-11-05</date>
                  <settlement>Toulouse</settlement>
                  <country key="FR">France</country>
                </meeting>
                <imprint>
                  <biblScope unit="pp">21-30</biblScope>
                  <date type="datePub">2010-11-04</date>
                </imprint>
              </monogr>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <classCode scheme="halDomain" n="info.info-es">Computer Science [cs]/Embedded Systems</classCode>
              <classCode scheme="halTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halOldTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halTreeTypology" n="COMM">Conference papers</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>We consider sporadic tasks with static priorities and arbitrary deadlines to be executed upon a uniprocessor platform. Pseudo-polynomial time algorithms are known for computing worst-case response times for this task model. Fisher and Baruah proposed in 2005 an approximate feasibility test running in polynomial time according to an accuracy parameter $\epsilon$ (i.e., approximation scheme or \FPTAS). We show that this algorithm is valid for the Rate Monotonic scheduling policy, but must be slightly modified to be applicable for arbitrary priority assignment. We also introduce some improvements to achieve a higher efficiency. We illustrate the improved algorithm on a detailed example.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="laboratory" xml:id="struct-24191" status="OLD">
          <idno type="ISNI">0000000088690077</idno>
          <idno type="RNSR">199213397B</idno>
          <orgName>Laboratoire d'informatique scientifique et industrielle [EA 1232]</orgName>
          <orgName type="acronym">LISI [Poitiers]</orgName>
          <date type="start">1982-01-01</date>
          <date type="end">2011-12-31</date>
          <desc>
            <address>
              <addrLine>Téléport 2 1 avenue Clément Ader BP 40109 86961 Futuroscope Chasseneuil cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.lisi.ensma.fr</ref>
          </desc>
          <listRelation>
            <relation name="EA 1232" active="#struct-54493" type="direct"/>
            <relation name="EA 1232" active="#struct-300463" type="direct"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-105702" status="VALID">
          <orgName>Department of computer science [Detroit]</orgName>
          <desc>
            <address>
              <addrLine>Department of Computer Science Wayne State University</addrLine>
              <country key="US"/>
            </address>
            <ref type="url">http://www.cs.wayne.edu/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-301045" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-54493" status="VALID">
          <idno type="IdRef">026403765</idno>
          <idno type="ISNI">0000000121606368</idno>
          <idno type="ROR">https://ror.org/04xhy8q59</idno>
          <idno type="Wikidata">Q661056</idno>
          <orgName>Université de Poitiers =  University of Poitiers</orgName>
          <orgName type="acronym">UP</orgName>
          <desc>
            <address>
              <addrLine>15, rue de l'Hôtel Dieu - 86034 Poitiers Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.univ-poitiers.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-300463" status="VALID">
          <idno type="IdRef">028024400</idno>
          <idno type="ROR">https://ror.org/04jx68594</idno>
          <orgName>École Nationale Supérieure de Mécanique et d’Aérotechnique [Poitiers]</orgName>
          <orgName type="acronym">ISAE-ENSMA</orgName>
          <desc>
            <address>
              <addrLine>Téléport 2 – 1 avenue Clément AderBP 4010986961 Futuroscope Chasseneuil Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.ensma.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-301045" status="VALID">
          <idno type="ISNI">0000 0001 1456 7807</idno>
          <idno type="ROR">https://ror.org/01070mq45</idno>
          <orgName>Wayne State University [Detroit]</orgName>
          <desc>
            <address>
              <addrLine>Detroit, Michigan, United States</addrLine>
              <country key="US"/>
            </address>
            <ref type="url">https://wayne.edu/</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>