PlumX Metrics
Embed PlumX Metrics

Limited pre-emptive global fixed task priority

Proceedings - Real-Time Systems Symposium, ISSN: 1052-8725, Page: 182-191
2013
  • 18
    Citations
  • 0
    Usage
  • 7
    Captures
  • 0
    Mentions
  • 0
    Social Media
Metric Options:   Counts1 Year3 Year

Metrics Details

  • Citations
    18
    • Citation Indexes
      18
  • Captures
    7

Conference Paper Description

In this paper a limited pre-emptive global fixed task priority scheduling policy for multiprocessors is presented. This scheduling policy is a generalization of global fully pre-emptive and non-pre-emptive fixed task priority policies for platforms with at least two homogeneous processors. The scheduling protocol devised is such that a job can only be blocked at most once by a body of lower priority non-pre-emptive workload. The presented policy dominates both fully pre-emptive and fully non-pre-emptive with respect to schedulability. A sufficient schedulability test is presented for this policy. Several approaches to estimate the blocking generated by lower priority non-pre-emptive regions are presented. As a last contribution it is experimentally shown that, on the average case, the number of pre-emptions observed in a schedule are drastically reduced in comparison to global fully pre-emptive scheduling. © 2013 IEEE.

Bibliographic Details

José Marinho; Vincent Nélis; Stefan M. Petters; Marko Bertogna; Robert I. Davis

Institute of Electrical and Electronics Engineers (IEEE)

Computer Science

Provide Feedback

Have ideas for a new metric? Would you like to see something else here?Let us know