Open AccessThe Fully Polynomial-Time Approximation Scheme for Feasibility Analysis in Static-Priority Systems with Arbitrary Relative Deadlines Revisited
Author(s) -
Thi Huyen Chau Nguyen,
Pascal Richard,
Nathan Fisher
Publication year - 2010
Publication title -
hal (le centre pour la communication scientifique directe)
Language(s) - English
Resource type - Conference proceedings
Subject(s) - uniprocessor system , polynomial time approximation scheme , computer science , scheme (mathematics) , time complexity , scheduling (production processes) , approximation algorithm , monotonic function , mathematical optimization , polynomial , algorithm , mathematics , parallel computing , mathematical analysis , multiprocessing