299 Hits in 7.2 sec

Response Time Bounds for G-EDF without Intra-Task Precedence Constraints [chapter]

Jeremy P. Erickson, James H. Anderson
2011 Lecture Notes in Computer Science  
Prior work has provided bounds on the deadline tardiness that a set of sporadic real-time tasks may incur when scheduled using the global earliest-deadline-first (G-EDF) scheduling algorithm.  ...  We also provide tardiness bounds that are better than those available with the standard sporadic task model.  ...  Conclusion G-EDF scheduling has already proven useful for traditional SRT workloads in which jobs of the same task have implicit precedence constraints.  ... 
doi:10.1007/978-3-642-25873-2_10 fatcat:35nyxaslo5evfmevg7lajj35uu

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

Son Dinh, Christopher Gill, Kunal Agrawal
2019 arXiv   pre-print
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.  ...  We summarize and highlight limitations of the state-of-the-art analyses for G-FP and propose a novel technique for bounding interfering workload, which can be applied directly to generalized DAG tasks.  ...  RESPONSE-TIME ANALYSIS From the above calculations for the bounds of intra-task interference and inter-task interference on τ k , we have the following theorem for the response-time bound of τ k .  ... 
arXiv:1905.05119v1 fatcat:ilwgkd3lffayhhpzmtzjarjh6u

Reducing Response-Time Bounds for DAG-Based Task Systems on Heterogeneous Multicore Platforms

Kecheng Yang, Ming Yang, James H. Anderson
2016 Proceedings of the 24th International Conference on Real-Time Networks and Systems - RTNS '16  
This paper considers for the first time end-to-end responsetime analysis for DAG-based real-time task systems implemented on heterogeneous multicore platforms.  ...  In the proposed analysis, this characteristic is exploited to reduce response-time bounds. Additionally, there is some leeway in choosing how to set tasks' relative deadlines.  ...  Acknowledgments: We thank Alan Gatherer, Lee Mc-Fearin, and Peter Yan for bringing the problem studied in this paper to our attention and for answering many questions regarding cellular base stations.  ... 
doi:10.1145/2997465.2997486 dblp:conf/rtns/YangYA16 fatcat:cqfkmvjrxvaqxnyz24fmuk3e3y

Response time analysis for G-EDF and G-DM scheduling of sporadic DAG-tasks with arbitrary deadline

Andrea Parri, Alessandro Biondi, Mauro Marinoni
2015 Proceedings of the 23rd International Conference on Real Time and Networks Systems - RTNS '15  
This paper presents two schedulability tests based on Response Time Analysis for determining whether a set of sporadic DAG-tasks with arbitrary deadlines can be scheduled by G-EDF or G-DM on a platform  ...  Also in the real-time domain more detailed task models are under evaluation to provide a tighter analysis of parallel application with precedence and timing constraints.  ...  is no "intra-vertex" precedence constraint).  ... 
doi:10.1145/2834848.2834864 dblp:conf/rtns/ParriBM15 fatcat:s7yr4jsio5anjovv2pysvjc6am

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  
To this end, we develop cache-aware and overhead-cognizant scheduling techniques that lessen guaranteed response times without unnecessarily constraining platform utilization.  ...  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. *  ...  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

Schedulability Analysis of Conditional Parallel Task Graphs in Multicore Systems

