"Fixed-Priority Schedulability of Sporadic Tasks on Uniprocessors is NP-Hard."

Pontus Ekberg, Wang Yi (2017)

> Home

Details and statistics

DOI: 10.1109/RTSS.2017.00020

access: closed

type: Conference or Workshop Paper

metadata version: 2023-03-24

- view
  authority control:
- export record
  dblp key:
  - conf/rtss/Ekberg017
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/rtss/Ekberg017
Pontus Ekberg, Wang Yi:
Fixed-Priority Schedulability of Sporadic Tasks on Uniprocessors is NP-Hard. RTSS 2017: 139-146

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.