Issue
DARTS, Volume 7, Issue 1
Special Issue of the 33rd Euromicro Conference on Real-Time Systems (ECRTS 2021)
-
Part of:
Volume:
DARTS, Volume 7 (ECOOP 2021)
Conference: Euromicro Conference on Real-Time Systems (ECRTS)
Journal: Dagstuhl Artifacts Series (DARTS)
Editors
Publication Details
- published at: 2021-06-30
- Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
- DBLP: db/journals/darts/darts7
Access Numbers
- Detailed Access Statistics available here
-
Total Document Accesses (updated on a weekly basis):
0PDF Downloads
Documents
No documents found matching your filter selection.
Document
Front Matter
Front Matter - ECRTS 2021 Artifacts, Table of Contents, Artifact Evaluation Committee
Abstract
Front Matter, Table of Contents, Preface, Conference Organization
Cite as
Special Issue of the 33rd Euromicro Conference on Real-Time Systems (ECRTS 2021). Dagstuhl Artifacts Series (DARTS), Volume 7, Issue 1, pp. 0:i-0:x, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
Copy BibTex To Clipboard
@Article{biondi_et_al:DARTS.7.1.0,
author = {Biondi, Alessandro and Kritikakou, Angeliki},
title = {{Front Matter - ECRTS 2021 Artifacts, Table of Contents, Artifact Evaluation Committee}},
pages = {0:i--0:x},
journal = {Dagstuhl Artifacts Series},
ISSN = {2509-8195},
year = {2021},
volume = {7},
number = {1},
editor = {Biondi, Alessandro and Kritikakou, Angeliki},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DARTS.7.1.0},
URN = {urn:nbn:de:0030-drops-139794},
doi = {10.4230/DARTS.7.1.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
Document
Artifact
On the Convolution Efficiency for Probabilistic Analysis of Real-Time Systems (Artifact)
Abstract
This artifact describes the process for validation and reproduction of the experiments given in the associated paper "On the Convolution Efficiency for Probabilistic Analysis of Real-Time Systems". This document contains the information on the scope of the presented artifact, i.e. what are the considered experiments, instructions for obtaining the source code of the experiments, tested platforms, and other relevant information.
Cite as
Filip Marković, Alessandro Vittorio Papadopoulos, and Thomas Nolte. On the Convolution Efficiency for Probabilistic Analysis of Real-Time Systems (Artifact). In Special Issue of the 33rd Euromicro Conference on Real-Time Systems (ECRTS 2021). Dagstuhl Artifacts Series (DARTS), Volume 7, Issue 1, pp. 1:1-1:2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
Copy BibTex To Clipboard
@Article{markovic_et_al:DARTS.7.1.1,
author = {Markovi\'{c}, Filip and Papadopoulos, Alessandro Vittorio and Nolte, Thomas},
title = {{On the Convolution Efficiency for Probabilistic Analysis of Real-Time Systems (Artifact)}},
pages = {1:1--1:2},
journal = {Dagstuhl Artifacts Series},
ISSN = {2509-8195},
year = {2021},
volume = {7},
number = {1},
editor = {Markovi\'{c}, Filip and Papadopoulos, Alessandro Vittorio and Nolte, Thomas},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DARTS.7.1.1},
URN = {urn:nbn:de:0030-drops-139804},
doi = {10.4230/DARTS.7.1.1},
annote = {Keywords: Probabilistic analysis, Random variables, Algorithm Complexity}
}
Document
Artifact
A Residual Service Curve of Rate-Latency Server Used by Sporadic Flows Computable in Quadratic Time for Network Calculus (Artifact)
Abstract
Computing response times for resources shared by periodic workloads (tasks or data flows) can be very time consuming as it depends on the least common multiple of the periods. In a previous study, a quadratic algorithm was provided to upper bound the response time of a set of periodic tasks with a fixed-priority scheduling. The related paper generalises this result by considering a rate-latency server and sporadic workloads and gives a response time and residual curve that can be used in other contexts. It also provides a formal proof in the Coq language. This artifact enables to reproduce this proof.
Cite as
Marc Boyer, Pierre Roux, Hugo Daigmorte, and David Puechmaille. A Residual Service Curve of Rate-Latency Server Used by Sporadic Flows Computable in Quadratic Time for Network Calculus (Artifact). In Special Issue of the 33rd Euromicro Conference on Real-Time Systems (ECRTS 2021). Dagstuhl Artifacts Series (DARTS), Volume 7, Issue 1, pp. 2:1-2:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
Copy BibTex To Clipboard
@Article{boyer_et_al:DARTS.7.1.2,
author = {Boyer, Marc and Roux, Pierre and Daigmorte, Hugo and Puechmaille, David},
title = {{A Residual Service Curve of Rate-Latency Server Used by Sporadic Flows Computable in Quadratic Time for Network Calculus (Artifact)}},
pages = {2:1--2:3},
journal = {Dagstuhl Artifacts Series},
ISSN = {2509-8195},
year = {2021},
volume = {7},
number = {1},
editor = {Boyer, Marc and Roux, Pierre and Daigmorte, Hugo and Puechmaille, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DARTS.7.1.2},
URN = {urn:nbn:de:0030-drops-139810},
doi = {10.4230/DARTS.7.1.2},
annote = {Keywords: Network Calculus, response time, residual curve, rate-latency server, sporadic workload, formal proof, Coq}
}
Document
Artifact
Light Reading: Optimizing Reader/Writer Locking for Read-Dominant Real-Time Workloads (Artifact)
Abstract
This paper is directed at reader/writer locking for read-dominant real-time workloads. It is shown that state-of-the-art real-time reader/writer locking protocols are subject to performance limitations when reads dominate, and that existing schedulability analysis fails to leverage the sparsity of writes in this case. A new reader/writer locking-protocol implementation and new inflation-free schedulability analysis are proposed to address these problems. Overhead evaluations of the new implementation show a decrease in overheads of up to 70% over previous implementations, leading to throughput for read operations increasing by up to 450%. Schedulability experiments are presented that show that the analysis results in schedulability improvements of up to 156.8% compared to the existing state-of-the-art approach.
Cite as
Catherine E. Nemitz, Shai Caspin, James H. Anderson, and Bryan C. Ward. Light Reading: Optimizing Reader/Writer Locking for Read-Dominant Real-Time Workloads (Artifact). In Special Issue of the 33rd Euromicro Conference on Real-Time Systems (ECRTS 2021). Dagstuhl Artifacts Series (DARTS), Volume 7, Issue 1, pp. 3:1-3:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
Copy BibTex To Clipboard
@Article{nemitz_et_al:DARTS.7.1.3,
author = {Nemitz, Catherine E. and Caspin, Shai and Anderson, James H. and Ward, Bryan C.},
title = {{Light Reading: Optimizing Reader/Writer Locking for Read-Dominant Real-Time Workloads (Artifact)}},
pages = {3:1--3:3},
journal = {Dagstuhl Artifacts Series},
ISSN = {2509-8195},
year = {2021},
volume = {7},
number = {1},
editor = {Nemitz, Catherine E. and Caspin, Shai and Anderson, James H. and Ward, Bryan C.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DARTS.7.1.3},
URN = {urn:nbn:de:0030-drops-139828},
doi = {10.4230/DARTS.7.1.3},
annote = {Keywords: Reader/writer, real-time, synchronization, spinlock, RMR complexity}
}