An optimal algorithm for guaranteeing sporadic tasks in hard real-time systems

Guaranteeing that time critical tasks will meet their timing constraints is an important aspect of real-time systems research. Indeed, a real time system is dynamic and consequently requires online and adaptive scheduling strategies. The authors survey and extend results on scheduling hard deadline...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Parallel and Distributed Processing, 2nd IEEE Symposium On s. 578 - 585
Hlavní autoři: Silly, M., Chetto, H., Elyounsi, N.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE Comput. Soc. Press 1990
Témata:
Adaptive scheduling
Application software
Communication system control
Dynamic scheduling
Process control
Processor scheduling
Real time systems
Scheduling algorithm
Testing
Timing
ISBN:0818620870, 9780818620874
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract Guaranteeing that time critical tasks will meet their timing constraints is an important aspect of real-time systems research. Indeed, a real time system is dynamic and consequently requires online and adaptive scheduling strategies. The authors survey and extend results on scheduling hard deadline periodic and sporadic tasks on the monoprocessor model. The periodic tasks are independent, run cyclically and their characteristics are known in advance. The authors allow for the unpredictable arrival of aperiodic tasks said to be sporadic with hard real-time constraints. The problem is to jointly schedule the periodic and sporadic tasks so that the timing requirements for both sets of tasks are met. A schedulability test is presented that decides whether a new occurring task can be accepted. This test is built upon the Earliest Deadline scheduling algorithm which features a high performance and ease of implementation.< >
AbstractList Guaranteeing that time critical tasks will meet their timing constraints is an important aspect of real-time systems research. Indeed, a real time system is dynamic and consequently requires online and adaptive scheduling strategies. The authors survey and extend results on scheduling hard deadline periodic and sporadic tasks on the monoprocessor model. The periodic tasks are independent, run cyclically and their characteristics are known in advance. The authors allow for the unpredictable arrival of aperiodic tasks said to be sporadic with hard real-time constraints. The problem is to jointly schedule the periodic and sporadic tasks so that the timing requirements for both sets of tasks are met. A schedulability test is presented that decides whether a new occurring task can be accepted. This test is built upon the Earliest Deadline scheduling algorithm which features a high performance and ease of implementation.< >
Author Elyounsi, N.
Silly, M.
Chetto, H.
Author_xml – sequence: 1
  givenname: M.
  surname: Silly
  fullname: Silly, M.
  organization: Lab. d'Autom. de Nantes, ENSM, Nantes, France
– sequence: 2
  givenname: H.
  surname: Chetto
  fullname: Chetto, H.
  organization: Lab. d'Autom. de Nantes, ENSM, Nantes, France
– sequence: 3
  givenname: N.
  surname: Elyounsi
  fullname: Elyounsi, N.
  organization: Lab. d'Autom. de Nantes, ENSM, Nantes, France
BookMark eNotT81OwzAYiwRIsLE74pQX6PjS_LQ5TgMG0gST2H1Kmy9doEurJBz29lQavli2ZMuekeswBCTkgcGSMdBPX7vn3ZJpPUnBFVRXZAY1q1UJdQW3ZJHSN0yQcrLEHflYBTqM2Z9MT03fDdHn44m6IdLu10QTMqIPHU3jEI31Lc0m_STqAz2aaGlE0xdTGGk6p4yndE9unOkTLv55TvavL_v1W7H93LyvV9vC1zoXjlvVCGxUYx1IwQWTxjptQAMKXXHtXAPOtdJaaeoGbCmshap1pWoVsy2fk8dLrUfEwxin-fF8uBzmf02PT5M
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/SPDP.1990.143607
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Xplore POP ALL
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
EndPage 585
ExternalDocumentID 143607
GroupedDBID 6IE
6IK
6IL
AAJGR
AAWTH
ACGHX
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
OCL
RIB
RIC
RIE
RIL
ID FETCH-LOGICAL-i89t-f3d6b4eb6bdf0543415adf9a090e49739ffb0ffc5dd5a8b0d24dd07cf26c61dc3
IEDL.DBID RIE
ISBN 0818620870
9780818620874
IngestDate Tue Aug 26 17:03:07 EDT 2025
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i89t-f3d6b4eb6bdf0543415adf9a090e49739ffb0ffc5dd5a8b0d24dd07cf26c61dc3
PageCount 8
ParticipantIDs ieee_primary_143607
PublicationCentury 1900
PublicationDate 19900000
PublicationDateYYYYMMDD 1990-01-01
PublicationDate_xml – year: 1990
  text: 19900000
