Reservation-Based Federated Scheduling for Parallel Real-Time Tasks Article Swipe
Niklas Ueter
,
Georg von der Brüggen
,
Jian-Jia Chen
,
Jing Li
,
Kunal Agrawal
·
YOU?
·
· 2018
· Open Access
·
· DOI: https://doi.org/10.1109/rtss.2018.00061
YOU?
·
· 2018
· Open Access
·
· DOI: https://doi.org/10.1109/rtss.2018.00061
This paper considers the scheduling of parallel real-time tasks with arbitrary-deadlines. Each job of a parallel task is described as a directed acyclic graph (DAG). In contrast to prior work in this area, where decomposition-based scheduling algorithms are proposed based on the DAG-structure and inter-task interference is analyzed as self-suspending behavior, this paper generalizes the federated scheduling approach. We propose a reservation-based algorithm, called reservation-based federated scheduling, that dominates federated scheduling. We provide general constraints for the design of such systems and prove that reservation-based federated scheduling has a constant speedup factor with respect to any optimal DAG task scheduler. Furthermore, the presented algorithm can be used in conjunction with any scheduler and scheduling analysis suitable for ordinary arbitrary-deadline sporadic task sets, i.e., without parallelism.
Related Topics
Concepts
Computer science
Parallel computing
Directed acyclic graph
Scheduling (production processes)
Fixed-priority pre-emptive scheduling
Distributed computing
Dynamic priority scheduling
Rate-monotonic scheduling
Reservation
Fair-share scheduling
Two-level scheduling
Earliest deadline first scheduling
Algorithm
Mathematical optimization
Computer network
Mathematics
Quality of service
Metadata
- Type
- preprint
- Language
- en
- Landing Page
- https://doi.org/10.1109/rtss.2018.00061
- OA Status
- green
- Cited By
- 2
- References
- 42
- Related Works
- 20
- OpenAlex ID
- https://openalex.org/W2773202681
All OpenAlex metadata
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W2773202681Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.1109/rtss.2018.00061Digital Object Identifier
- Title
-
Reservation-Based Federated Scheduling for Parallel Real-Time TasksWork title
- Type
-
preprintOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2018Year of publication
- Publication date
-
2018-12-01Full publication date if available
- Authors
-
Niklas Ueter, Georg von der Brüggen, Jian-Jia Chen, Jing Li, Kunal AgrawalList of authors in order
- Landing page
-
https://doi.org/10.1109/rtss.2018.00061Publisher landing page
- Open access
-
YesWhether a free full text is available
- OA status
-
greenOpen access status per OpenAlex
- OA URL
-
https://arxiv.org/pdf/1712.05040Direct OA link when available
- Concepts
-
Computer science, Parallel computing, Directed acyclic graph, Scheduling (production processes), Fixed-priority pre-emptive scheduling, Distributed computing, Dynamic priority scheduling, Rate-monotonic scheduling, Reservation, Fair-share scheduling, Two-level scheduling, Earliest deadline first scheduling, Algorithm, Mathematical optimization, Computer network, Mathematics, Quality of serviceTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
2Total citation count in OpenAlex
- Citations by year (recent)
-
2021: 1, 2018: 1Per-year citation counts (last 5 years)
- References (count)
-
42Number of works referenced by this work
- Related works (count)
-
20Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W2773202681 |
|---|---|
| doi | https://doi.org/10.1109/rtss.2018.00061 |
| ids.doi | https://doi.org/10.1109/rtss.2018.00061 |
| ids.mag | 2773202681 |
| ids.openalex | https://openalex.org/W2773202681 |
| fwci | 0.59564334 |
| type | preprint |
| title | Reservation-Based Federated Scheduling for Parallel Real-Time Tasks |
| biblio.issue | |
| biblio.volume | |
| biblio.last_page | 494 |
| biblio.first_page | 482 |
| 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.9995999932289124 |
| 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/T10829 |
| topics[1].field.id | https://openalex.org/fields/17 |
| topics[1].field.display_name | Computer Science |
| topics[1].score | 0.9846000075340271 |
| topics[1].domain.id | https://openalex.org/domains/3 |
| topics[1].domain.display_name | Physical Sciences |
| topics[1].subfield.id | https://openalex.org/subfields/1705 |
| topics[1].subfield.display_name | Computer Networks and Communications |
| topics[1].display_name | Interconnection Networks and Systems |
| topics[2].id | https://openalex.org/T10772 |
| topics[2].field.id | https://openalex.org/fields/17 |
| topics[2].field.display_name | Computer Science |
| topics[2].score | 0.9765999913215637 |
| topics[2].domain.id | https://openalex.org/domains/3 |
| topics[2].domain.display_name | Physical Sciences |
| topics[2].subfield.id | https://openalex.org/subfields/1705 |
| topics[2].subfield.display_name | Computer Networks and Communications |
| topics[2].display_name | Distributed systems and fault tolerance |
| is_xpac | False |
| apc_list | |
| apc_paid | |
| concepts[0].id | https://openalex.org/C41008148 |
| concepts[0].level | 0 |
| concepts[0].score | 0.847392201423645 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[0].display_name | Computer science |
| concepts[1].id | https://openalex.org/C173608175 |
| concepts[1].level | 1 |
| concepts[1].score | 0.6689991354942322 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q232661 |
| concepts[1].display_name | Parallel computing |
| concepts[2].id | https://openalex.org/C74197172 |
| concepts[2].level | 2 |
| concepts[2].score | 0.651085376739502 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q1195339 |
| concepts[2].display_name | Directed acyclic graph |
| concepts[3].id | https://openalex.org/C206729178 |
| concepts[3].level | 2 |
| concepts[3].score | 0.629684567451477 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q2271896 |
| concepts[3].display_name | Scheduling (production processes) |
| concepts[4].id | https://openalex.org/C122141398 |
| concepts[4].level | 5 |
| concepts[4].score | 0.6284964680671692 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q5456330 |
| concepts[4].display_name | Fixed-priority pre-emptive scheduling |
| concepts[5].id | https://openalex.org/C120314980 |
| concepts[5].level | 1 |
| concepts[5].score | 0.5892531871795654 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q180634 |
| concepts[5].display_name | Distributed computing |
| concepts[6].id | https://openalex.org/C107568181 |
| concepts[6].level | 3 |
| concepts[6].score | 0.5506512522697449 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q5319000 |
| concepts[6].display_name | Dynamic priority scheduling |
| concepts[7].id | https://openalex.org/C127456818 |
| concepts[7].level | 4 |
| concepts[7].score | 0.5138154625892639 |
| concepts[7].wikidata | https://www.wikidata.org/wiki/Q238879 |
| concepts[7].display_name | Rate-monotonic scheduling |
| concepts[8].id | https://openalex.org/C2777632111 |
| concepts[8].level | 2 |
| concepts[8].score | 0.5134745240211487 |
| concepts[8].wikidata | https://www.wikidata.org/wiki/Q1937518 |
| concepts[8].display_name | Reservation |
| concepts[9].id | https://openalex.org/C31689143 |
| concepts[9].level | 3 |
| concepts[9].score | 0.5106917023658752 |
| concepts[9].wikidata | https://www.wikidata.org/wiki/Q733809 |
| concepts[9].display_name | Fair-share scheduling |
| concepts[10].id | https://openalex.org/C119948110 |
| concepts[10].level | 4 |
| concepts[10].score | 0.49956274032592773 |
| concepts[10].wikidata | https://www.wikidata.org/wiki/Q7858726 |
| concepts[10].display_name | Two-level scheduling |
| concepts[11].id | https://openalex.org/C32310161 |
| concepts[11].level | 5 |
| concepts[11].score | 0.48559731245040894 |
| concepts[11].wikidata | https://www.wikidata.org/wiki/Q666365 |
| concepts[11].display_name | Earliest deadline first scheduling |
| concepts[12].id | https://openalex.org/C11413529 |
| concepts[12].level | 1 |
| concepts[12].score | 0.24127477407455444 |
| concepts[12].wikidata | https://www.wikidata.org/wiki/Q8366 |
| concepts[12].display_name | Algorithm |
| concepts[13].id | https://openalex.org/C126255220 |
| concepts[13].level | 1 |
| concepts[13].score | 0.1714019775390625 |
| concepts[13].wikidata | https://www.wikidata.org/wiki/Q141495 |
| concepts[13].display_name | Mathematical optimization |
| concepts[14].id | https://openalex.org/C31258907 |
| concepts[14].level | 1 |
| concepts[14].score | 0.1514294147491455 |
| concepts[14].wikidata | https://www.wikidata.org/wiki/Q1301371 |
| concepts[14].display_name | Computer network |
| concepts[15].id | https://openalex.org/C33923547 |
| concepts[15].level | 0 |
| concepts[15].score | 0.0935145914554596 |
| concepts[15].wikidata | https://www.wikidata.org/wiki/Q395 |
| concepts[15].display_name | Mathematics |
| concepts[16].id | https://openalex.org/C5119721 |
| concepts[16].level | 2 |
| concepts[16].score | 0.06547608971595764 |
| concepts[16].wikidata | https://www.wikidata.org/wiki/Q220501 |
| concepts[16].display_name | Quality of service |
| keywords[0].id | https://openalex.org/keywords/computer-science |
| keywords[0].score | 0.847392201423645 |
| keywords[0].display_name | Computer science |
| keywords[1].id | https://openalex.org/keywords/parallel-computing |
| keywords[1].score | 0.6689991354942322 |
| keywords[1].display_name | Parallel computing |
| keywords[2].id | https://openalex.org/keywords/directed-acyclic-graph |
| keywords[2].score | 0.651085376739502 |
| keywords[2].display_name | Directed acyclic graph |
| keywords[3].id | https://openalex.org/keywords/scheduling |
| keywords[3].score | 0.629684567451477 |
| keywords[3].display_name | Scheduling (production processes) |
| keywords[4].id | https://openalex.org/keywords/fixed-priority-pre-emptive-scheduling |
| keywords[4].score | 0.6284964680671692 |
| keywords[4].display_name | Fixed-priority pre-emptive scheduling |
| keywords[5].id | https://openalex.org/keywords/distributed-computing |
| keywords[5].score | 0.5892531871795654 |
| keywords[5].display_name | Distributed computing |
| keywords[6].id | https://openalex.org/keywords/dynamic-priority-scheduling |
| keywords[6].score | 0.5506512522697449 |
| keywords[6].display_name | Dynamic priority scheduling |
| keywords[7].id | https://openalex.org/keywords/rate-monotonic-scheduling |
| keywords[7].score | 0.5138154625892639 |
| keywords[7].display_name | Rate-monotonic scheduling |
| keywords[8].id | https://openalex.org/keywords/reservation |
| keywords[8].score | 0.5134745240211487 |
| keywords[8].display_name | Reservation |
| keywords[9].id | https://openalex.org/keywords/fair-share-scheduling |
| keywords[9].score | 0.5106917023658752 |
| keywords[9].display_name | Fair-share scheduling |
| keywords[10].id | https://openalex.org/keywords/two-level-scheduling |
| keywords[10].score | 0.49956274032592773 |
| keywords[10].display_name | Two-level scheduling |
| keywords[11].id | https://openalex.org/keywords/earliest-deadline-first-scheduling |
| keywords[11].score | 0.48559731245040894 |
| keywords[11].display_name | Earliest deadline first scheduling |
| keywords[12].id | https://openalex.org/keywords/algorithm |
| keywords[12].score | 0.24127477407455444 |
| keywords[12].display_name | Algorithm |
| keywords[13].id | https://openalex.org/keywords/mathematical-optimization |
| keywords[13].score | 0.1714019775390625 |
| keywords[13].display_name | Mathematical optimization |
| keywords[14].id | https://openalex.org/keywords/computer-network |
| keywords[14].score | 0.1514294147491455 |
| keywords[14].display_name | Computer network |
| keywords[15].id | https://openalex.org/keywords/mathematics |
| keywords[15].score | 0.0935145914554596 |
| keywords[15].display_name | Mathematics |
| keywords[16].id | https://openalex.org/keywords/quality-of-service |
| keywords[16].score | 0.06547608971595764 |
| keywords[16].display_name | Quality of service |
| language | en |
| locations[0].id | doi:10.1109/rtss.2018.00061 |
| locations[0].is_oa | False |
| locations[0].source | |
| locations[0].license | |
| locations[0].pdf_url | |
| 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 | 2018 IEEE Real-Time Systems Symposium (RTSS) |
| locations[0].landing_page_url | https://doi.org/10.1109/rtss.2018.00061 |
| locations[1].id | pmh:oai:arXiv.org:1712.05040 |
| locations[1].is_oa | True |
| locations[1].source.id | https://openalex.org/S4306400194 |
| locations[1].source.issn | |
| locations[1].source.type | repository |
| locations[1].source.is_oa | True |
| locations[1].source.issn_l | |
| locations[1].source.is_core | False |
| locations[1].source.is_in_doaj | False |
| locations[1].source.display_name | arXiv (Cornell University) |
| locations[1].source.host_organization | https://openalex.org/I205783295 |
| locations[1].source.host_organization_name | Cornell University |
| locations[1].source.host_organization_lineage | https://openalex.org/I205783295 |
| locations[1].license | |
| locations[1].pdf_url | https://arxiv.org/pdf/1712.05040 |
| locations[1].version | submittedVersion |
| locations[1].raw_type | |
| locations[1].license_id | |
| locations[1].is_accepted | False |
| locations[1].is_published | False |
| locations[1].raw_source_name | |
| locations[1].landing_page_url | http://arxiv.org/abs/1712.05040 |
| locations[2].id | mag:2773202681 |
| locations[2].is_oa | True |
| locations[2].source.id | https://openalex.org/S4306400194 |
| locations[2].source.issn | |
| locations[2].source.type | repository |
| locations[2].source.is_oa | True |
| locations[2].source.issn_l | |
| locations[2].source.is_core | False |
| locations[2].source.is_in_doaj | False |
| locations[2].source.display_name | arXiv (Cornell University) |
| locations[2].source.host_organization | https://openalex.org/I205783295 |
| locations[2].source.host_organization_name | Cornell University |
| locations[2].source.host_organization_lineage | https://openalex.org/I205783295 |
| locations[2].license | |
| locations[2].pdf_url | |
| locations[2].version | submittedVersion |
| locations[2].raw_type | |
| locations[2].license_id | |
| locations[2].is_accepted | False |
| locations[2].is_published | False |
| locations[2].raw_source_name | arXiv (Cornell University) |
| locations[2].landing_page_url | https://arxiv.org/pdf/1712.05040 |
| locations[3].id | doi:10.48550/arxiv.1712.05040 |
| locations[3].is_oa | True |
| locations[3].source.id | https://openalex.org/S4306400194 |
| locations[3].source.issn | |
| locations[3].source.type | repository |
| locations[3].source.is_oa | True |
| locations[3].source.issn_l | |
| locations[3].source.is_core | False |
| locations[3].source.is_in_doaj | False |
| locations[3].source.display_name | arXiv (Cornell University) |
| locations[3].source.host_organization | https://openalex.org/I205783295 |
| locations[3].source.host_organization_name | Cornell University |
| locations[3].source.host_organization_lineage | https://openalex.org/I205783295 |
| locations[3].license | |
| locations[3].pdf_url | |
| locations[3].version | |
| locations[3].raw_type | article |
| locations[3].license_id | |
| locations[3].is_accepted | False |
| locations[3].is_published | |
| locations[3].raw_source_name | |
| locations[3].landing_page_url | https://doi.org/10.48550/arxiv.1712.05040 |
| indexed_in | arxiv, crossref, datacite |
| authorships[0].author.id | https://openalex.org/A5081007355 |
| authorships[0].author.orcid | https://orcid.org/0000-0002-6722-4805 |
| authorships[0].author.display_name | Niklas Ueter |
| authorships[0].countries | DE |
| authorships[0].affiliations[0].institution_ids | https://openalex.org/I200332995 |
| authorships[0].affiliations[0].raw_affiliation_string | Dortmund University |
| 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 | Niklas Ueter |
| authorships[0].is_corresponding | False |
| authorships[0].raw_affiliation_strings | Dortmund University |
| authorships[1].author.id | https://openalex.org/A5004024181 |
| authorships[1].author.orcid | https://orcid.org/0000-0002-8137-3612 |
| authorships[1].author.display_name | Georg von der Brüggen |
| authorships[1].countries | DE |
| authorships[1].affiliations[0].institution_ids | https://openalex.org/I200332995 |
| authorships[1].affiliations[0].raw_affiliation_string | Dortmund University |
| 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 | Georg von der Brüggen |
| authorships[1].is_corresponding | False |
| authorships[1].raw_affiliation_strings | Dortmund University |
| 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 | Dortmund University |
| 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 | Dortmund University |
| authorships[3].author.id | https://openalex.org/A5100336972 |
| authorships[3].author.orcid | https://orcid.org/0000-0002-6865-7290 |
| authorships[3].author.display_name | Jing Li |
| authorships[3].countries | US |
| authorships[3].affiliations[0].institution_ids | https://openalex.org/I118118575 |
| authorships[3].affiliations[0].raw_affiliation_string | New Jersey Institute of Technology, Newark, United States |
| authorships[3].institutions[0].id | https://openalex.org/I118118575 |
| authorships[3].institutions[0].ror | https://ror.org/05e74xb87 |
| authorships[3].institutions[0].type | education |
| authorships[3].institutions[0].lineage | https://openalex.org/I118118575 |
| authorships[3].institutions[0].country_code | US |
| authorships[3].institutions[0].display_name | New Jersey Institute of Technology |
| authorships[3].author_position | middle |
| authorships[3].raw_author_name | Jing Li |
| authorships[3].is_corresponding | False |
| authorships[3].raw_affiliation_strings | New Jersey Institute of Technology, Newark, United States |
| authorships[4].author.id | https://openalex.org/A5035990793 |
| authorships[4].author.orcid | https://orcid.org/0000-0001-5882-6647 |
| authorships[4].author.display_name | Kunal Agrawal |
| authorships[4].countries | US |
| authorships[4].affiliations[0].institution_ids | https://openalex.org/I204465549 |
| authorships[4].affiliations[0].raw_affiliation_string | Washington University St. Louis |
| authorships[4].institutions[0].id | https://openalex.org/I204465549 |
| authorships[4].institutions[0].ror | https://ror.org/01yc7t268 |
| authorships[4].institutions[0].type | education |
| authorships[4].institutions[0].lineage | https://openalex.org/I204465549 |
| authorships[4].institutions[0].country_code | US |
| authorships[4].institutions[0].display_name | Washington University in St. Louis |
| authorships[4].author_position | last |
| authorships[4].raw_author_name | Kunal Agrawal |
| authorships[4].is_corresponding | False |
| authorships[4].raw_affiliation_strings | Washington University St. Louis |
| has_content.pdf | True |
| has_content.grobid_xml | True |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://arxiv.org/pdf/1712.05040 |
| open_access.oa_status | green |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | Reservation-Based Federated Scheduling for Parallel Real-Time Tasks |
| has_fulltext | False |
| 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.9995999932289124 |
| 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/W2081746076, https://openalex.org/W2236640451, https://openalex.org/W2946406471, https://openalex.org/W2731107721, https://openalex.org/W3199513229, https://openalex.org/W3005757277, https://openalex.org/W2569164022, https://openalex.org/W2890277969, https://openalex.org/W2904373510, https://openalex.org/W2092933369, https://openalex.org/W2008659392, https://openalex.org/W2163341385, https://openalex.org/W2155518256, https://openalex.org/W2164422072, https://openalex.org/W2157417303, https://openalex.org/W2566936944, https://openalex.org/W2343962288, https://openalex.org/W2155613651, https://openalex.org/W2090822559, https://openalex.org/W2128426273 |
| cited_by_count | 2 |
| counts_by_year[0].year | 2021 |
| counts_by_year[0].cited_by_count | 1 |
| counts_by_year[1].year | 2018 |
| counts_by_year[1].cited_by_count | 1 |
| locations_count | 4 |
| best_oa_location.id | pmh:oai:arXiv.org:1712.05040 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S4306400194 |
| best_oa_location.source.issn | |
| best_oa_location.source.type | repository |
| best_oa_location.source.is_oa | True |
| best_oa_location.source.issn_l | |
| best_oa_location.source.is_core | False |
| best_oa_location.source.is_in_doaj | False |
| best_oa_location.source.display_name | arXiv (Cornell University) |
| best_oa_location.source.host_organization | https://openalex.org/I205783295 |
| best_oa_location.source.host_organization_name | Cornell University |
| best_oa_location.source.host_organization_lineage | https://openalex.org/I205783295 |
| best_oa_location.license | |
| best_oa_location.pdf_url | https://arxiv.org/pdf/1712.05040 |
| best_oa_location.version | submittedVersion |
| best_oa_location.raw_type | |
| best_oa_location.license_id | |
| best_oa_location.is_accepted | False |
| best_oa_location.is_published | False |
| best_oa_location.raw_source_name | |
| best_oa_location.landing_page_url | http://arxiv.org/abs/1712.05040 |
| primary_location.id | doi:10.1109/rtss.2018.00061 |
| primary_location.is_oa | False |
| primary_location.source | |
| primary_location.license | |
| primary_location.pdf_url | |
| 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 | 2018 IEEE Real-Time Systems Symposium (RTSS) |
| primary_location.landing_page_url | https://doi.org/10.1109/rtss.2018.00061 |
| publication_date | 2018-12-01 |
| publication_year | 2018 |
| referenced_works | https://openalex.org/W2121607363, https://openalex.org/W4231383420, https://openalex.org/W2107369300, https://openalex.org/W2571531751, https://openalex.org/W2081746076, https://openalex.org/W2090822559, https://openalex.org/W1982587869, https://openalex.org/W2472903488, https://openalex.org/W1625622590, https://openalex.org/W1575939710, https://openalex.org/W6638363920, https://openalex.org/W2105956384, https://openalex.org/W2046941316, https://openalex.org/W1977289603, https://openalex.org/W2032139654, https://openalex.org/W2236640451, https://openalex.org/W2963776327, https://openalex.org/W2076037617, https://openalex.org/W6741061005, https://openalex.org/W2012173880, https://openalex.org/W1599063719, https://openalex.org/W6731563088, https://openalex.org/W6648414864, https://openalex.org/W1615714516, https://openalex.org/W2116581888, https://openalex.org/W4256510569, https://openalex.org/W1986310339, https://openalex.org/W2170536922, https://openalex.org/W164978841, https://openalex.org/W2105697995, https://openalex.org/W2179514839, https://openalex.org/W6748288641, https://openalex.org/W2139839994, https://openalex.org/W2290120017, https://openalex.org/W2570484276, https://openalex.org/W2125783653, https://openalex.org/W2964157077, https://openalex.org/W2395250830, https://openalex.org/W1917241563, https://openalex.org/W2124888010, https://openalex.org/W2145132630, https://openalex.org/W1992715100 |
| referenced_works_count | 42 |
| abstract_inverted_index.a | 14, 20, 60, 88 |
| abstract_inverted_index.In | 25 |
| abstract_inverted_index.We | 58, 71 |
| abstract_inverted_index.as | 19, 48 |
| abstract_inverted_index.be | 105 |
| abstract_inverted_index.in | 30, 107 |
| abstract_inverted_index.is | 17, 46 |
| abstract_inverted_index.of | 5, 13, 78 |
| abstract_inverted_index.on | 40 |
| abstract_inverted_index.to | 27, 94 |
| abstract_inverted_index.DAG | 97 |
| abstract_inverted_index.and | 43, 81, 112 |
| abstract_inverted_index.any | 95, 110 |
| abstract_inverted_index.are | 37 |
| abstract_inverted_index.can | 104 |
| abstract_inverted_index.for | 75, 116 |
| abstract_inverted_index.has | 87 |
| abstract_inverted_index.job | 12 |
| abstract_inverted_index.the | 3, 41, 54, 76, 101 |
| abstract_inverted_index.Each | 11 |
| abstract_inverted_index.This | 0 |
| abstract_inverted_index.such | 79 |
| abstract_inverted_index.task | 16, 98, 120 |
| abstract_inverted_index.that | 67, 83 |
| abstract_inverted_index.this | 31, 51 |
| abstract_inverted_index.used | 106 |
| abstract_inverted_index.with | 9, 92, 109 |
| abstract_inverted_index.work | 29 |
| abstract_inverted_index.area, | 32 |
| abstract_inverted_index.based | 39 |
| abstract_inverted_index.graph | 23 |
| abstract_inverted_index.i.e., | 122 |
| abstract_inverted_index.paper | 1, 52 |
| abstract_inverted_index.prior | 28 |
| abstract_inverted_index.prove | 82 |
| abstract_inverted_index.sets, | 121 |
| abstract_inverted_index.tasks | 8 |
| abstract_inverted_index.where | 33 |
| abstract_inverted_index.(DAG). | 24 |
| abstract_inverted_index.called | 63 |
| abstract_inverted_index.design | 77 |
| abstract_inverted_index.factor | 91 |
| abstract_inverted_index.acyclic | 22 |
| abstract_inverted_index.general | 73 |
| abstract_inverted_index.optimal | 96 |
| abstract_inverted_index.propose | 59 |
| abstract_inverted_index.provide | 72 |
| abstract_inverted_index.respect | 93 |
| abstract_inverted_index.speedup | 90 |
| abstract_inverted_index.systems | 80 |
| abstract_inverted_index.without | 123 |
| abstract_inverted_index.analysis | 114 |
| abstract_inverted_index.analyzed | 47 |
| abstract_inverted_index.constant | 89 |
| abstract_inverted_index.contrast | 26 |
| abstract_inverted_index.directed | 21 |
| abstract_inverted_index.ordinary | 117 |
| abstract_inverted_index.parallel | 6, 15 |
| abstract_inverted_index.proposed | 38 |
| abstract_inverted_index.sporadic | 119 |
| abstract_inverted_index.suitable | 115 |
| abstract_inverted_index.algorithm | 103 |
| abstract_inverted_index.approach. | 57 |
| abstract_inverted_index.behavior, | 50 |
| abstract_inverted_index.considers | 2 |
| abstract_inverted_index.described | 18 |
| abstract_inverted_index.dominates | 68 |
| abstract_inverted_index.federated | 55, 65, 69, 85 |
| abstract_inverted_index.presented | 102 |
| abstract_inverted_index.real-time | 7 |
| abstract_inverted_index.scheduler | 111 |
| abstract_inverted_index.algorithm, | 62 |
| abstract_inverted_index.algorithms | 36 |
| abstract_inverted_index.inter-task | 44 |
| abstract_inverted_index.scheduler. | 99 |
| abstract_inverted_index.scheduling | 4, 35, 56, 86, 113 |
| abstract_inverted_index.conjunction | 108 |
| abstract_inverted_index.constraints | 74 |
| abstract_inverted_index.generalizes | 53 |
| abstract_inverted_index.scheduling, | 66 |
| abstract_inverted_index.scheduling. | 70 |
| abstract_inverted_index.Furthermore, | 100 |
| abstract_inverted_index.interference | 45 |
| abstract_inverted_index.parallelism. | 124 |
| abstract_inverted_index.DAG-structure | 42 |
| abstract_inverted_index.self-suspending | 49 |
| abstract_inverted_index.reservation-based | 61, 64, 84 |
| abstract_inverted_index.arbitrary-deadline | 118 |
| abstract_inverted_index.decomposition-based | 34 |
| abstract_inverted_index.arbitrary-deadlines. | 10 |
| cited_by_percentile_year.max | 94 |
| cited_by_percentile_year.min | 89 |
| countries_distinct_count | 2 |
| institutions_distinct_count | 5 |
| sustainable_development_goals[0].id | https://metadata.un.org/sdg/16 |
| sustainable_development_goals[0].score | 0.6499999761581421 |
| sustainable_development_goals[0].display_name | Peace, Justice and strong institutions |
| citation_normalized_percentile.value | 0.58782799 |
| citation_normalized_percentile.is_in_top_1_percent | False |
| citation_normalized_percentile.is_in_top_10_percent | False |