Alessandra Melani, Marko Bertogna, Vincenzo Bonifaci, Alberto Marchetti-Spaccamela, Giorgio Buttazzo
2016 IEEE transactions on computers  
For this task model, a set of meaningful parameters are identified and computed by efficient algorithms and a response-time analysis is presented for different scheduling policies.  ...  Although schedulability tests and resource augmentation bounds have been derived for these task models in the context of multicore systems, they are still too pessimistic to describe the execution flow  ...  Finally, we will denote as RTA-XXX-a (resp., RTA-XXX-b) our response-time analysis for FP (XXX=FP) or EDF (XXX=EDF) when the intra-task interference is bounded as described in Algorithm 2, with (resp.,  ... 
doi:10.1109/tc.2016.2584064 fatcat:b73vpzev4fahfh2d4ij4e4nb2u

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  
This paper proposes to narrow the gap by presenting a model that analyses the response-time of synchronous parallel real-time tasks.  ...  We contribute to the state-of-the-art by analysing the response-time behaviour of synchronous parallel tasks.  ...  For parallel tasks, Ri clearly depends on several factors such as the inter-task and intra-task interferences; precedence constraints between the segments of the task itself; the degree of parallelism  ... 
doi:10.1145/2659787.2659815 dblp:conf/rtns/MaiaBNP14 fatcat:oo3xfl6g4rcyhikzhe6sepu3cq

A Generalized Parallel Task Model for Recurrent Real-Time Processes

Vincenzo Bonifaci, Andreas Wiese, Sanjoy K. Baruah, Alberto Marchetti-Spaccamela, Sebastian Stiller, Leen Stougie
2019 ACM Transactions on Parallel Computing  
A model is considered for representing recurrent precedence-constrained tasks that are to execute on multiprocessor platforms.  ...  Polynomial and pseudo-polynomial time schedulability tests, of differing effectiveness, are presented for determining whether a given task set can be scheduled by EDF or DM to always meet deadlines on  ...  ACKNOWLEDGMENT The authors thank Enrico Bini for very stimulating discussions, and the anonymous reviewers for many useful suggestions.  ... 
doi:10.1145/3322809 fatcat:yfab7geqf5dztpgiumsak6gvqu

Semi-Federated Scheduling of Parallel Real-Time Tasks on Multiprocessors [article]

Xu Jiang, Nan Guan, Xiang Long, Wang Yi
2017 arXiv   pre-print
real-time tasks on multi-cores.  ...  Federated scheduling is a promising approach to schedule parallel real-time tasks on multi-cores, where each heavy task exclusively executes on a number of dedicated processors, while light tasks are treated  ...  jobs thus eliminating the intra precedence constraints and provide analysis upon the response time.  ... 
arXiv:1705.03245v1 fatcat:6nk66zeicrghdosub3uofupwva

The OMLP family of optimal multiprocessor real-time locking protocols

Björn B. Brandenburg, James H. Anderson
2012 Design automation for embedded systems  
To formalize a notion of "optimal blocking," precise definitions of what constitutes "blocking" in a multiprocessor real-time system are given and a simple complexity metric for real-time locking protocols  ...  In addition to the coarse-grained asymptotic bounds, detailed blocking bounds suitable for schedulability analysis are derived using holistic blocking analysis.  ...  Acknowledgements We thank Tomas Kalibera for suggesting the use of bootstrapping in schedulability experiments.  ... 
doi:10.1007/s10617-012-9090-1 fatcat:fvli2uh6pbfcrpr7eyz3mpapa4

Compositional real-time scheduling framework with periodic model

Insik Shin, Insup Lee
2008 ACM Transactions on Embedded Computing Systems  
We also provide the utilization bounds of a periodic task set over the periodic resource model and the abstraction bounds of periodic interfaces for a periodic task set under EDF and RM scheduling.  ...  We present exact schedulability conditions for the standard Liu and Layland periodic task model and the proposed periodic resource model under EDF and RM scheduling, and we show that the component abstraction  ...  ACKNOWLEDGMENTS We thank Al Mok for introducing the problem to us. We also thank to Luis Almeida, Xiang "Alex" Feng, Slobodan Matik, and John Regehr for helpful discussions.  ... 
doi:10.1145/1347375.1347383 fatcat:ksburyp5pffelfpusjwarazeuq

Schedulability Bounds for Parallel Real-Time Tasks under Global Rate-Monotonic Scheduling [article]

Xu Jiang, Nan Guan, Maolin Yang, Yue Tang, Wang Yi
2020 arXiv   pre-print
Different from sequential real-time task systems for which utilization is a suitable metric to develop schedulability bounds, schedulability of parallel real-time tasks depends on not only utilization  ...  In this paper, we develop new analysis techniques for parallel real-time task systems under Global Rate-Monotonic (G-RM) scheduling and obtain new results on schedulability bounds based on these two metrics  ...  In [23] , response analysis techniques for DAG tasks with constrained deadlines under both G-EDF and fixed priority scheduling were presented.  ... 
arXiv:2011.06762v1 fatcat:wscge2duercsfgbohr3xpp5o3a

Energy-aware Scheduling of Streaming Applications on Edge-devices in IoT based Healthcare

Umair Ullah Tariq, Haider Ali, Lu Liu, James Hardy, Muhammad Kazim, Waqar Ahmed
2021 IEEE Transactions on Green Communications and Networking  
DVFS for real-time streaming applications.  ...  Compared to R-DAG, the state-of-the-art approach designed for traditional Directed Acyclic Graph (DAG) based task graphs, R-CTG significantly reduces the re-timing latency because it only re-times tasks  ...  considered independent task graphs i.e. tasks without precedence constraints.  ... 
doi:10.1109/tgcn.2021.3056479 fatcat:ehf6cit4uvgo5adeuq2inbufxe

A Fully Preemptive Multiprocessor Semaphore Protocol for Latency-Sensitive Real-Time Applications

Bjorn B. Brandenburg
2013 2013 25th Euromicro Conference on Real-Time Systems  
The key to independence preservation is to ensure that tasks remain fully preemptive at all times. For example, on uniprocessors, the classic priority inheritance protocol is independence-preserving.  ...  The OMIP is the first independence-preserving, real-time, suspension-based locking protocol for clustered job-level fixed-priority scheduling.  ...  Response times of regular tasks with period p i = 100ms. Figure 3 : 3 Response times measured in LITMUS RT under C-EDFscheduling with the OMIP, the C-OMLP, and without locks.  ... 
doi:10.1109/ecrts.2013.38 dblp:conf/ecrts/Brandenburg13 fatcat:yot6uog37rbhrnzblpgdjcefly

Finding Response Times in a Real-Time System

M. Joseph
1986 Computer journal  
This seminar provides a venue for the exchange of ideas and the discussion of interesting unsolved problems in real-time scheduling.  ...  The format of the seminar positively encourages interaction between participants and provides ample time for relaxed discussions.  ...  Allocation of peri- odic task modules with precedence and deadline constraints in distributed real-time systems.  ... 
doi:10.1093/comjnl/29.5.390 fatcat:xsvmc5dpwjasvemenvs74lzzrm
« Previous Showing results 1 — 15 out of 299 results