MCScheduling 1.0
Set of Algorithms for Solving Mixed-Criticality Scheduling
Classes
Package MCScheduling.ClairvoyantEDF

Contains the algorithm to solve mixed-criticality scheduling problems that is an adaptation of a clairvoyant non-preemptive scheduling algorithm by Cecilia Ekelin. More...

Classes

class  ClairvoyantEDF
 The mixed-criticality clairvoyant EDF algorithm implementation. More...
class  CriticalList
 A so-called critical list that is used by the clairvoyant EDF algorithm. More...
class  PriorityQueue
 A priority queue implementation based on a binary heap structure, which guarantees that all the operations define has logarithmic time complexity. More...
class  Task
 The wrapper of mixed-criticality job to be used with priority queues and criticality queue of the clairvoyant EDF algorithm. More...

Detailed Description

Contains the algorithm to solve mixed-criticality scheduling problems that is an adaptation of a clairvoyant non-preemptive scheduling algorithm by Cecilia Ekelin.

 All Classes Namespaces Functions Variables Properties