Zobrazeno 1 - 10
of 18
pro vyhledávání: '"Abhilash Thekkilakattil"'
Publikováno v:
SIES
Preemption point selection has a significant impact on the schedulability of Real-Time tasks under the Fixed Preemption Point approach in Limited Preemptive Scheduling. Many real time systems can occasionally tolerate deadline misses as long as their
Publikováno v:
Real-Time Systems. 51:247-273
The preemptive scheduling paradigm is known to strictly dominate the non-preemptive scheduling paradigm with respect to feasibility. On the other hand, preemptively scheduling real-time tasks on uniprocessors, unlike non-preemptive scheduling, may le
Autor:
Radu Dobrin, Abhilash Thekkilakattil, Sasikumar Punnekkat, Oliver Gettings, Jian-Jia Chen, Robert I. Davis
Fixed priority scheduling is used in many real-time systems; however, both preemptive and non-preemptive variants (FP-P and FP-NP) are known to be sub-optimal when compared to an optimal uniprocessor scheduling algorithm such as preemptive earliest d
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c2f745fb14cb76f9e78d7842e1a1d279
https://eprints.whiterose.ac.uk/125844/1/s11241_017_9294_3.pdf
https://eprints.whiterose.ac.uk/125844/1/s11241_017_9294_3.pdf
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319390826
Ada-Europe
Ada-Europe
Global limited preemptive real-time scheduling in multiprocessor systems using Fixed Preemption Points FPP brings in an additional challenge with respect to the choice of the task to be preempted in order to maximize schedulability. Two principal cho
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::778cd96bf2a29afaef098ad1ed92221f
https://doi.org/10.1007/978-3-319-39083-3_11
https://doi.org/10.1007/978-3-319-39083-3_11
Publikováno v:
RTSS
36th Real-Time Systems Symposium (RTSS 2015)
36th Real-Time Systems Symposium (RTSS 2015), Dec 2015, San Antonio, Texas, United States
36th Real-Time Systems Symposium (RTSS 2015)
36th Real-Time Systems Symposium (RTSS 2015), Dec 2015, San Antonio, Texas, United States
International audience; Fixed priority scheduling is used in many real-time systems; however, both preemptive and non-preemptive variants (FP-P and FP-NP) are known to be sub-optimal when compared to an optimal uniprocessor scheduling algorithm such
Publikováno v:
RTNS
Challenges associated with allowing preemptions and migrations are compounded in multicore systems, particularly under global scheduling policies, because of the potentially high overheads. For example, multiple levels of cache greatly increase preem
Publikováno v:
COMPSAC
The growing complexity of software employed in the cyber-physical domain is calling for a thorough study of both its functional and extra-functional properties. Ethical aspects are among important extra-functional properties, that cover the whole lif
Publikováno v:
RTNS
There exist two general techniques to account for preemption-related overheads on multiprocessors. This paper presents a new preemption-related overhead-accounting technique, called analytical redistribution of preemption overheads (ARPO), which inte
Publikováno v:
ETFA
Reliability is a key requirement in many distributed real-time systems deployed in safety and mission critical applications, and temporal redundancy is a widely employed strategy towards guaranteeing it. The temporal redundancy approach is typically
Publikováno v:
ECRTS
The feasibility of preemptive and non-preemptive scheduling has been well investigated on uniprocessor and multiprocessor platforms under both Fixed Priority Scheduling (FPS) and Earliest Deadline First (EDF) paradigms. While feasibility of limited p