A narrow theorem for multicore interference

extensilica1 pts0 comments

[2605.24026] A Per-Access Upper Bound for Shared-Resource Interference in Direct-Mapped Multicore Architectures

-->

Computer Science > Hardware Architecture

arXiv:2605.24026 (cs)

[Submitted on 20 May 2026]

Title:A Per-Access Upper Bound for Shared-Resource Interference in Direct-Mapped Multicore Architectures

Authors:Felipe T. Pedroni<br>View a PDF of the paper titled A Per-Access Upper Bound for Shared-Resource Interference in Direct-Mapped Multicore Architectures, by Felipe T. Pedroni

View PDF<br>HTML (experimental)

Abstract:We present a formal bounding analysis for maximum credible interference in multicore processors under strict architectural invariants: direct-mapped L2 cache (1-way associativity), disabled Miss Status Handling Registers (MSHRs), single-bank main memory, deterministic pinned tasks with fixed physical memory mapping, and a pessimistic L2/memory arbitration policy. We prove that, under these invariants, the per-critical-access stall imposed on a target task T is bounded above by (N-1)Lmem, and that this bound is attained by a synchronized adversarial workload of N-1 congruent-different-tag memory requests issued in phase with T's critical accesses. The argument is per-access and direct, requiring no informal multiplicative interference function. The derivation is purely analytical and discussed in the context of DO-178C/CAST-32A certification objectives for airborne software. Limitations and conditions for applicability are explicitly stated. This work provides a traceable method for separating multicore interference from Worst-Case Execution Time (WCET) budgets under fixed architectural constraints.

Subjects:

Hardware Architecture (cs.AR); Operating Systems (cs.OS); Performance (cs.PF)

ACM classes:<br>C.1.4; B.3; C.3

Cite as:<br>arXiv:2605.24026 [cs.AR]

(or<br>arXiv:2605.24026v1 [cs.AR] for this version)

https://doi.org/10.48550/arXiv.2605.24026

Focus to learn more

arXiv-issued DOI via DataCite (pending registration)

Submission history<br>From: Felipe Pedroni [view email]<br>[v1]<br>Wed, 20 May 2026 14:07:45 UTC (11 KB)

Full-text links:<br>Access Paper:

View a PDF of the paper titled A Per-Access Upper Bound for Shared-Resource Interference in Direct-Mapped Multicore Architectures, by Felipe T. Pedroni<br>View PDF<br>HTML (experimental)<br>TeX Source

view license

Current browse context:

cs.AR

next >

new<br>recent<br>| 2026-05

Change to browse by:

cs<br>cs.OS<br>cs.PF

References & Citations

NASA ADS<br>Google Scholar

Semantic Scholar

export BibTeX citation<br>Loading...

BibTeX formatted citation

&times;

loading...

Data provided by:

Bookmark

Bibliographic Tools

Bibliographic and Citation Tools

Bibliographic Explorer Toggle

Bibliographic Explorer (What is the Explorer?)

Connected Papers Toggle

Connected Papers (What is Connected Papers?)

Litmaps Toggle

Litmaps (What is Litmaps?)

scite.ai Toggle

scite Smart Citations (What are Smart Citations?)

Code, Data, Media

Code, Data and Media Associated with this Article

alphaXiv Toggle

alphaXiv (What is alphaXiv?)

Links to Code Toggle

CatalyzeX Code Finder for Papers (What is CatalyzeX?)

DagsHub Toggle

DagsHub (What is DagsHub?)

GotitPub Toggle

Gotit.pub (What is GotitPub?)

Huggingface Toggle

Hugging Face (What is Huggingface?)

ScienceCast Toggle

ScienceCast (What is ScienceCast?)

Demos

Demos

Replicate Toggle

Replicate (What is Replicate?)

Spaces Toggle

Hugging Face Spaces (What is Spaces?)

Spaces Toggle

TXYZ.AI (What is TXYZ.AI?)

Related Papers

Recommenders and Search Tools

Link to Influence Flower

Influence Flower (What are Influence Flowers?)

Core recommender toggle

CORE Recommender (What is CORE?)

Author

Venue

Institution

Topic

About arXivLabs

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs .

Which authors of this paper are endorsers? |<br>Disable MathJax (What is MathJax?)

toggle interference arxiv multicore access direct

Related Articles