Parametric utilization bounds for implicit-deadline periodic tasks in automotive systems Article Swipe
Georg von der Brüggen
,
Niklas Ueter
,
Jian-Jia Chen
,
Matthias Freier
·
YOU?
·
· 2017
· Open Access
·
· DOI: https://doi.org/10.1145/3139258.3139273
YOU?
·
· 2017
· Open Access
·
· DOI: https://doi.org/10.1145/3139258.3139273
Fixed-priority scheduling has been widely used in safety-critical applications. This paper explores the parametric utilization bounds for implicit-deadline periodic tasks in automotive uniprocessor systems, where the period of a task is either 1, 2, 5, 10, 20, 50, 100, 200, or 1000 milliseconds. We prove a parametric utilization bound of 90% + z for such automotive task systems under rate-monotonic preemptive scheduling (RM-P), where z is a parameter defined by the input task set with 0 ≤ z ≤ 10%. Moreover, we explain how to perform an exact schedulability test for an automotive task set under RM-P by validating only three conditions. Furthermore, we extend our analyses to rate-monotonic non-preemptive scheduling (RM-NP). We show that very reasonable utilization values can still be achieved under RM-NP if the execution time of all tasks is below 1 millisecond. The analyses presented here are compatible with angle-synchronous tasks by applying the related arrival curves. It is shown in the evaluations that scheduling those angle-synchronous tasks according to their minimum inter-arrival time instead of assigning them to the highest priority can drastically increase the acceptance ratio in some settings.
Related Topics
Concepts
Uniprocessor system
Parametric statistics
Computer science
Automotive industry
Monotonic function
Scheduling (production processes)
Upper and lower bounds
Earliest deadline first scheduling
Real-time computing
Dynamic priority scheduling
Algorithm
Mathematical optimization
Parallel computing
Mathematics
Rate-monotonic scheduling
Statistics
Engineering
Quality of service
Computer network
Multiprocessing
Aerospace engineering
Mathematical analysis
Metadata
- Type
- article
- Language
- en
- Landing Page
- https://doi.org/10.1145/3139258.3139273
- http://dl.acm.org/ft_gateway.cfm?id=3139273&type=pdf
- OA Status
- gold
- Cited By
- 17
- References
- 36
- Related Works
- 10
- OpenAlex ID
- https://openalex.org/W2767582137
All OpenAlex metadata
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W2767582137Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.1145/3139258.3139273Digital Object Identifier
- Title
-
Parametric utilization bounds for implicit-deadline periodic tasks in automotive systemsWork title
- Type
-
articleOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2017Year of publication
- Publication date
-
2017-10-04Full publication date if available
- Authors
-
Georg von der Brüggen, Niklas Ueter, Jian-Jia Chen, Matthias FreierList of authors in order
- Landing page
-
https://doi.org/10.1145/3139258.3139273Publisher landing page
- PDF URL
-
https://dl.acm.org/ft_gateway.cfm?id=3139273&type=pdfDirect link to full text PDF
- Open access
-
YesWhether a free full text is available
- OA status
-
goldOpen access status per OpenAlex
- OA URL
-
https://dl.acm.org/ft_gateway.cfm?id=3139273&type=pdfDirect OA link when available
- Concepts
-
Uniprocessor system, Parametric statistics, Computer science, Automotive industry, Monotonic function, Scheduling (production processes), Upper and lower bounds, Earliest deadline first scheduling, Real-time computing, Dynamic priority scheduling, Algorithm, Mathematical optimization, Parallel computing, Mathematics, Rate-monotonic scheduling, Statistics, Engineering, Quality of service, Computer network, Multiprocessing, Aerospace engineering, Mathematical analysisTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
17Total citation count in OpenAlex
- Citations by year (recent)
-
2025: 1, 2024: 1, 2023: 5, 2022: 3, 2021: 3Per-year citation counts (last 5 years)
- References (count)
-
36Number of works referenced by this work
- Related works (count)
-
10Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W2767582137 |
|---|---|
| doi | https://doi.org/10.1145/3139258.3139273 |
| ids.doi | https://doi.org/10.1145/3139258.3139273 |
| ids.mag | 2767582137 |
| ids.openalex | https://openalex.org/W2767582137 |
| fwci | 1.01311257 |
| type | article |
| title | Parametric utilization bounds for implicit-deadline periodic tasks in automotive systems |
| biblio.issue | |
| biblio.volume | |
| biblio.last_page | 117 |
| biblio.first_page | 108 |
| topics[0].id | https://openalex.org/T10933 |
| topics[0].field.id | https://openalex.org/fields/17 |
| topics[0].field.display_name | Computer Science |
| topics[0].score | 0.9998999834060669 |
| topics[0].domain.id | https://openalex.org/domains/3 |
| topics[0].domain.display_name | Physical Sciences |
| topics[0].subfield.id | https://openalex.org/subfields/1708 |
| topics[0].subfield.display_name | Hardware and Architecture |
| topics[0].display_name | Real-Time Systems Scheduling |
| topics[1].id | https://openalex.org/T11125 |
| topics[1].field.id | https://openalex.org/fields/17 |
| topics[1].field.display_name | Computer Science |
| topics[1].score | 0.9901999831199646 |
| topics[1].domain.id | https://openalex.org/domains/3 |
| topics[1].domain.display_name | Physical Sciences |
| topics[1].subfield.id | https://openalex.org/subfields/1703 |
| topics[1].subfield.display_name | Computational Theory and Mathematics |
| topics[1].display_name | Petri Nets in System Modeling |
| topics[2].id | https://openalex.org/T10904 |
| topics[2].field.id | https://openalex.org/fields/17 |
| topics[2].field.display_name | Computer Science |
| topics[2].score | 0.9897000193595886 |
| topics[2].domain.id | https://openalex.org/domains/3 |
| topics[2].domain.display_name | Physical Sciences |
| topics[2].subfield.id | https://openalex.org/subfields/1708 |
| topics[2].subfield.display_name | Hardware and Architecture |
| topics[2].display_name | Embedded Systems Design Techniques |
| is_xpac | False |
| apc_list | |
| apc_paid | |
| concepts[0].id | https://openalex.org/C79189994 |
| concepts[0].level | 3 |
| concepts[0].score | 0.7678750157356262 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q3488021 |
| concepts[0].display_name | Uniprocessor system |
| concepts[1].id | https://openalex.org/C117251300 |
| concepts[1].level | 2 |
| concepts[1].score | 0.6587502956390381 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q1849855 |
| concepts[1].display_name | Parametric statistics |
| concepts[2].id | https://openalex.org/C41008148 |
| concepts[2].level | 0 |
| concepts[2].score | 0.6547054648399353 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[2].display_name | Computer science |
| concepts[3].id | https://openalex.org/C526921623 |
| concepts[3].level | 2 |
| concepts[3].score | 0.6441009044647217 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q190117 |
| concepts[3].display_name | Automotive industry |
| concepts[4].id | https://openalex.org/C72169020 |
| concepts[4].level | 2 |
| concepts[4].score | 0.5987704992294312 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q194404 |
| concepts[4].display_name | Monotonic function |
| concepts[5].id | https://openalex.org/C206729178 |
| concepts[5].level | 2 |
| concepts[5].score | 0.5867006778717041 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q2271896 |
| concepts[5].display_name | Scheduling (production processes) |
| concepts[6].id | https://openalex.org/C77553402 |
| concepts[6].level | 2 |
| concepts[6].score | 0.5348687767982483 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q13222579 |
| concepts[6].display_name | Upper and lower bounds |
| concepts[7].id | https://openalex.org/C32310161 |
| concepts[7].level | 5 |
| concepts[7].score | 0.43532755970954895 |
| concepts[7].wikidata | https://www.wikidata.org/wiki/Q666365 |
| concepts[7].display_name | Earliest deadline first scheduling |
| concepts[8].id | https://openalex.org/C79403827 |
| concepts[8].level | 1 |
| concepts[8].score | 0.40084534883499146 |
| concepts[8].wikidata | https://www.wikidata.org/wiki/Q3988 |
| concepts[8].display_name | Real-time computing |
| concepts[9].id | https://openalex.org/C107568181 |
| concepts[9].level | 3 |
| concepts[9].score | 0.3662565350532532 |
| concepts[9].wikidata | https://www.wikidata.org/wiki/Q5319000 |
| concepts[9].display_name | Dynamic priority scheduling |
| concepts[10].id | https://openalex.org/C11413529 |
| concepts[10].level | 1 |
| concepts[10].score | 0.3616430163383484 |
| concepts[10].wikidata | https://www.wikidata.org/wiki/Q8366 |
| concepts[10].display_name | Algorithm |
| concepts[11].id | https://openalex.org/C126255220 |
| concepts[11].level | 1 |
| concepts[11].score | 0.2861745357513428 |
| concepts[11].wikidata | https://www.wikidata.org/wiki/Q141495 |
| concepts[11].display_name | Mathematical optimization |
| concepts[12].id | https://openalex.org/C173608175 |
| concepts[12].level | 1 |
| concepts[12].score | 0.2753157615661621 |
| concepts[12].wikidata | https://www.wikidata.org/wiki/Q232661 |
| concepts[12].display_name | Parallel computing |
| concepts[13].id | https://openalex.org/C33923547 |
| concepts[13].level | 0 |
| concepts[13].score | 0.26431477069854736 |
| concepts[13].wikidata | https://www.wikidata.org/wiki/Q395 |
| concepts[13].display_name | Mathematics |
| concepts[14].id | https://openalex.org/C127456818 |
| concepts[14].level | 4 |
| concepts[14].score | 0.26310229301452637 |
| concepts[14].wikidata | https://www.wikidata.org/wiki/Q238879 |
| concepts[14].display_name | Rate-monotonic scheduling |
| concepts[15].id | https://openalex.org/C105795698 |
| concepts[15].level | 1 |
| concepts[15].score | 0.09951275587081909 |
| concepts[15].wikidata | https://www.wikidata.org/wiki/Q12483 |
| concepts[15].display_name | Statistics |
| concepts[16].id | https://openalex.org/C127413603 |
| concepts[16].level | 0 |
| concepts[16].score | 0.09139823913574219 |
| concepts[16].wikidata | https://www.wikidata.org/wiki/Q11023 |
| concepts[16].display_name | Engineering |
| concepts[17].id | https://openalex.org/C5119721 |
| concepts[17].level | 2 |
| concepts[17].score | 0.0757865309715271 |
| concepts[17].wikidata | https://www.wikidata.org/wiki/Q220501 |
| concepts[17].display_name | Quality of service |
| concepts[18].id | https://openalex.org/C31258907 |
| concepts[18].level | 1 |
| concepts[18].score | 0.07405894994735718 |
| concepts[18].wikidata | https://www.wikidata.org/wiki/Q1301371 |
| concepts[18].display_name | Computer network |
| concepts[19].id | https://openalex.org/C4822641 |
| concepts[19].level | 2 |
| concepts[19].score | 0.0 |
| concepts[19].wikidata | https://www.wikidata.org/wiki/Q846651 |
| concepts[19].display_name | Multiprocessing |
| concepts[20].id | https://openalex.org/C146978453 |
| concepts[20].level | 1 |
| concepts[20].score | 0.0 |
| concepts[20].wikidata | https://www.wikidata.org/wiki/Q3798668 |
| concepts[20].display_name | Aerospace engineering |
| concepts[21].id | https://openalex.org/C134306372 |
| concepts[21].level | 1 |
| concepts[21].score | 0.0 |
| concepts[21].wikidata | https://www.wikidata.org/wiki/Q7754 |
| concepts[21].display_name | Mathematical analysis |
| keywords[0].id | https://openalex.org/keywords/uniprocessor-system |
| keywords[0].score | 0.7678750157356262 |
| keywords[0].display_name | Uniprocessor system |
| keywords[1].id | https://openalex.org/keywords/parametric-statistics |
| keywords[1].score | 0.6587502956390381 |
| keywords[1].display_name | Parametric statistics |
| keywords[2].id | https://openalex.org/keywords/computer-science |
| keywords[2].score | 0.6547054648399353 |
| keywords[2].display_name | Computer science |
| keywords[3].id | https://openalex.org/keywords/automotive-industry |
| keywords[3].score | 0.6441009044647217 |
| keywords[3].display_name | Automotive industry |
| keywords[4].id | https://openalex.org/keywords/monotonic-function |
| keywords[4].score | 0.5987704992294312 |
| keywords[4].display_name | Monotonic function |
| keywords[5].id | https://openalex.org/keywords/scheduling |
| keywords[5].score | 0.5867006778717041 |
| keywords[5].display_name | Scheduling (production processes) |
| keywords[6].id | https://openalex.org/keywords/upper-and-lower-bounds |
| keywords[6].score | 0.5348687767982483 |
| keywords[6].display_name | Upper and lower bounds |
| keywords[7].id | https://openalex.org/keywords/earliest-deadline-first-scheduling |
| keywords[7].score | 0.43532755970954895 |
| keywords[7].display_name | Earliest deadline first scheduling |
| keywords[8].id | https://openalex.org/keywords/real-time-computing |
| keywords[8].score | 0.40084534883499146 |
| keywords[8].display_name | Real-time computing |
| keywords[9].id | https://openalex.org/keywords/dynamic-priority-scheduling |
| keywords[9].score | 0.3662565350532532 |
| keywords[9].display_name | Dynamic priority scheduling |
| keywords[10].id | https://openalex.org/keywords/algorithm |
| keywords[10].score | 0.3616430163383484 |
| keywords[10].display_name | Algorithm |
| keywords[11].id | https://openalex.org/keywords/mathematical-optimization |
| keywords[11].score | 0.2861745357513428 |
| keywords[11].display_name | Mathematical optimization |
| keywords[12].id | https://openalex.org/keywords/parallel-computing |
| keywords[12].score | 0.2753157615661621 |
| keywords[12].display_name | Parallel computing |
| keywords[13].id | https://openalex.org/keywords/mathematics |
| keywords[13].score | 0.26431477069854736 |
| keywords[13].display_name | Mathematics |
| keywords[14].id | https://openalex.org/keywords/rate-monotonic-scheduling |
| keywords[14].score | 0.26310229301452637 |
| keywords[14].display_name | Rate-monotonic scheduling |
| keywords[15].id | https://openalex.org/keywords/statistics |
| keywords[15].score | 0.09951275587081909 |
| keywords[15].display_name | Statistics |
| keywords[16].id | https://openalex.org/keywords/engineering |
| keywords[16].score | 0.09139823913574219 |
| keywords[16].display_name | Engineering |
| keywords[17].id | https://openalex.org/keywords/quality-of-service |
| keywords[17].score | 0.0757865309715271 |
| keywords[17].display_name | Quality of service |
| keywords[18].id | https://openalex.org/keywords/computer-network |
| keywords[18].score | 0.07405894994735718 |
| keywords[18].display_name | Computer network |
| language | en |
| locations[0].id | doi:10.1145/3139258.3139273 |
| locations[0].is_oa | True |
| locations[0].source | |
| locations[0].license | |
| locations[0].pdf_url | http://dl.acm.org/ft_gateway.cfm?id=3139273&type=pdf |
| locations[0].version | publishedVersion |
| locations[0].raw_type | proceedings-article |
| locations[0].license_id | |
| locations[0].is_accepted | True |
| locations[0].is_published | True |
| locations[0].raw_source_name | Proceedings of the 25th International Conference on Real-Time Networks and Systems |
| locations[0].landing_page_url | https://doi.org/10.1145/3139258.3139273 |
| indexed_in | crossref |
| authorships[0].author.id | https://openalex.org/A5004024181 |
| authorships[0].author.orcid | https://orcid.org/0000-0002-8137-3612 |
| authorships[0].author.display_name | Georg von der Brüggen |
| authorships[0].countries | DE |
| authorships[0].affiliations[0].institution_ids | https://openalex.org/I200332995 |
| authorships[0].affiliations[0].raw_affiliation_string | TU Dortmund University, Germany |
| authorships[0].institutions[0].id | https://openalex.org/I200332995 |
| authorships[0].institutions[0].ror | https://ror.org/01k97gp34 |
| authorships[0].institutions[0].type | education |
| authorships[0].institutions[0].lineage | https://openalex.org/I200332995 |
| authorships[0].institutions[0].country_code | DE |
| authorships[0].institutions[0].display_name | TU Dortmund University |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Georg von der Brüggen |
| authorships[0].is_corresponding | False |
| authorships[0].raw_affiliation_strings | TU Dortmund University, Germany |
| authorships[1].author.id | https://openalex.org/A5081007355 |
| authorships[1].author.orcid | https://orcid.org/0000-0002-6722-4805 |
| authorships[1].author.display_name | Niklas Ueter |
| authorships[1].countries | DE |
| authorships[1].affiliations[0].institution_ids | https://openalex.org/I200332995 |
| authorships[1].affiliations[0].raw_affiliation_string | TU Dortmund University, Germany |
| authorships[1].institutions[0].id | https://openalex.org/I200332995 |
| authorships[1].institutions[0].ror | https://ror.org/01k97gp34 |
| authorships[1].institutions[0].type | education |
| authorships[1].institutions[0].lineage | https://openalex.org/I200332995 |
| authorships[1].institutions[0].country_code | DE |
| authorships[1].institutions[0].display_name | TU Dortmund University |
| authorships[1].author_position | middle |
| authorships[1].raw_author_name | Niklas Ueter |
| authorships[1].is_corresponding | False |
| authorships[1].raw_affiliation_strings | TU Dortmund University, Germany |
| authorships[2].author.id | https://openalex.org/A5000417436 |
| authorships[2].author.orcid | https://orcid.org/0000-0001-8114-9760 |
| authorships[2].author.display_name | Jian-Jia Chen |
| authorships[2].countries | DE |
| authorships[2].affiliations[0].institution_ids | https://openalex.org/I200332995 |
| authorships[2].affiliations[0].raw_affiliation_string | TU Dortmund University, Germany |
| authorships[2].institutions[0].id | https://openalex.org/I200332995 |
| authorships[2].institutions[0].ror | https://ror.org/01k97gp34 |
| authorships[2].institutions[0].type | education |
| authorships[2].institutions[0].lineage | https://openalex.org/I200332995 |
| authorships[2].institutions[0].country_code | DE |
| authorships[2].institutions[0].display_name | TU Dortmund University |
| authorships[2].author_position | middle |
| authorships[2].raw_author_name | Jian-Jia Chen |
| authorships[2].is_corresponding | False |
| authorships[2].raw_affiliation_strings | TU Dortmund University, Germany |
| authorships[3].author.id | https://openalex.org/A5085573622 |
| authorships[3].author.orcid | |
| authorships[3].author.display_name | Matthias Freier |
| authorships[3].countries | DE |
| authorships[3].affiliations[0].institution_ids | https://openalex.org/I889804353 |
| authorships[3].affiliations[0].raw_affiliation_string | Robert Bosch GmbH, Germany |
| authorships[3].institutions[0].id | https://openalex.org/I889804353 |
| authorships[3].institutions[0].ror | https://ror.org/01fe0jt45 |
| authorships[3].institutions[0].type | company |
| authorships[3].institutions[0].lineage | https://openalex.org/I889804353 |
| authorships[3].institutions[0].country_code | DE |
| authorships[3].institutions[0].display_name | Robert Bosch (Germany) |
| authorships[3].author_position | last |
| authorships[3].raw_author_name | Matthias Freier |
| authorships[3].is_corresponding | False |
| authorships[3].raw_affiliation_strings | Robert Bosch GmbH, Germany |
| has_content.pdf | True |
| has_content.grobid_xml | True |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | http://dl.acm.org/ft_gateway.cfm?id=3139273&type=pdf |
| open_access.oa_status | gold |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | Parametric utilization bounds for implicit-deadline periodic tasks in automotive systems |
| has_fulltext | True |
| is_retracted | False |
| updated_date | 2025-11-06T03:46:38.306776 |
| primary_topic.id | https://openalex.org/T10933 |
| primary_topic.field.id | https://openalex.org/fields/17 |
| primary_topic.field.display_name | Computer Science |
| primary_topic.score | 0.9998999834060669 |
| primary_topic.domain.id | https://openalex.org/domains/3 |
| primary_topic.domain.display_name | Physical Sciences |
| primary_topic.subfield.id | https://openalex.org/subfields/1708 |
| primary_topic.subfield.display_name | Hardware and Architecture |
| primary_topic.display_name | Real-Time Systems Scheduling |
| related_works | https://openalex.org/W2172075652, https://openalex.org/W2001066483, https://openalex.org/W2605049164, https://openalex.org/W4381889969, https://openalex.org/W160191800, https://openalex.org/W1712986213, https://openalex.org/W2017977262, https://openalex.org/W56912691, https://openalex.org/W2021072488, https://openalex.org/W2392720076 |
| cited_by_count | 17 |
| counts_by_year[0].year | 2025 |
| counts_by_year[0].cited_by_count | 1 |
| counts_by_year[1].year | 2024 |
| counts_by_year[1].cited_by_count | 1 |
| counts_by_year[2].year | 2023 |
| counts_by_year[2].cited_by_count | 5 |
| counts_by_year[3].year | 2022 |
| counts_by_year[3].cited_by_count | 3 |
| counts_by_year[4].year | 2021 |
| counts_by_year[4].cited_by_count | 3 |
| counts_by_year[5].year | 2019 |
| counts_by_year[5].cited_by_count | 3 |
| counts_by_year[6].year | 2018 |
| counts_by_year[6].cited_by_count | 1 |
| locations_count | 1 |
| best_oa_location.id | doi:10.1145/3139258.3139273 |
| best_oa_location.is_oa | True |
| best_oa_location.source | |
| best_oa_location.license | |
| best_oa_location.pdf_url | http://dl.acm.org/ft_gateway.cfm?id=3139273&type=pdf |
| best_oa_location.version | publishedVersion |
| best_oa_location.raw_type | proceedings-article |
| best_oa_location.license_id | |
| best_oa_location.is_accepted | True |
| best_oa_location.is_published | True |
| best_oa_location.raw_source_name | Proceedings of the 25th International Conference on Real-Time Networks and Systems |
| best_oa_location.landing_page_url | https://doi.org/10.1145/3139258.3139273 |
| primary_location.id | doi:10.1145/3139258.3139273 |
| primary_location.is_oa | True |
| primary_location.source | |
| primary_location.license | |
| primary_location.pdf_url | http://dl.acm.org/ft_gateway.cfm?id=3139273&type=pdf |
| primary_location.version | publishedVersion |
| primary_location.raw_type | proceedings-article |
| primary_location.license_id | |
| primary_location.is_accepted | True |
| primary_location.is_published | True |
| primary_location.raw_source_name | Proceedings of the 25th International Conference on Real-Time Networks and Systems |
| primary_location.landing_page_url | https://doi.org/10.1145/3139258.3139273 |
| publication_date | 2017-10-04 |
| publication_year | 2017 |
| referenced_works | https://openalex.org/W2100916410, https://openalex.org/W6682435308, https://openalex.org/W2103779723, https://openalex.org/W2141440050, https://openalex.org/W2050243060, https://openalex.org/W2101300711, https://openalex.org/W1548943549, https://openalex.org/W117294625, https://openalex.org/W2732085181, https://openalex.org/W2119167559, https://openalex.org/W1990736330, https://openalex.org/W2238437571, https://openalex.org/W2732844046, https://openalex.org/W1897207918, https://openalex.org/W2154025706, https://openalex.org/W2168413716, https://openalex.org/W2106202950, https://openalex.org/W2166440675, https://openalex.org/W2109488193, https://openalex.org/W1485093219, https://openalex.org/W2056702206, https://openalex.org/W2533716739, https://openalex.org/W1559423447, https://openalex.org/W2467474306, https://openalex.org/W2488924876, https://openalex.org/W1803225612, https://openalex.org/W2132965669, https://openalex.org/W1539685208, https://openalex.org/W4256440870, https://openalex.org/W4206295086, https://openalex.org/W4236360319, https://openalex.org/W2151110287, https://openalex.org/W2543632133, https://openalex.org/W1520445676, https://openalex.org/W2170148670, https://openalex.org/W4301503084 |
| referenced_works_count | 36 |
| abstract_inverted_index.+ | 51 |
| abstract_inverted_index.0 | 75 |
| abstract_inverted_index.1 | 134 |
| abstract_inverted_index.a | 28, 45, 66 |
| abstract_inverted_index.z | 52, 64, 77 |
| abstract_inverted_index.1, | 32 |
| abstract_inverted_index.2, | 33 |
| abstract_inverted_index.5, | 34 |
| abstract_inverted_index.It | 151 |
| abstract_inverted_index.We | 43, 112 |
| abstract_inverted_index.an | 86, 91 |
| abstract_inverted_index.be | 121 |
| abstract_inverted_index.by | 69, 97, 145 |
| abstract_inverted_index.if | 125 |
| abstract_inverted_index.in | 6, 20, 154, 182 |
| abstract_inverted_index.is | 30, 65, 132, 152 |
| abstract_inverted_index.of | 27, 49, 129, 169 |
| abstract_inverted_index.or | 40 |
| abstract_inverted_index.to | 84, 107, 163, 172 |
| abstract_inverted_index.we | 81, 103 |
| abstract_inverted_index.10, | 35 |
| abstract_inverted_index.20, | 36 |
| abstract_inverted_index.50, | 37 |
| abstract_inverted_index.90% | 50 |
| abstract_inverted_index.The | 136 |
| abstract_inverted_index.all | 130 |
| abstract_inverted_index.are | 140 |
| abstract_inverted_index.can | 119, 176 |
| abstract_inverted_index.for | 16, 53, 90 |
| abstract_inverted_index.has | 2 |
| abstract_inverted_index.how | 83 |
| abstract_inverted_index.our | 105 |
| abstract_inverted_index.set | 73, 94 |
| abstract_inverted_index.the | 12, 25, 70, 126, 147, 155, 173, 179 |
| abstract_inverted_index.≤ | 76, 78 |
| abstract_inverted_index.10%. | 79 |
| abstract_inverted_index.100, | 38 |
| abstract_inverted_index.1000 | 41 |
| abstract_inverted_index.200, | 39 |
| abstract_inverted_index.RM-P | 96 |
| abstract_inverted_index.This | 9 |
| abstract_inverted_index.been | 3 |
| abstract_inverted_index.here | 139 |
| abstract_inverted_index.only | 99 |
| abstract_inverted_index.show | 113 |
| abstract_inverted_index.some | 183 |
| abstract_inverted_index.such | 54 |
| abstract_inverted_index.task | 29, 56, 72, 93 |
| abstract_inverted_index.test | 89 |
| abstract_inverted_index.that | 114, 157 |
| abstract_inverted_index.them | 171 |
| abstract_inverted_index.time | 128, 167 |
| abstract_inverted_index.used | 5 |
| abstract_inverted_index.very | 115 |
| abstract_inverted_index.with | 74, 142 |
| abstract_inverted_index.RM-NP | 124 |
| abstract_inverted_index.below | 133 |
| abstract_inverted_index.bound | 48 |
| abstract_inverted_index.exact | 87 |
| abstract_inverted_index.input | 71 |
| abstract_inverted_index.paper | 10 |
| abstract_inverted_index.prove | 44 |
| abstract_inverted_index.ratio | 181 |
| abstract_inverted_index.shown | 153 |
| abstract_inverted_index.still | 120 |
| abstract_inverted_index.tasks | 19, 131, 144, 161 |
| abstract_inverted_index.their | 164 |
| abstract_inverted_index.those | 159 |
| abstract_inverted_index.three | 100 |
| abstract_inverted_index.under | 58, 95, 123 |
| abstract_inverted_index.where | 24, 63 |
| abstract_inverted_index.bounds | 15 |
| abstract_inverted_index.either | 31 |
| abstract_inverted_index.extend | 104 |
| abstract_inverted_index.period | 26 |
| abstract_inverted_index.values | 118 |
| abstract_inverted_index.widely | 4 |
| abstract_inverted_index.(RM-P), | 62 |
| abstract_inverted_index.arrival | 149 |
| abstract_inverted_index.curves. | 150 |
| abstract_inverted_index.defined | 68 |
| abstract_inverted_index.explain | 82 |
| abstract_inverted_index.highest | 174 |
| abstract_inverted_index.instead | 168 |
| abstract_inverted_index.minimum | 165 |
| abstract_inverted_index.perform | 85 |
| abstract_inverted_index.related | 148 |
| abstract_inverted_index.systems | 57 |
| abstract_inverted_index.(RM-NP). | 111 |
| abstract_inverted_index.achieved | 122 |
| abstract_inverted_index.analyses | 106, 137 |
| abstract_inverted_index.applying | 146 |
| abstract_inverted_index.explores | 11 |
| abstract_inverted_index.increase | 178 |
| abstract_inverted_index.periodic | 18 |
| abstract_inverted_index.priority | 175 |
| abstract_inverted_index.systems, | 23 |
| abstract_inverted_index.Moreover, | 80 |
| abstract_inverted_index.according | 162 |
| abstract_inverted_index.assigning | 170 |
| abstract_inverted_index.execution | 127 |
| abstract_inverted_index.parameter | 67 |
| abstract_inverted_index.presented | 138 |
| abstract_inverted_index.settings. | 184 |
| abstract_inverted_index.acceptance | 180 |
| abstract_inverted_index.automotive | 21, 55, 92 |
| abstract_inverted_index.compatible | 141 |
| abstract_inverted_index.parametric | 13, 46 |
| abstract_inverted_index.preemptive | 60 |
| abstract_inverted_index.reasonable | 116 |
| abstract_inverted_index.scheduling | 1, 61, 110, 158 |
| abstract_inverted_index.validating | 98 |
| abstract_inverted_index.conditions. | 101 |
| abstract_inverted_index.drastically | 177 |
| abstract_inverted_index.evaluations | 156 |
| abstract_inverted_index.utilization | 14, 47, 117 |
| abstract_inverted_index.Furthermore, | 102 |
| abstract_inverted_index.millisecond. | 135 |
| abstract_inverted_index.uniprocessor | 22 |
| abstract_inverted_index.applications. | 8 |
| abstract_inverted_index.inter-arrival | 166 |
| abstract_inverted_index.milliseconds. | 42 |
| abstract_inverted_index.Fixed-priority | 0 |
| abstract_inverted_index.non-preemptive | 109 |
| abstract_inverted_index.rate-monotonic | 59, 108 |
| abstract_inverted_index.schedulability | 88 |
| abstract_inverted_index.safety-critical | 7 |
| abstract_inverted_index.angle-synchronous | 143, 160 |
| abstract_inverted_index.implicit-deadline | 17 |
| cited_by_percentile_year.max | 98 |
| cited_by_percentile_year.min | 90 |
| countries_distinct_count | 1 |
| institutions_distinct_count | 4 |
| citation_normalized_percentile.value | 0.75964745 |
| citation_normalized_percentile.is_in_top_1_percent | False |
| citation_normalized_percentile.is_in_top_10_percent | False |