Work in Progress: Guaranteeing weakly-hard timing constraints in server-based real-time systems

Nasim Samimi Dehkordi; Mitra Nasri; A.A. (Twan) Basten; Marc C.W. Geilen

doi:10.1109/RTAS61025.2024.00043

Work in Progress: Guaranteeing weakly-hard timing constraints in server-based real-time systems

Nasim Samimi Dehkordi, Mitra Nasri, A.A. (Twan) Basten, Marc C.W. Geilen

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

1 Citation (Scopus)

67 Downloads (Pure)

Abstract

Ensuring deadlines of hard real-time applications in server-based deployments is a challenging problem, particularly if the workload arrives following an arbitrary arrival curve. This work extends the “(M, /K)-firm weakly hard” model to server-based systems, ensuring timely processing of real-time requests to the server. We introduce an admission policy to regulate the remote server workload and prevent deadline misses while attempting to admit more requests than the minimum required, when possible. We guarantee the weakly hard constraints through optimal resource allocation and server confiauration.

Original language	English
Title of host publication	2024 IEEE 30th Real-Time and Embedded Technology and Applications Symposium, RTAS 2024
Publisher	Institute of Electrical and Electronics Engineers
Pages	402-405
Number of pages	4
ISBN (Electronic)	979-8-3503-5841-4
DOIs	https://doi.org/10.1109/RTAS61025.2024.00043
Publication status	Published - 26 Jun 2024
Event	30th IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS 2024 - Hongkong, China Duration: 13 Jun 2024 → 16 Jun 2024

Conference

Conference	30th IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS 2024
Abbreviated title	RTAS 2024
Country/Territory	China
City	Hongkong
Period	13/06/24 → 16/06/24

Funding

This work was supported by the EU ECSEL project TRANSACT (grant no. 101007260).

Funders	Funder number
European Union's Horizon 2020 - Research and Innovation Framework Programme	101007260
Electronic Components and Systems for European Leadership	101007260

Keywords

admission test
arrival curve
real-Time systems
response time analysis
Server-based systems

Access to Document

10.1109/RTAS61025.2024.00043

pdfFinal published version, 353 KBLicence: TAVERNE
Work_in_Progress__Online_admission_test_for__m_k__weakly_hard (9)

Cite this

Samimi Dehkordi, N., Nasri, M., Basten, A. A., & Geilen, M. C. W. (2024). Work in Progress: Guaranteeing weakly-hard timing constraints in server-based real-time systems. In 2024 IEEE 30th Real-Time and Embedded Technology and Applications Symposium, RTAS 2024 (pp. 402-405). Article 10568043 Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/RTAS61025.2024.00043

@inproceedings{f964f60fbaea404abef0862ba81b03e4,

title = "Work in Progress: Guaranteeing weakly-hard timing constraints in server-based real-time systems",

abstract = "Ensuring deadlines of hard real-time applications in server-based deployments is a challenging problem, particularly if the workload arrives following an arbitrary arrival curve. This work extends the “(M, /K)-firm weakly hard” model to server-based systems, ensuring timely processing of real-time requests to the server. We introduce an admission policy to regulate the remote server workload and prevent deadline misses while attempting to admit more requests than the minimum required, when possible. We guarantee the weakly hard constraints through optimal resource allocation and server confiauration.",

keywords = "admission test, arrival curve, real-Time systems, response time analysis, Server-based systems",

author = "{Samimi Dehkordi}, Nasim and Mitra Nasri and Basten, {A.A. (Twan)} and Geilen, {Marc C.W.}",

year = "2024",

month = jun,

day = "26",

doi = "10.1109/RTAS61025.2024.00043",

language = "English",

pages = "402--405",

booktitle = "2024 IEEE 30th Real-Time and Embedded Technology and Applications Symposium, RTAS 2024",

publisher = "Institute of Electrical and Electronics Engineers",

address = "United States",

note = "30th IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS 2024, RTAS 2024 ; Conference date: 13-06-2024 Through 16-06-2024",

}

Samimi Dehkordi, N , Nasri, M , Basten, AA & Geilen, MCW 2024, Work in Progress: Guaranteeing weakly-hard timing constraints in server-based real-time systems. in 2024 IEEE 30th Real-Time and Embedded Technology and Applications Symposium, RTAS 2024., 10568043, Institute of Electrical and Electronics Engineers, pp. 402-405, 30th IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS 2024, Hongkong, China, 13/06/24. https://doi.org/10.1109/RTAS61025.2024.00043

Work in Progress: Guaranteeing weakly-hard timing constraints in server-based real-time systems. / Samimi Dehkordi, Nasim ; Nasri, Mitra ; Basten, A.A. (Twan) et al.
2024 IEEE 30th Real-Time and Embedded Technology and Applications Symposium, RTAS 2024. Institute of Electrical and Electronics Engineers, 2024. p. 402-405 10568043.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Work in Progress

T2 - 30th IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS 2024

AU - Samimi Dehkordi, Nasim

AU - Nasri, Mitra

AU - Basten, A.A. (Twan)

AU - Geilen, Marc C.W.

PY - 2024/6/26

Y1 - 2024/6/26

N2 - Ensuring deadlines of hard real-time applications in server-based deployments is a challenging problem, particularly if the workload arrives following an arbitrary arrival curve. This work extends the “(M, /K)-firm weakly hard” model to server-based systems, ensuring timely processing of real-time requests to the server. We introduce an admission policy to regulate the remote server workload and prevent deadline misses while attempting to admit more requests than the minimum required, when possible. We guarantee the weakly hard constraints through optimal resource allocation and server confiauration.

AB - Ensuring deadlines of hard real-time applications in server-based deployments is a challenging problem, particularly if the workload arrives following an arbitrary arrival curve. This work extends the “(M, /K)-firm weakly hard” model to server-based systems, ensuring timely processing of real-time requests to the server. We introduce an admission policy to regulate the remote server workload and prevent deadline misses while attempting to admit more requests than the minimum required, when possible. We guarantee the weakly hard constraints through optimal resource allocation and server confiauration.

KW - admission test

KW - arrival curve

KW - real-Time systems

KW - response time analysis

KW - Server-based systems

UR - http://www.scopus.com/inward/record.url?scp=85197705878&partnerID=8YFLogxK

U2 - 10.1109/RTAS61025.2024.00043

DO - 10.1109/RTAS61025.2024.00043

M3 - Conference contribution

SP - 402

EP - 405

BT - 2024 IEEE 30th Real-Time and Embedded Technology and Applications Symposium, RTAS 2024

PB - Institute of Electrical and Electronics Engineers

Y2 - 13 June 2024 through 16 June 2024

ER -

Work in Progress: Guaranteeing weakly-hard timing constraints in server-based real-time systems

Abstract

Conference

Funding

Keywords

Access to Document

Other files and links

Fingerprint

A Position Paper on Transforming Embedded Real-Time Systems to the Cloud: Challenges and New Research Directions

Guaranteeing Weakly-Hard Timing Constraints of Real-Time Server-Based Systems

Cite this