Periodic real-time scheduling: from deadline-based model to latency-based model
Identifieur interne : 001100 ( Istex/Corpus ); précédent : 001099; suivant : 001101Periodic real-time scheduling: from deadline-based model to latency-based model
Auteurs : Liliana Cucu ; Nicolas Pernet ; Yves SorelSource :
- Annals of Operations Research [ 0254-5330 ] ; 2008-03-01.
English descriptors
- KwdEn :
Abstract
Abstract: This paper presents a connection between two real-time models: a deadline-based model and a latency-based model. The importance of the latency-based model is proved through a result showing that two deadlines, instead of a latency constraint, over-constrain the real-time applications. Moreover, we give a deadline-marking algorithm based on the relation between deadlines and latency constraints. This algorithm provides non-preemptive feasible schedules for systems with precedence constraints and deadlines, or more complex systems with deadlines and latencies. This is the first step toward non-preemptive schedulability for distributed architectures (without over-constraining the system) like, for example, the automotive applications using protocols such as Controller Area Network (CAN).
Url:
DOI: 10.1007/s10479-007-0279-9
Links to Exploration step
ISTEX:48109A0345C18E0C1B59ABD65E337BFECB9CEC9ALe document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Periodic real-time scheduling: from deadline-based model to latency-based model</title>
<author><name sortKey="Cucu, Liliana" sort="Cucu, Liliana" uniqKey="Cucu L" first="Liliana" last="Cucu">Liliana Cucu</name>
<affiliation><mods:affiliation>LORIA-INPL France, TRIO Team, 615 rue du Jardin Botanique, 54600, Villers les Nancy, France</mods:affiliation>
</affiliation>
<affiliation><mods:affiliation>E-mail: liliana.cucu@loria.fr</mods:affiliation>
</affiliation>
</author>
<author><name sortKey="Pernet, Nicolas" sort="Pernet, Nicolas" uniqKey="Pernet N" first="Nicolas" last="Pernet">Nicolas Pernet</name>
<affiliation><mods:affiliation>INRIA Rocquencourt France, AOSTE Team, Domaine de Voluceau, 78153, Le Chesnay, France</mods:affiliation>
</affiliation>
<affiliation><mods:affiliation>E-mail: nicolas.pernet@inria.fr</mods:affiliation>
</affiliation>
</author>
<author><name sortKey="Sorel, Yves" sort="Sorel, Yves" uniqKey="Sorel Y" first="Yves" last="Sorel">Yves Sorel</name>
<affiliation><mods:affiliation>INRIA Rocquencourt France, AOSTE Team, Domaine de Voluceau, 78153, Le Chesnay, France</mods:affiliation>
</affiliation>
<affiliation><mods:affiliation>E-mail: yves.sorel@inria.fr</mods:affiliation>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:48109A0345C18E0C1B59ABD65E337BFECB9CEC9A</idno>
<date when="2007" year="2007">2007</date>
<idno type="doi">10.1007/s10479-007-0279-9</idno>
<idno type="url">https://api.istex.fr/ark:/67375/VQC-049PTFPN-3/fulltext.pdf</idno>
<idno type="wicri:Area/Istex/Corpus">001100</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001100</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Periodic real-time scheduling: from deadline-based model to latency-based model</title>
<author><name sortKey="Cucu, Liliana" sort="Cucu, Liliana" uniqKey="Cucu L" first="Liliana" last="Cucu">Liliana Cucu</name>
<affiliation><mods:affiliation>LORIA-INPL France, TRIO Team, 615 rue du Jardin Botanique, 54600, Villers les Nancy, France</mods:affiliation>
</affiliation>
<affiliation><mods:affiliation>E-mail: liliana.cucu@loria.fr</mods:affiliation>
</affiliation>
</author>
<author><name sortKey="Pernet, Nicolas" sort="Pernet, Nicolas" uniqKey="Pernet N" first="Nicolas" last="Pernet">Nicolas Pernet</name>
<affiliation><mods:affiliation>INRIA Rocquencourt France, AOSTE Team, Domaine de Voluceau, 78153, Le Chesnay, France</mods:affiliation>
</affiliation>
<affiliation><mods:affiliation>E-mail: nicolas.pernet@inria.fr</mods:affiliation>
</affiliation>
</author>
<author><name sortKey="Sorel, Yves" sort="Sorel, Yves" uniqKey="Sorel Y" first="Yves" last="Sorel">Yves Sorel</name>
<affiliation><mods:affiliation>INRIA Rocquencourt France, AOSTE Team, Domaine de Voluceau, 78153, Le Chesnay, France</mods:affiliation>
</affiliation>
<affiliation><mods:affiliation>E-mail: yves.sorel@inria.fr</mods:affiliation>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series><title level="j">Annals of Operations Research</title>
<title level="j" type="abbrev">Ann Oper Res</title>
<idno type="ISSN">0254-5330</idno>
<idno type="eISSN">1572-9338</idno>
<imprint><publisher>Springer US; http://www.springer-ny.com</publisher>
<pubPlace>Boston</pubPlace>
<date type="published" when="2008-03-01">2008-03-01</date>
<biblScope unit="volume">159</biblScope>
<biblScope unit="issue">1</biblScope>
<biblScope unit="page" from="41">41</biblScope>
<biblScope unit="page" to="51">51</biblScope>
</imprint>
<idno type="ISSN">0254-5330</idno>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><idno type="ISSN">0254-5330</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Deadline</term>
<term>Latency</term>
<term>Non-preemptive</term>
<term>Periodicity</term>
<term>Real-time</term>
<term>Scheduling</term>
</keywords>
</textClass>
<langUsage><language ident="en">en</language>
</langUsage>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Abstract: This paper presents a connection between two real-time models: a deadline-based model and a latency-based model. The importance of the latency-based model is proved through a result showing that two deadlines, instead of a latency constraint, over-constrain the real-time applications. Moreover, we give a deadline-marking algorithm based on the relation between deadlines and latency constraints. This algorithm provides non-preemptive feasible schedules for systems with precedence constraints and deadlines, or more complex systems with deadlines and latencies. This is the first step toward non-preemptive schedulability for distributed architectures (without over-constraining the system) like, for example, the automotive applications using protocols such as Controller Area Network (CAN).</div>
</front>
</TEI>
<istex><corpusName>springer-journals</corpusName>
<author><json:item><name>Liliana Cucu</name>
<affiliations><json:string>LORIA-INPL France, TRIO Team, 615 rue du Jardin Botanique, 54600, Villers les Nancy, France</json:string>
<json:string>E-mail: liliana.cucu@loria.fr</json:string>
</affiliations>
</json:item>
<json:item><name>Nicolas Pernet</name>
<affiliations><json:string>INRIA Rocquencourt France, AOSTE Team, Domaine de Voluceau, 78153, Le Chesnay, France</json:string>
<json:string>E-mail: nicolas.pernet@inria.fr</json:string>
</affiliations>
</json:item>
<json:item><name>Yves Sorel</name>
<affiliations><json:string>INRIA Rocquencourt France, AOSTE Team, Domaine de Voluceau, 78153, Le Chesnay, France</json:string>
<json:string>E-mail: yves.sorel@inria.fr</json:string>
</affiliations>
</json:item>
</author>
<subject><json:item><lang><json:string>eng</json:string>
</lang>
<value>Scheduling</value>
</json:item>
<json:item><lang><json:string>eng</json:string>
</lang>
<value>Real-time</value>
</json:item>
<json:item><lang><json:string>eng</json:string>
</lang>
<value>Non-preemptive</value>
</json:item>
<json:item><lang><json:string>eng</json:string>
</lang>
<value>Latency</value>
</json:item>
<json:item><lang><json:string>eng</json:string>
</lang>
<value>Deadline</value>
</json:item>
<json:item><lang><json:string>eng</json:string>
</lang>
<value>Periodicity</value>
</json:item>
</subject>
<articleId><json:string>279</json:string>
<json:string>s10479-007-0279-9</json:string>
</articleId>
<arkIstex>ark:/67375/VQC-049PTFPN-3</arkIstex>
<language><json:string>eng</json:string>
</language>
<originalGenre><json:string>OriginalPaper</json:string>
</originalGenre>
<abstract>Abstract: This paper presents a connection between two real-time models: a deadline-based model and a latency-based model. The importance of the latency-based model is proved through a result showing that two deadlines, instead of a latency constraint, over-constrain the real-time applications. Moreover, we give a deadline-marking algorithm based on the relation between deadlines and latency constraints. This algorithm provides non-preemptive feasible schedules for systems with precedence constraints and deadlines, or more complex systems with deadlines and latencies. This is the first step toward non-preemptive schedulability for distributed architectures (without over-constraining the system) like, for example, the automotive applications using protocols such as Controller Area Network (CAN).</abstract>
<qualityIndicators><refBibsNative>false</refBibsNative>
<abstractWordCount>106</abstractWordCount>
<abstractCharCount>805</abstractCharCount>
<keywordCount>6</keywordCount>
<score>7.399</score>
<pdfWordCount>4127</pdfWordCount>
<pdfCharCount>21136</pdfCharCount>
<pdfVersion>1.3</pdfVersion>
<pdfPageCount>11</pdfPageCount>
<pdfPageSize>439.37 x 666.142 pts</pdfPageSize>
</qualityIndicators>
<title>Periodic real-time scheduling: from deadline-based model to latency-based model</title>
<genre><json:string>research-article</json:string>
</genre>
<host><title>Annals of Operations Research</title>
<language><json:string>unknown</json:string>
</language>
<publicationDate>2008</publicationDate>
<copyrightDate>2008</copyrightDate>
<issn><json:string>0254-5330</json:string>
</issn>
<eissn><json:string>1572-9338</json:string>
</eissn>
<journalId><json:string>10479</json:string>
</journalId>
<volume>159</volume>
<issue>1</issue>
<pages><first>41</first>
<last>51</last>
</pages>
<genre><json:string>journal</json:string>
</genre>
<subject><json:item><value>Theory of Computation</value>
</json:item>
<json:item><value>Combinatorics</value>
</json:item>
<json:item><value>Operations Research/Decision Theory</value>
</json:item>
</subject>
</host>
<ark><json:string>ark:/67375/VQC-049PTFPN-3</json:string>
</ark>
<publicationDate>2008</publicationDate>
<copyrightDate>2007</copyrightDate>
<doi><json:string>10.1007/s10479-007-0279-9</json:string>
</doi>
<id>48109A0345C18E0C1B59ABD65E337BFECB9CEC9A</id>
<score>1</score>
<fulltext><json:item><extension>pdf</extension>
<original>true</original>
<mimetype>application/pdf</mimetype>
<uri>https://api.istex.fr/ark:/67375/VQC-049PTFPN-3/fulltext.pdf</uri>
</json:item>
<json:item><extension>zip</extension>
<original>false</original>
<mimetype>application/zip</mimetype>
<uri>https://api.istex.fr/ark:/67375/VQC-049PTFPN-3/bundle.zip</uri>
</json:item>
<istex:fulltextTEI uri="https://api.istex.fr/ark:/67375/VQC-049PTFPN-3/fulltext.tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">Periodic real-time scheduling: from deadline-based model to latency-based model</title>
</titleStmt>
<publicationStmt><authority>ISTEX</authority>
<publisher scheme="https://scientific-publisher.data.istex.fr">Springer US; http://www.springer-ny.com</publisher>
<pubPlace>Boston</pubPlace>
<availability><licence><p>Springer Science+Business Media, LLC, 2007</p>
</licence>
<p scheme="https://loaded-corpus.data.istex.fr/ark:/67375/XBH-3XSW68JL-F">springer</p>
</availability>
<date>2007</date>
</publicationStmt>
<notesStmt><note type="research-article" scheme="https://content-type.data.istex.fr/ark:/67375/XTP-1JC4F85T-7">research-article</note>
<note type="journal" scheme="https://publication-type.data.istex.fr/ark:/67375/JMC-0GLKJH51-B">journal</note>
</notesStmt>
<sourceDesc><biblStruct type="inbook"><analytic><title level="a" type="main" xml:lang="en">Periodic real-time scheduling: from deadline-based model to latency-based model</title>
<author xml:id="author-0000" corresp="yes"><persName><forename type="first">Liliana</forename>
<surname>Cucu</surname>
</persName>
<email>liliana.cucu@loria.fr</email>
<affiliation>LORIA-INPL France, TRIO Team, 615 rue du Jardin Botanique, 54600, Villers les Nancy, France</affiliation>
</author>
<author xml:id="author-0001"><persName><forename type="first">Nicolas</forename>
<surname>Pernet</surname>
</persName>
<email>nicolas.pernet@inria.fr</email>
<affiliation>INRIA Rocquencourt France, AOSTE Team, Domaine de Voluceau, 78153, Le Chesnay, France</affiliation>
</author>
<author xml:id="author-0002"><persName><forename type="first">Yves</forename>
<surname>Sorel</surname>
</persName>
<email>yves.sorel@inria.fr</email>
<affiliation>INRIA Rocquencourt France, AOSTE Team, Domaine de Voluceau, 78153, Le Chesnay, France</affiliation>
</author>
<idno type="istex">48109A0345C18E0C1B59ABD65E337BFECB9CEC9A</idno>
<idno type="ark">ark:/67375/VQC-049PTFPN-3</idno>
<idno type="DOI">10.1007/s10479-007-0279-9</idno>
<idno type="article-id">279</idno>
<idno type="article-id">s10479-007-0279-9</idno>
</analytic>
<monogr><title level="j">Annals of Operations Research</title>
<title level="j" type="abbrev">Ann Oper Res</title>
<idno type="pISSN">0254-5330</idno>
<idno type="eISSN">1572-9338</idno>
<idno type="journal-ID">true</idno>
<idno type="issue-article-count">27</idno>
<idno type="volume-issue-count">1</idno>
<imprint><publisher>Springer US; http://www.springer-ny.com</publisher>
<pubPlace>Boston</pubPlace>
<date type="published" when="2008-03-01"></date>
<biblScope unit="volume">159</biblScope>
<biblScope unit="issue">1</biblScope>
<biblScope unit="page" from="41">41</biblScope>
<biblScope unit="page" to="51">51</biblScope>
</imprint>
</monogr>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><creation><date>2007</date>
</creation>
<langUsage><language ident="en">en</language>
</langUsage>
<abstract xml:lang="en"><p>Abstract: This paper presents a connection between two real-time models: a deadline-based model and a latency-based model. The importance of the latency-based model is proved through a result showing that two deadlines, instead of a latency constraint, over-constrain the real-time applications. Moreover, we give a deadline-marking algorithm based on the relation between deadlines and latency constraints. This algorithm provides non-preemptive feasible schedules for systems with precedence constraints and deadlines, or more complex systems with deadlines and latencies. This is the first step toward non-preemptive schedulability for distributed architectures (without over-constraining the system) like, for example, the automotive applications using protocols such as Controller Area Network (CAN).</p>
</abstract>
<textClass xml:lang="en"><keywords scheme="keyword"><list><head>Keywords</head>
<item><term>Scheduling</term>
</item>
<item><term>Real-time</term>
</item>
<item><term>Non-preemptive</term>
</item>
<item><term>Latency</term>
</item>
<item><term>Deadline</term>
</item>
<item><term>Periodicity</term>
</item>
</list>
</keywords>
</textClass>
<textClass><keywords scheme="Journal Subject"><list><head>Economics / Management Science</head>
<item><term>Theory of Computation</term>
</item>
<item><term>Combinatorics</term>
</item>
<item><term>Operations Research/Decision Theory</term>
</item>
</list>
</keywords>
</textClass>
</profileDesc>
<revisionDesc><change when="2008-03-01">Published</change>
</revisionDesc>
</teiHeader>
</istex:fulltextTEI>
<json:item><extension>txt</extension>
<original>false</original>
<mimetype>text/plain</mimetype>
<uri>https://api.istex.fr/ark:/67375/VQC-049PTFPN-3/fulltext.txt</uri>
</json:item>
</fulltext>
<metadata><istex:metadataXml wicri:clean="corpus springer-journals not found" wicri:toSee="no header"><istex:xmlDeclaration>version="1.0" encoding="UTF-8"</istex:xmlDeclaration>
<istex:docType PUBLIC="-//Springer-Verlag//DTD A++ V2.4//EN" URI="http://devel.springer.de/A++/V2.4/DTD/A++V2.4.dtd" name="istex:docType"></istex:docType>
<istex:document><Publisher><PublisherInfo><PublisherName>Springer US</PublisherName>
<PublisherLocation>Boston</PublisherLocation>
<PublisherURL>http://www.springer-ny.com</PublisherURL>
</PublisherInfo>
<Journal OutputMedium="All"><JournalInfo JournalProductType="ArchiveJournal" NumberingStyle="ContentOnly"><JournalID>10479</JournalID>
<JournalPrintISSN>0254-5330</JournalPrintISSN>
<JournalElectronicISSN>1572-9338</JournalElectronicISSN>
<JournalTitle>Annals of Operations Research</JournalTitle>
<JournalAbbreviatedTitle>Ann Oper Res</JournalAbbreviatedTitle>
<JournalSubjectGroup><JournalSubject Type="Primary">Economics / Management Science</JournalSubject>
<JournalSubject Type="Secondary">Theory of Computation </JournalSubject>
<JournalSubject Type="Secondary">Combinatorics</JournalSubject>
<JournalSubject Type="Secondary">Operations Research/Decision Theory</JournalSubject>
</JournalSubjectGroup>
</JournalInfo>
<Volume OutputMedium="All"><VolumeInfo TocLevels="0" VolumeType="Regular"><VolumeIDStart>159</VolumeIDStart>
<VolumeIDEnd>159</VolumeIDEnd>
<VolumeIssueCount>1</VolumeIssueCount>
</VolumeInfo>
<Issue IssueType="Regular" OutputMedium="All"><IssueInfo IssueType="Regular" TocLevels="0"><IssueIDStart>1</IssueIDStart>
<IssueIDEnd>1</IssueIDEnd>
<IssueTitle Language="En">Special Issue on Multidisciplinary Scheduling: Theory and Applications (MISTA) ; Guest Editors: Graham Kendall, Lei Lei and Michael Pinedo</IssueTitle>
<IssueArticleCount>27</IssueArticleCount>
<IssueHistory><OnlineDate><Year>2008</Year>
<Month>1</Month>
<Day>28</Day>
</OnlineDate>
<PrintDate><Year>2008</Year>
<Month>1</Month>
<Day>28</Day>
</PrintDate>
<CoverDate><Year>2008</Year>
<Month>3</Month>
</CoverDate>
</IssueHistory>
<IssueCopyright><CopyrightHolderName>Springer Science+Business Media, LLC</CopyrightHolderName>
<CopyrightYear>2008</CopyrightYear>
</IssueCopyright>
</IssueInfo>
<Article ID="s10479-007-0279-9" OutputMedium="All"><ArticleInfo ArticleType="OriginalPaper" ContainsESM="No" Language="En" NumberingStyle="ContentOnly" TocLevels="0"><ArticleID>279</ArticleID>
<ArticleDOI>10.1007/s10479-007-0279-9</ArticleDOI>
<ArticleSequenceNumber>4</ArticleSequenceNumber>
<ArticleTitle Language="En">Periodic real-time scheduling: from deadline-based model to latency-based model</ArticleTitle>
<ArticleFirstPage>41</ArticleFirstPage>
<ArticleLastPage>51</ArticleLastPage>
<ArticleHistory><RegistrationDate><Year>2007</Year>
<Month>11</Month>
<Day>2</Day>
</RegistrationDate>
<OnlineDate><Year>2007</Year>
<Month>12</Month>
<Day>4</Day>
</OnlineDate>
</ArticleHistory>
<ArticleCopyright><CopyrightHolderName>Springer Science+Business Media, LLC</CopyrightHolderName>
<CopyrightYear>2007</CopyrightYear>
</ArticleCopyright>
<ArticleGrants Type="Regular"><MetadataGrant Grant="OpenAccess"></MetadataGrant>
<AbstractGrant Grant="OpenAccess"></AbstractGrant>
<BodyPDFGrant Grant="Restricted"></BodyPDFGrant>
<BodyHTMLGrant Grant="Restricted"></BodyHTMLGrant>
<BibliographyGrant Grant="Restricted"></BibliographyGrant>
<ESMGrant Grant="Restricted"></ESMGrant>
</ArticleGrants>
</ArticleInfo>
<ArticleHeader><AuthorGroup><Author AffiliationIDS="Aff1" CorrespondingAffiliationID="Aff1"><AuthorName DisplayOrder="Western"><GivenName>Liliana</GivenName>
<FamilyName>Cucu</FamilyName>
</AuthorName>
<Contact><Phone>+33-3-54-958462</Phone>
<Email>liliana.cucu@loria.fr</Email>
</Contact>
</Author>
<Author AffiliationIDS="Aff2"><AuthorName DisplayOrder="Western"><GivenName>Nicolas</GivenName>
<FamilyName>Pernet</FamilyName>
</AuthorName>
<Contact><Phone>+33-1-39-635580</Phone>
<Email>nicolas.pernet@inria.fr</Email>
</Contact>
</Author>
<Author AffiliationIDS="Aff2"><AuthorName DisplayOrder="Western"><GivenName>Yves</GivenName>
<FamilyName>Sorel</FamilyName>
</AuthorName>
<Contact><Phone>+33-1-39-635260</Phone>
<Email>yves.sorel@inria.fr</Email>
</Contact>
</Author>
<Affiliation ID="Aff1"><OrgName>LORIA-INPL France, TRIO Team</OrgName>
<OrgAddress><Street>615 rue du Jardin Botanique</Street>
<Postcode>54600</Postcode>
<City>Villers les Nancy</City>
<Country Code="FR">France</Country>
</OrgAddress>
</Affiliation>
<Affiliation ID="Aff2"><OrgName>INRIA Rocquencourt France, AOSTE Team</OrgName>
<OrgAddress><Street>Domaine de Voluceau</Street>
<Postcode>78153</Postcode>
<City>Le Chesnay</City>
<Country Code="FR">France</Country>
</OrgAddress>
</Affiliation>
</AuthorGroup>
<Abstract ID="Abs1" Language="En" OutputMedium="All"><Heading>Abstract</Heading>
<Para>
This paper presents a connection between two real-time models: a deadline-based model and a latency-based model. The importance of the latency-based model is proved through a result showing that two deadlines, instead of a latency constraint, over-constrain the real-time applications. Moreover, we give a deadline-marking algorithm based on the relation between deadlines and latency constraints. This algorithm provides non-preemptive feasible schedules for systems with precedence constraints and deadlines, or more complex systems with deadlines and latencies. This is the first step toward non-preemptive schedulability for distributed architectures (without over-constraining the system) like, for example, the automotive applications using protocols such as Controller Area Network (CAN).
</Para>
</Abstract>
<KeywordGroup Language="En"><Heading>Keywords</Heading>
<Keyword>Scheduling</Keyword>
<Keyword>Real-time</Keyword>
<Keyword>Non-preemptive</Keyword>
<Keyword>Latency</Keyword>
<Keyword>Deadline</Keyword>
<Keyword>Periodicity</Keyword>
</KeywordGroup>
<ArticleNote Type="Misc"><SimplePara>These results were obtained while the first author was at INRIA Rocquencourt.</SimplePara>
</ArticleNote>
</ArticleHeader>
<NoBody></NoBody>
</Article>
</Issue>
</Volume>
</Journal>
</Publisher>
</istex:document>
</istex:metadataXml>
<mods version="3.6"><titleInfo lang="en"><title>Periodic real-time scheduling: from deadline-based model to latency-based model</title>
</titleInfo>
<titleInfo type="alternative" contentType="CDATA"><title>Periodic real-time scheduling: from deadline-based model to latency-based model</title>
</titleInfo>
<name type="personal" displayLabel="corresp"><namePart type="given">Liliana</namePart>
<namePart type="family">Cucu</namePart>
<affiliation>LORIA-INPL France, TRIO Team, 615 rue du Jardin Botanique, 54600, Villers les Nancy, France</affiliation>
<affiliation>E-mail: liliana.cucu@loria.fr</affiliation>
<role><roleTerm type="text">author</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Nicolas</namePart>
<namePart type="family">Pernet</namePart>
<affiliation>INRIA Rocquencourt France, AOSTE Team, Domaine de Voluceau, 78153, Le Chesnay, France</affiliation>
<affiliation>E-mail: nicolas.pernet@inria.fr</affiliation>
<role><roleTerm type="text">author</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Yves</namePart>
<namePart type="family">Sorel</namePart>
<affiliation>INRIA Rocquencourt France, AOSTE Team, Domaine de Voluceau, 78153, Le Chesnay, France</affiliation>
<affiliation>E-mail: yves.sorel@inria.fr</affiliation>
<role><roleTerm type="text">author</roleTerm>
</role>
</name>
<typeOfResource>text</typeOfResource>
<genre type="research-article" displayLabel="OriginalPaper" authority="ISTEX" authorityURI="https://content-type.data.istex.fr" valueURI="https://content-type.data.istex.fr/ark:/67375/XTP-1JC4F85T-7">research-article</genre>
<originInfo><publisher>Springer US; http://www.springer-ny.com</publisher>
<place><placeTerm type="text">Boston</placeTerm>
</place>
<dateIssued encoding="w3cdtf">2008-03-01</dateIssued>
<copyrightDate encoding="w3cdtf">2007</copyrightDate>
</originInfo>
<language><languageTerm type="code" authority="rfc3066">en</languageTerm>
<languageTerm type="code" authority="iso639-2b">eng</languageTerm>
</language>
<abstract lang="en">Abstract: This paper presents a connection between two real-time models: a deadline-based model and a latency-based model. The importance of the latency-based model is proved through a result showing that two deadlines, instead of a latency constraint, over-constrain the real-time applications. Moreover, we give a deadline-marking algorithm based on the relation between deadlines and latency constraints. This algorithm provides non-preemptive feasible schedules for systems with precedence constraints and deadlines, or more complex systems with deadlines and latencies. This is the first step toward non-preemptive schedulability for distributed architectures (without over-constraining the system) like, for example, the automotive applications using protocols such as Controller Area Network (CAN).</abstract>
<subject lang="en"><genre>Keywords</genre>
<topic>Scheduling</topic>
<topic>Real-time</topic>
<topic>Non-preemptive</topic>
<topic>Latency</topic>
<topic>Deadline</topic>
<topic>Periodicity</topic>
</subject>
<relatedItem type="host"><titleInfo><title>Annals of Operations Research</title>
</titleInfo>
<titleInfo type="abbreviated"><title>Ann Oper Res</title>
</titleInfo>
<genre type="journal" authority="ISTEX" authorityURI="https://publication-type.data.istex.fr" valueURI="https://publication-type.data.istex.fr/ark:/67375/JMC-0GLKJH51-B">journal</genre>
<originInfo><publisher>Springer</publisher>
<dateIssued encoding="w3cdtf">2008-01-28</dateIssued>
<copyrightDate encoding="w3cdtf">2008</copyrightDate>
</originInfo>
<subject><genre>Economics / Management Science</genre>
<topic>Theory of Computation</topic>
<topic>Combinatorics</topic>
<topic>Operations Research/Decision Theory</topic>
</subject>
<identifier type="ISSN">0254-5330</identifier>
<identifier type="eISSN">1572-9338</identifier>
<identifier type="JournalID">10479</identifier>
<identifier type="IssueArticleCount">27</identifier>
<identifier type="VolumeIssueCount">1</identifier>
<part><date>2008</date>
<detail type="issue"><title>Special Issue on Multidisciplinary Scheduling: Theory and Applications (MISTA) ; Guest Editors: Graham Kendall, Lei Lei and Michael Pinedo</title>
</detail>
<detail type="volume"><number>159</number>
<caption>vol.</caption>
</detail>
<detail type="issue"><number>1</number>
<caption>no.</caption>
</detail>
<extent unit="pages"><start>41</start>
<end>51</end>
</extent>
</part>
<recordInfo><recordOrigin>Springer Science+Business Media, LLC, 2008</recordOrigin>
</recordInfo>
</relatedItem>
<identifier type="istex">48109A0345C18E0C1B59ABD65E337BFECB9CEC9A</identifier>
<identifier type="ark">ark:/67375/VQC-049PTFPN-3</identifier>
<identifier type="DOI">10.1007/s10479-007-0279-9</identifier>
<identifier type="ArticleID">279</identifier>
<identifier type="ArticleID">s10479-007-0279-9</identifier>
<accessCondition type="use and reproduction" contentType="copyright">Springer Science+Business Media, LLC, 2007</accessCondition>
<recordInfo><recordContentSource authority="ISTEX" authorityURI="https://loaded-corpus.data.istex.fr" valueURI="https://loaded-corpus.data.istex.fr/ark:/67375/XBH-3XSW68JL-F">springer</recordContentSource>
<recordOrigin>Springer Science+Business Media, LLC, 2007</recordOrigin>
</recordInfo>
</mods>
<json:item><extension>json</extension>
<original>false</original>
<mimetype>application/json</mimetype>
<uri>https://api.istex.fr/ark:/67375/VQC-049PTFPN-3/record.json</uri>
</json:item>
</metadata>
<serie></serie>
</istex>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Istex/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001100 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 001100 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Lorraine |area= InforLorV4 |flux= Istex |étape= Corpus |type= RBID |clé= ISTEX:48109A0345C18E0C1B59ABD65E337BFECB9CEC9A |texte= Periodic real-time scheduling: from deadline-based model to latency-based model }}
![]() | This area was generated with Dilib version V0.6.33. | ![]() |