More Web Proxy on the site http://driver.im/

default search action

combined dblp search
author search
venue search
publication search

ask others

"Rate-Monotonic Schedulability of Implicit-Deadline Tasks is NP-hard Beyond ..."

Pontus Ekberg (2020)

> Home

Details and statistics

DOI: 10.1109/RTSS49844.2020.00036

access: closed

type: Conference or Workshop Paper

metadata version: 2021-03-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/rtss/Ekberg20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/rtss/Ekberg20
Pontus Ekberg:
Rate-Monotonic Schedulability of Implicit-Deadline Tasks is NP-hard Beyond Liu and Layland's Bound. RTSS 2020: 308-318

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.