Publication
Finding an upper bound on the increase in execution time due to contention on the memory bus in COTS-based multicore systems
dc.contributor.author | Andersson, Björn | |
dc.contributor.author | Easwaran, Arvind | |
dc.contributor.author | Lee, Jinkyu | |
dc.date.accessioned | 2014-02-12T11:16:22Z | |
dc.date.available | 2014-02-12T11:16:22Z | |
dc.date.issued | 2010 | |
dc.description.abstract | Contention on the memory bus in COTS based multicore systems is becoming a major determining factor of the execution time of a task. Analyzing this extra execution time is non-trivial because (i) bus arbitration protocols in such systems are often undocumented and (ii) the times when the memory bus is requested to be used are not explicitly controlled by the operating system scheduler; they are instead a result of cache misses. We present a method for finding an upper bound on the extra execution time of a task due to contention on the memory bus in COTS based multicore systems. This method makes no assumptions on the bus arbitration protocol (other than assuming that it is work-conserving). | por |
dc.identifier.doi | 10.1145/1851166.1851172 | pt_PT |
dc.identifier.uri | http://hdl.handle.net/10400.22/3852 | |
dc.language.iso | eng | por |
dc.peerreviewed | yes | por |
dc.publisher | ACM | por |
dc.relation.ispartofseries | ACM SIGBED Review - Special Issue on the Work-in-Progress (WIP); Vol. 7, Issue 1, Art. Nº 4 | |
dc.relation.publisherversion | http://dl.acm.org/citation.cfm?doid=1851166.1851172 | por |
dc.title | Finding an upper bound on the increase in execution time due to contention on the memory bus in COTS-based multicore systems | por |
dc.type | journal article | |
dspace.entity.type | Publication | |
oaire.citation.issue | Issue 1 | por |
oaire.citation.title | IEEE Real-Time Systems Symposium (RTSS) | por |
oaire.citation.volume | Vol. 7 | por |
rcaap.rights | closedAccess | por |
rcaap.type | article |