Multiprocessor schedulability of arbitrary-deadline sporadic tasks: complexity and antichain algorithm.
Gilles GeeraertsJoël GoossensMarkus LindströmPublished in: Real Time Syst. (2013)
Keyphrases
- detection algorithm
- computational complexity
- space complexity
- preprocessing
- worst case
- improved algorithm
- computational cost
- experimental evaluation
- k means
- np hard
- times faster
- expectation maximization
- search space
- single pass
- matching algorithm
- optimal solution
- theoretical analysis
- high accuracy
- dynamic programming
- hidden markov models
- significant improvement
- probabilistic model
- clustering method
- classification algorithm
- path planning
- data structure
- complexity analysis
- similarity measure
- linear complexity