Publication
Bus-Contention Aware WCRT Analysis for the 3-Phase Task Model Considering a Work- Conserving Bus Arbitration Scheme
dc.contributor.author | Arora, Jatin | |
dc.contributor.author | Maia, Cláudio | |
dc.contributor.author | Rashid, Syed Aftab | |
dc.contributor.author | Nelissen, Geoffrey | |
dc.contributor.author | Tovar, Eduardo | |
dc.date.accessioned | 2022-10-03T15:35:41Z | |
dc.date.available | 2022-10-03T15:35:41Z | |
dc.date.issued | 2021-12-14 | |
dc.description.abstract | Today multicore processors are used in most modern systems that require computational logic. However, their applicability in systems with stringent timing requirements is still an ongoing research. This is due to the difficulty of ensuring the timing correctness of tasks executing on a multicore platform that comprises a number of shared hardware resources, e.g., caches, memory bus and the main memory. Concurrent accesses to any of these shared resources can generate uncontrolled interference, which complicates the estimations of tasks' worst-case execution time (WCET) and the worst-case response time (WCRT). The use of the 3-phase task execution model helps in upper bounding the contention due to the sharing of bus/main memory in multicore systems. It divides the execution of tasks into distinct memory and execution phases, where tasks can only access the bus/main memory during their memory phases. This makes bus/memory access patterns of tasks more predictable, enabling a preciser computation of bus/memory contention. In this work, we show how the bus contention can be computed for the 3-phase task model considering a work-conserving, i.e., round-robin (RR) based, arbitration policy at the memory bus. This is different from existing works that analyze the time-division multiple access (TDMA) and first-come-first-serve (FCFS) based bus arbitration policies. First, we present a solution to model the bus contention that can be suffered/caused by tasks executing on the same/remote cores of a multicore system under an RR-based bus arbitration scheme. We then evaluate the impact of resulting bus contention on taskset schedulability. Experimental results show that our proposed RR-based bus contention analysis can improve taskset schedulability by up to 100 percentage points than the TDMA-based analysis and up to 40 percentage points than the FCFS-based bus contention analysis. | pt_PT |
dc.description.sponsorship | This work was partially supported by National Funds through FCT/MCTES (Portuguese Foundation for Science and Technology), within the CISTER Research Unit (UIDB-UIDP/04234/2020); also by the Operational Competitiveness Programme and Internationalization (COMPETE 2020) under the PT2020 Partnership Agreement, through the European Regional Development Fund (ERDF), and by national funds through the FCT, within project POCI-01-0145-FEDER-029119 (PREFECT); also by the European Union’s Horizon 2020 - The EU Framework Programme for Research and Innovation 2014-2020, under grant agreement No. 732505. Project “TEC4Growth - Pervasive Intelligence, Enhancers and Proofs of Concept with Industrial Impact/NORTE-01-0145-FEDER000020” financed by the North Portugal Regional Operational Programme (NORTE 2020), under the PORTUGAL 2020 Partnership Agreement; also by FCT, under PhD grant 2020.09532.BD. | pt_PT |
dc.description.version | info:eu-repo/semantics/publishedVersion | pt_PT |
dc.identifier.doi | 10.1016/j.sysarc.2021.102345 | pt_PT |
dc.identifier.uri | http://hdl.handle.net/10400.22/20906 | |
dc.language.iso | eng | pt_PT |
dc.publisher | Elsevier | pt_PT |
dc.relation | UIDB-UIDP/04234/2020 | pt_PT |
dc.relation | POCI-01-0145-FEDER-029119 | pt_PT |
dc.relation | Lightweight Computation for Networks at the Edge | |
dc.relation | Bus-Aware Schedulability Analysis in Multiprocessor Real-Time Systems | |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | pt_PT |
dc.subject | Real-Time Systems | pt_PT |
dc.subject | Multicore Processors | pt_PT |
dc.subject | Partitioned Scheduling | pt_PT |
dc.subject | Phased Execution Model | pt_PT |
dc.subject | Bus Contention | pt_PT |
dc.subject | Schedulability Analysis | pt_PT |
dc.title | Bus-Contention Aware WCRT Analysis for the 3-Phase Task Model Considering a Work- Conserving Bus Arbitration Scheme | pt_PT |
dc.title.alternative | 211004 | pt_PT |
dc.type | journal article | |
dspace.entity.type | Publication | |
oaire.awardTitle | Lightweight Computation for Networks at the Edge | |
oaire.awardTitle | Bus-Aware Schedulability Analysis in Multiprocessor Real-Time Systems | |
oaire.awardURI | info:eu-repo/grantAgreement/EC/H2020/732505/EU | |
oaire.awardURI | info:eu-repo/grantAgreement/FCT/POR_NORTE/2020.09532.BD/PT | |
oaire.citation.title | Journal of Systems Architecture | pt_PT |
oaire.citation.volume | 122 | pt_PT |
oaire.fundingStream | H2020 | |
oaire.fundingStream | POR_NORTE | |
person.familyName | Arora | |
person.familyName | Maia | |
person.familyName | Tovar | |
person.givenName | Jatin | |
person.givenName | Cláudio Roberto Ribeiro | |
person.givenName | Eduardo | |
person.identifier.ciencia-id | 8816-61C3-8763 | |
person.identifier.ciencia-id | EC13-23BF-2018 | |
person.identifier.ciencia-id | 6017-8881-11E8 | |
person.identifier.orcid | 0000-0001-6198-6852 | |
person.identifier.orcid | 0000-0002-6567-4271 | |
person.identifier.orcid | 0000-0001-8979-3876 | |
person.identifier.scopus-author-id | 7006312557 | |
project.funder.identifier | http://doi.org/10.13039/501100008530 | |
project.funder.identifier | http://doi.org/10.13039/501100001871 | |
project.funder.name | European Commission | |
project.funder.name | Fundação para a Ciência e a Tecnologia | |
rcaap.rights | openAccess | pt_PT |
rcaap.type | article | pt_PT |
relation.isAuthorOfPublication | 21bbedd3-1ba1-40a2-9ceb-42bbfd0abbee | |
relation.isAuthorOfPublication | 382626bf-f6e8-427b-b5fa-e470b5b0fb03 | |
relation.isAuthorOfPublication | 80b63d8a-2e6d-484e-af3c-55849d0cb65e | |
relation.isAuthorOfPublication.latestForDiscovery | 21bbedd3-1ba1-40a2-9ceb-42bbfd0abbee | |
relation.isProjectOfPublication | 53ade512-30d8-4f8c-a0a4-9e38aee21e55 | |
relation.isProjectOfPublication | 3e46f0ce-288b-4630-845b-806eba1e6763 | |
relation.isProjectOfPublication.latestForDiscovery | 3e46f0ce-288b-4630-845b-806eba1e6763 |