This site uses cookies to deliver our services and to ensure you get the best experience. By continuing to use this site, you consent to our use of cookies and acknowledge that you have read and understand our Privacy Policy, Cookie Policy, and Terms
The problem of feasibility analysis for asynchronous periodic task sets (i.e. where tasks can have an initial offset) is known to be co-NP-complete in the strong sense. A sufficie...