• DocumentCode
    2192250
  • Title

    Guaranteeing Optional Task Completions on (m,k)-Firm Real-Time Systems

  • Author

    Evequoz, Claude

  • Author_Institution
    Univ. of Appl. Sci. Western Switzerland, Yverdon-les-Bains, Switzerland
  • fYear
    2010
  • fDate
    June 29 2010-July 1 2010
  • Firstpage
    1772
  • Lastpage
    1779
  • Abstract
    Previous preemptive real-time (m,k)-firm schedulers all try a best effort policy to dispatch k-m executions when m out of k consecutive task executions have met their deadlines. These additional executions can only bring value to the system if no firm deadline is missed. In this paper we present a framework whereby an on-line feasibility test is carried out on these k-m executions before dispatching them. With our scheme, all dispatched tasks are guaranteed to meet their deadlines.
  • Keywords
    job shop scheduling; real-time systems; guaranteeing optional task completions; k-m executions; real-time systems; Delta modulation; Dynamic scheduling; Real time systems; Schedules; Scheduling algorithm; Time factors; (m; Firm deadlines; k)-firm real-time scheduling; on-line feasibility test;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer and Information Technology (CIT), 2010 IEEE 10th International Conference on
  • Conference_Location
    Bradford
  • Print_ISBN
    978-1-4244-7547-6
  • Type

    conf

  • DOI
    10.1109/CIT.2010.308
  • Filename
    5577977