PublicationDecade 1990
PublicationTitle Parallel and Distributed Processing, 2nd IEEE Symposium On
PublicationTitleAbbrev SPDP
PublicationYear 1990
Publisher IEEE Comput. Soc. Press
Publisher_xml – name: IEEE Comput. Soc. Press
SSID ssj0000558624
Score 1.2206143
Snippet Guaranteeing that time critical tasks will meet their timing constraints is an important aspect of real-time systems research. Indeed, a real time system is...
SourceID ieee
SourceType Publisher
StartPage 578
SubjectTerms Adaptive scheduling
Application software
Communication system control
Dynamic scheduling
Process control
Processor scheduling
Real time systems
Scheduling algorithm
Testing
Timing
Title An optimal algorithm for guaranteeing sporadic tasks in hard real-time systems
URI https://ieeexplore.ieee.org/document/143607
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV09T8MwELWgYmDiq4hveWANdVLHiUcEVExVJDp0q2zfuUS0CWpSfj-20xYhsbD5IiuKzqfc-ez3HiH3icAYVJxEaKWIuAvhSIvMFXLS5kyCzFOdB7GJbDzOp1NZbHi2AxYGEcPlM3zww3CWD7VZ-1bZwOV24ZHj-1kmOqjWrp3C0tRDHQLDY-xGzMXhhl9na_PtKSWTg7fiufBAPWeGd_7SVgmpZXT0r486Jv0fiB4tdsnnhOxhdUbGjxWt3T9gqRZULea12_i_L6krS-ncRYL3IbrJ1O9kFZSGtqr5aGhZUQ-9oq58XERea5529M5Nn0xGL5On12gjmBCVuWwjOwShOWqhwTIPGY1TBVYqJhlymQ2ltZpZa1KAVOWaQcIBWGZsIoyIwQzPSa-qK7wg1HCvN4gM0WqeMZCGa24VcEhMnlq8JKfeE7PPjhJj1jnh6s-n1-TQe7rrW9yQXrta4y05MF9t2azuwjJ-A3FynLc
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PS8MwFA4yBT35a-Jvc_Bal3Zp2hxFHRNnGbjDbiPJS2Zxa2Xt_PtN0m0iePGWV0IpL4--l5d834fQbcR0CCKMAm04C6gN4UCyxBZy3KSEA09jmXqxiSTL0vGYD1c82x4Lo7X2l8_0nRv6s3wo1dK1yjo2tzOHHN-OKY1IA9baNFRIHDuwg-d4DO2I2EhcMeysbbo-pyS88zZ8HDqonjX9W3-pq_jk0tv_12cdoPYPSA8PN-nnEG3p4hhl9wUu7V9gLmZYzKal3fq_z7EtTPHUxoLzoraTsdvLCsgVrkX1UeG8wA58hW0BOQuc2jxuCJ6rNhr1nkYP_WAlmRDkKa8D0wUmqZZMgiEONBrGAgwXhBNNedLlxkhijIoBYpFKAhEFIIkyEVMsBNU9Qa2iLPQpwoo6xUFNtDaSJgS4opIaARQilcZGn6Ej54nJZ0OKMWmccP7n0xu02x-9DiaD5-zlAu05rzddjEvUqhdLfYV21FedV4trv6TfyE-f_g
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=Parallel+and+Distributed+Processing%2C+2nd+IEEE+Symposium+On&rft.atitle=An+optimal+algorithm+for+guaranteeing+sporadic+tasks+in+hard+real-time+systems&rft.au=Silly%2C+M.&rft.au=Chetto%2C+H.&rft.au=Elyounsi%2C+N.&rft.date=1990-01-01&rft.pub=IEEE+Comput.+Soc.+Press&rft.isbn=9780818620874&rft.spage=578&rft.epage=585&rft_id=info:doi/10.1109%2FSPDP.1990.143607&rft.externalDocID=143607
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780818620874/lc.gif&client=summon&freeimage=true
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780818620874/mc.gif&client=summon&freeimage=true
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780818620874/sc.gif&client=summon&freeimage=true