Probabilistic Response Time and Joint Analysis of Periodic Tasks

Autor:	Petru Eles, Bogdan Tanasa, Zebo Peng, Unmesh D. Bordoloi
Rok vydání:	2015
Předmět:	Earliest deadline first scheduling Fixed-priority pre-emptive scheduling Computer science Probabilistic logic Deadline scheduler Response time Uniprocessor system Dynamic priority scheduling Parallel computing Computer Science::Operating Systems Algorithm Scheduling (computing)
Zdroj:	ECRTS
Popis:	In this paper we address the problem of computing the probability response time distribution of periodic tasks scheduled on a uniprocessor systems. Our framework assumes an arbitrary non-idling preemptive scheduling policy that may be either a fixed-priority scheduler (such as Rate Monotonic - RM) or a dynamic-priority scheduler (such as Earliest Deadline First - EDF). At the same time, our framework can handle arbitrary execution time distributions arbitrary deadlines providing numerically accurate results. We also show how the framework can be extended to compute the correlation coefficients between the response times of different jobs by performing the joint analysis.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::32db84dd3e76ca2064be8d954ebd7882 https://doi.org/10.1109/ecrts.2015.28 Zobrazit plný text záznamu