Document Open Access Logo

CacheFlow: Using Maximum Flow to Bound Cache-Based Preemption Delays (Artifact)

Authors Tiancheng He , Bryan C. Ward

PDF

Artifact Description

Thumbnail PDF
PDF
DARTS.12.2.7.pdf
  • Filesize: 0.75 MB
  • 5 pages

Document Identifiers

Subject Classification

ACM Subject Classification
  • Computer systems organization → Real-time systems
  • Software and its engineering → Software verification and validation
Keywords
  • Cache-related preemption delay; CRPD; max-flow; schedulability analysis; real-time systems; artifact

Metrics

Artifact

Abstract

This artifact accompanies the ECRTS 2026 paper CacheFlow: Using Maximum Flow to Bound Cache-Based Preemption Delays [Tiancheng He and Bryan C. Ward, 2026]. It provides the Rust plus Python implementation of every cache-related preemption delay (CRPD) analysis evaluated in the paper, the experiment harness used to compare them, the configurations that drive each figure in the paper, and a Docker-based build that fully reproduces the experimental claims of Sections 7.2-7.4. We claim all four ECRTS artifact-evaluation badges: Available, Functional, Reusable, and Results Reproduced.

Cite As Get BibTex

Tiancheng He and Bryan C. Ward. CacheFlow: Using Maximum Flow to Bound Cache-Based Preemption Delays (Artifact). In Special Issue of the 38th European Conference on Real-Time Systems (ECRTS 2026). Dagstuhl Artifacts Series (DARTS), Volume 12, Issue 2, pp. 7:1-7:5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026) https://doi.org/10.4230/DARTS.12.2.7

Author Details

Tiancheng He
  • Department of Computer Science, Vanderbilt University, Nashville, TN, USA
Bryan C. Ward
  • Department of Computer Science, Vanderbilt University, Nashville, TN, USA

Related Article

  • Tiancheng He and Bryan C. Ward, "CacheFlow: Using Maximum Flow to Bound Cache-Based Preemption Delays", in 38th European Conference on Real-Time Systems (ECRTS 2026), LIPIcs, Vol. 375, pp. 13:1-13:22, 2026. https://doi.org/10.4230/LIPIcs.ECRTS.2026.13

References

  1. Tiancheng He and Bryan C. Ward. CacheFlow: Using maximum flow to bound cache-based preemption delays. In Proceedings of the 38th European Conference on Real-Time Systems (ECRTS 2026), volume 375 of LIPIcs, pages 13:1-13:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026. URL: https://doi.org/10.4230/LIPIcs.ECRTS.2026.13.
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2026 Schloss Dagstuhl – LZI GmbH Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact