Filters








455 Hits in 7.8 sec

Response time analysis of sporadic DAG tasks under partitioned scheduling

Jose Fonseca, Geoffrey Nelissen, Vincent Nelis, Luis Miguel Pinho
2016 2016 11th IEEE Symposium on Industrial Embedded Systems (SIES)  
More precisely, we present a response time analysis for sporadic DAG tasks atop multiprocessors under partitioned fixed-priority scheduling. We assume the partitioning to be given.  ...  With minor modifications, any state-of-the-art technique for sporadic self-suspending tasks can thus be used to derived the worstcase response time of a partitioned DAG task.  ...  ACKNOWLEDGMENTS This work was partially supported by National Funds through FCT/MEC (Portuguese Foundation for Science and Technology) and co-financed by ERDF (European Regional Development  ... 
doi:10.1109/sies.2016.7509443 dblp:conf/sies/FonsecaNNP16 fatcat:j5d56lwk6bcofofg5pv2n6z6su

Parallel Path Progression DAG Scheduling [article]

Niklas Ueter, Mario Günzel, Georg von der Brüggen, Jian-Jia Chen
2022 arXiv   pre-print
Such scheduling algorithms and the corresponding worst-case response time analyses usually suffer from resource over-provisioning due to pessimistic analyses based on worst-case assumptions.  ...  This novel approach significantly improves the state-of-the-art response time analyses for parallel DAG tasks for highly parallel DAG structures.  ...  the worst-case response time for highparallel use cases.  ... 
arXiv:2208.11830v1 fatcat:lm55rpdrybdnzaw73opqquh25y

Minimizing response times of automotive dataflows on multicore

Glenn A. Elliott, Namhoon AKim, Jeremy P. Erickson, Cong Liu, James H. Andersony
2014 2014 IEEE 20th International Conference on Embedded and Real-Time Computing Systems and Applications  
Results for our test platform show that cache-aware clustered scheduling outperforms naïve partitioned and global approaches in terms of schedulability and end-to-end response times of dataflows. *  ...  We implement these techniques in PGM RT , a portable middleware framework for managing real-time dataflow applications on multicore platforms.  ...  Shige Wang of General Motors for his helpful comments on drafts of this paper.  ... 
doi:10.1109/rtcsa.2014.6910527 dblp:conf/rtcsa/ElliottAELA14 fatcat:t57zg2tz3vftxp5bunjfcj4enu

DPCP-p: A Distributed Locking Protocol for Parallel Real-Time Tasks [article]

Maolin Yang, Zewei Chen, Xu Jiang, Nan Guan, Hang Lei
2020 arXiv   pre-print
We develop task and resource partitioning heuristics and propose analysis techniques to safely bound the task response times.  ...  This paper for the first time studies the distributed synchronization framework of parallel real-time tasks, where both tasks and global resources are partitioned to designated processors, and requests  ...  WORST-CASE RESPONSE TIME ANALYSIS We derive an upper bound of the WCRT of an arbitrary path of τi using the fixed-point Response-Time Analysis (RTA) in this section.  ... 
arXiv:2007.00706v1 fatcat:kmyrpq3xuzbhjdb3sj5idnkn6e

Thread-level priority assignment in global multiprocessor scheduling for DAG tasks

Jiyeon Lee, Hoon Sung Chwa, Jinkyu Lee, Insik Shin
2016 Journal of Systems and Software  
Motivated by this, we refine real-time scheduling algorithm categories according to the basic unit of scheduling and propose a new priority assignment method for global task-wide thread-level fixed-priority  ...  While most studies focused on schedulability analysis under some well-known scheduling algorithms designed for sequential tasks, little work has been introduced to design new scheduling policies that accommodate  ...  Chwa et al. (2013) introduced an interference-based analysis for global task-level EDF scheduling, and Axer et al. (2013) presented a response-time analysis (RTA) for partitioned thread-level fixedpriority  ... 
doi:10.1016/j.jss.2015.12.004 fatcat:wguxpnij2jdeviz6f56eck7yq4

Global EDF scheduling of directed acyclic graphs on multiprocessor systems

Manar Qamhieh, Frédéric Fauberteau, Laurent George, Serge Midonnet
2013 Proceedings of the 21st International conference on Real-Time Networks and Systems - RTNS '13  
In this paper, we study the problem of real-time scheduling of parallel tasks represented by a Directed Acyclic Graph (DAG) on multiprocessor architectures.  ...  Our contributions consist in analyzing DAG tasks by considering their internal structures and providing a tighter bound on the workload and interference analysis.  ...  Acknowledgments We would like to thank Sanjoy Baruah from the university of North Carolina-Chapel Hill for his interesting comments on this work. REFERENCES  ... 
doi:10.1145/2516821.2516836 dblp:conf/rtns/QamhiehF0M13 fatcat:wwdi466hqrfsvcrlwk5ue66oue

Response-Time Analysis of Synchronous Parallel Tasks in Multiprocessor Systems

Cláudio Maia, Marko Bertogna, Luís Nogueira, Luis Miguel Pinho
2014 Proceedings of the 22nd International Conference on Real-Time Networks and Systems - RTNS '14  
While such general frameworks do not support the stringent timing requirements of real-time systems, they offer a useful model of computation based on the standard fork/join, for which the analysis of  ...  The model under consideration targets tasks with fixed priorities, composed of several segments with an arbitrary number of parallel and independent units of execution.  ...  In [9] , a worst-case response-time analysis is presented for fork/join tasks under partitioned fixed-priority scheduling.  ... 
doi:10.1145/2659787.2659815 dblp:conf/rtns/MaiaBNP14 fatcat:oo3xfl6g4rcyhikzhe6sepu3cq

An experimental analysis of DAG scheduling methods in hard real-time multiprocessor systems

Manar Qamhieh, Serge Midonnet
2014 Proceedings of the 2014 Conference on Research in Adaptive and Convergent Systems - RACS '14  
The scheduling of parallel real-time tasks on multiprocessor systems is more complicated than the one of independent sequential tasks, specially for the Directed Acyclic Graph (DAG) model.  ...  The trivial DAG scheduling approach is to directly apply common real-time scheduling algorithms on DAGs despite their lack of compatibility with the parallel model.  ...  STRETCHING A real-time scheduler is responsible for choosing which job to execute on which processor at all times. The priorities of executed jobs are determined by using a scheduling algorithm.  ... 
doi:10.1145/2663761.2664236 dblp:conf/racs/QamhiehM14 fatcat:vlakztk5mjdchpswwofffcrrqe

Simulation-based evaluations of DAG scheduling in hard real-time multiprocessor systems

Manar Qamhieh, Serge Midonnet
2015 ACM SIGAPP Applied Computing Review  
The scheduling of parallel real-time tasks on multiprocessor systems is more complicated than the one of independent sequential tasks, specially for the Directed Acyclic Graph (DAG) model.  ...  The trivial DAG scheduling approach is to directly apply common real-time scheduling algorithms on DAGs despite their lack of compatibility with the parallel model.  ...  STRETCHING A real-time scheduler is responsible for choosing which job to execute on which processor at all times. The priorities of executed jobs are determined by using a scheduling algorithm.  ... 
doi:10.1145/2724928.2724931 fatcat:xwiwksllyraf5jhm6rmlbjoscq

Schedulability analysis of DAG tasks with arbitrary deadlines under global fixed-priority scheduling

José Fonseca, Geoffrey Nelissen, Vincent Nélis
2019 Real-time systems  
One of the major sources of pessimism in the response time analysis (RTA) of globally scheduled real-time tasks is the computation of an upper-bound on the inter-task interference.  ...  This paper considers the global fixed-priority (G-FP) scheduling of sporadic real-time tasks when each task is modeled by a directed acyclic graph (DAG) of concurrent subtasks.  ...  Acknowledgements This work was partially supported by National Funds through FCT/ MCTES (Portuguese Foundation for Science and Technology) and co-financed by ERDF (European Regional Development Fund) under  ... 
doi:10.1007/s11241-018-09325-5 fatcat:rzv5ct7njnha3kwjhuqplmifxq

Analysis of Global Fixed-Priority Scheduling for Generalized Sporadic DAG Tasks [article]

Son Dinh, Christopher Gill, Kunal Agrawal
2019 arXiv   pre-print
We consider global fixed-priority (G-FP) scheduling of parallel tasks, in which each task is represented as a directed acyclic graph (DAG).  ...  Using the proposed workload bounding technique, we derive a response-time analysis and show that it improves upon state-of-the-art analysis techniques for G-FP scheduling.  ...  [1] presented a response-time analysis for fork-join tasks under Partitioned Fixed-Priority (P-FP) scheduling. Chwa et al.  ... 
arXiv:1905.05119v1 fatcat:ilwgkd3lffayhhpzmtzjarjh6u

Many suspensions, many problems: a review of self-suspending tasks in real-time systems

Jian-Jia Chen, Geoffrey Nelissen, Wen-Hung Huang, Maolin Yang, Björn Brandenburg, Konstantinos Bletsas, Cong Liu, Pascal Richard, Frédéric Ridouard, Neil Audsley, Raj Rajkumar, Dionisio de Niz (+1 others)
2018 Real-time systems  
; (3) an assessment of the influence of such flawed analyses on partitioned multiprocessor fixed-priority scheduling when tasks synchronize access to shared resources; and (4) a discussion of the computational  ...  tasks in real-time systems.  ...  This work has been partially supported by National Funds through FCT/MCTES (Portuguese Foundation for Science and Technology) within the CISTER Research Unit (CEC/04234); also by FCT and the EU ECSEL JU  ... 
doi:10.1007/s11241-018-9316-9 fatcat:6t2d2ux4xzhern2try32c65zvy

An experimental comparison of different real-time schedulers on multicore systems

Juri Lelli, Dario Faggioli, Tommaso Cucinotta, Giuseppe Lipari
2012 Journal of Systems and Software  
The comparison involves the fixed-priority scheduler for multiprocessors as available in the Linux kernel (with priorities set so as to achieve RM), and on our own implementation of EDF, both configured  ...  in global, partitioned and clustered mode.  ...  tasks execution, i.e., the analysis is based on the Worst-Case Execution Times (WCET).  ... 
doi:10.1016/j.jss.2012.05.048 fatcat:v6juqylp4bekfjqzinkzalpwxy

Global EDF Schedulability Analysis for Synchronous Parallel Tasks on Multicore Platforms

Hoon Sung Chwa, Jinkyu Lee, Kieu-My Phan, Arvind Easwaran, Insik Shin
2013 2013 25th Euromicro Conference on Real-Time Systems  
However, most successful results on traditional multi-core real-time scheduling are focused on sequential programming models.  ...  Recently, a few analysis methods have been proposed for schedulability of synchronous parallel tasks [18]- [22] .  ...  However, this work does not present schedulability analysis for a case in which multiple DAG tasks share processors, leaving it as future work.  ... 
doi:10.1109/ecrts.2013.14 dblp:conf/ecrts/ChwaLPES13 fatcat:ecfmc3tq35f3jazw5tyxnzead4

Partitioned Real-Time Scheduling for Preventing Information Leakage

Donghwa Kang, Inhwa Jung, Kilho Lee, Hyeongboo Baek
2022 IEEE Access  
of tasks in each processor.  ...  However, existing FT methods are for global scheduling only, and techniques for partitioned scheduling have not yet been studied.  ...  In addition, all tasks are executed with a fixed priority on the processor to which a task is assigned.  ... 
doi:10.1109/access.2022.3154055 fatcat:qnboicc7pvfdzeovgrgbusv7ii
« Previous Showing results 1 — 15 out of 455 results