Filters








39,216 Hits in 6.6 sec

The End Of The Line For Static Cyclic Scheduling?

N. Audsley, K. Tindell, A. Burns
1993 Fifth Euromicro Workshop on Real-Time Systems  
Furthermore, tasks are assumed to have a release jitterthis occurs when the arrival time (i.e. time when a task wishes to run) and the release time (i.e. the time when the task is placed in the priority-ordered  ...  Section 3 provides a practical motivation for the use of offsets in hard real-time system design. Section 4 describes an efficient optimal priority assignment algorithm for tasks with offsets.  ...  Section 5 gives analysis to bound worst-case response times for such tasks.  ... 
doi:10.1109/emwrt.1993.639042 dblp:conf/ecrts/AudsleyTB93 fatcat:rxn7rxzctna7rkfzt23dheul6e

Robust Priority Assignment for Fixed Priority Real-Time Systems

R. I. Davis, A. Burns
2007 28th IEEE International Real-Time Systems Symposium (RTSS 2007)  
This paper focuses on priority assignment for realtime systems using fixed priority scheduling.  ...  The paper describes a Robust Priority Assignment algorithm that can find the robust priority ordering for a wide range of fixed priority system models and additional interference functions.  ...  [7] provided schedulability analysis for non-pre-emptive fixed priority scheduling.  ... 
doi:10.1109/rtss.2007.11 dblp:conf/rtss/DavisB07 fatcat:pdbfadp4dzdt3a66fftugvurqq

Page 934 of IEEE Transactions on Computers Vol. 52, Issue 7 [page]

2003 IEEE Transactions on Computers  
Using a fixed priority scheme like RM, however, does not prevent developing real-time applications with dynamic IEEE TRANSACTIONS ON COMPUTERS, VOL. 52, NO.7, JULY 2003 §sini £ 500 J } onlir yf expl ‘  ...  In this case, tollon using an RM priority assignment, the priority of a task is ’ fixed, but proportional to the target speed.  ... 

Holistic analysis of asynchronous real-time transactions with earliest deadline scheduling

Rodolfo Pellizzoni, Giuseppe Lipari
2007 Journal of computer and system sciences (Print)  
In distributed real-time systems, an application is often modeled as a set of real-time transactions, where each transaction is a chain of precedence-constrained tasks.  ...  Moreover, we extend the analysis to account for blocking time due to shared resources.  ...  Schedulability analysis of distributed real-time systems is an important problem that has been studied for a long time by the research community.  ... 
doi:10.1016/j.jcss.2006.04.002 fatcat:j56d3ubygbeapmxplcogfuev2m

Introducing a Component Technology for Safety Critical Embedded Real-Time Systems [chapter]

Kristian Sandström, Johan Fredriksson, Mikael Åkerholm
2004 Lecture Notes in Computer Science  
This results in a component technology for resource effective and temporally verified mapping of a component model to a commercial real-time operating system.  ...  In this paper we show how to use component based software engineering for low footprint systems with very high demands on safe and reliable behaviour.  ...  Real-time model The run-time system is assumed to be a traditional RTOS with Fixed Priority Scheduling (FPS) of tasks.  ... 
doi:10.1007/978-3-540-24774-6_18 fatcat:zputgsdbtzgtfc44zgyjlvnvii

Deferrable Scheduling for Temporal Consistency: Schedulability Analysis and Overhead Reduction

Ming Xiong, Song Han, Deji Chen
2006 12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA'06)  
The deferrable scheduling algorithm for fixed priority transactions (DS-FP) [23] is demonstrated to be a very effective approach for minimizing real-time update transaction workload while maintaining temporal  ...  validity of real-time data.  ...  fixed priority transactions with same priroity assignment (also see our technical report [24] for definition and proof).  ... 
doi:10.1109/rtcsa.2006.26 dblp:conf/rtcsa/XiongHC06 fatcat:yxrehp5jrvcevogj3s7jikhnvq

Exact Response Time Analysis for Fixed Priority Memory-Processor Co-Scheduling

Alessandra Melani, Marko Bertogna, Robert I. Davis, Vincenzo Bonifaci, Alberto Marchetti-Spaccamela, Giorgio Buttazzo
2017 IEEE transactions on computers  
In particular, a critical instant is identified for M/C tasks scheduled with fixed priority and an exact response time analysis with pseudo-polynomial complexity is provided.  ...  Then, we investigate the problem of priority assignment for M/C tasks, showing that a necessary condition to achieve optimality is to allow different priorities for the two phases.  ...  configuration may produce a larger response time; (iii) An exact response time analysis is derived for M/C systems scheduled with fixed priority, leading to a necessary and sufficient schedulability test  ... 
doi:10.1109/tc.2016.2614819 fatcat:zcwkcyuvzfddjg3unirniz2vmu

The Rubus component model for resource constrained real-time systems

Kaj Hanninen, Jukka Maki-Turja, Mikael Nolin, Mats Lindberg, John Lundback, Kurt-Lennart Lundback
2008 2008 International Symposium on Industrial Embedded Systems  
This thesis presents design and run-time techniques for efficient memory utilization in embedded real-time systems.  ...  The thesis ends with a presentation showing the integration of the proposed analysis technique in an integrated development environment.  ...  With the assigned priorities at hand, response time analysis can then be performed to verify schedulability of a system.  ... 
doi:10.1109/sies.2008.4577697 dblp:conf/sies/HanninenMNLLL08 fatcat:47phf5ls3fcjfn446dcshfevoy

Supporting Preemptive Task Executions and Memory Copies in GPGPUs

Can Basaran, Kyoung-Don Kang
2012 2012 24th Euromicro Conference on Real-Time Systems  
However, applying GPGPU technology to real-time computing is challenging due to the non-preemptive nature of GPGPUs.  ...  In addition, the response time of our approach is significantly shorter than those of the unmodified GPGPU runtime system that supports no preemption and an advanced GPGPU model designed to support prioritization  ...  To address these issues, we present a new approach, called PKM (Preemptive Kernel Model), which supports 1) preemption of kernels that implement periodic real-time tasks assigned fixed priorities, 2) efficient  ... 
doi:10.1109/ecrts.2012.15 dblp:conf/ecrts/BasaranK12 fatcat:ba3rymwqfvfo3kevcp54q6iiqa

Guest editorial: real-time networks and systems

Sébastien Faucou, Luís Miguel Pinho
2018 Real-time systems  
The 24th edition of the conference continued the established series with a rich program of 34 papers (out of 75 submissions), with a diversity of topics, such as transactions and distributed systems, network  ...  parallel programming models, scheduling of real-time parallel tasks, reliable software, run-time monitoring and real-time middleware.  ...  The issue completes with the paper "Response Time Analysis for Fixed Priority Systems with a Write-back Cache", written by Robert Ian Davis, Sebastian Altmeyer and Jan Reineke, that proposes analyses of  ... 
doi:10.1007/s11241-018-9317-8 fatcat:tmoek5fw3jh7vlzk5pm27piy64

Incremental reconfiguration and load adjustment in adaptive real time systems

Tei-Wei Kuo, A.K. Mok
1997 IEEE transactions on computers  
Theorem 3[LL73] For a set of two processes with a fixed priority assignment, the achievable utilization factor is 2(2 1/2 -1) Theorem 5 [LL73] For a set of m processes with fixed priority order, the achievable  ...  Theorem 2 [LL73] If a feasible fixed priority assignment exists for some process set, then the rate monotonic priority assignment is feasible for that process set.  ...  Is there an analysis method to evaluate the hypothesis of the choice of timing parameters on system reliability? Overload Detection for Sporadic Processes Copyright: All rights reserved, Prof.  ... 
doi:10.1109/12.641932 fatcat:gb5fkirplzccppvsb37g6q5j4i

Improving computation efficiency of schedulability of transaction-based task model for distributed real-time embedded systems

Hong Li, Zonghua Gu, Haibin Cai
2016 International Journal of Embedded Systems  
The transaction-based task model is especially useful for schedulability analysis in distributed real-time systems.  ...  For schedulability analysis of this task model, some authors have developed an exact analysis algorithm with exponential time complexity and a pessimistic tractable analysis algorithm with polynomial time  ...  Tindell [2] presented WCRT analysis algorithms for the transaction-based task model with fixed-priority preemptive scheduling.  ... 
doi:10.1504/ijes.2016.10000029 fatcat:jzfflqm5uvf5tmdlcg5vz5om2e

Energy Efficient Task Scheduling and Data Allocation Strategy in Heterogeneous Environment with Real Time Constraints

Rakesh D.More
2014 International Journal of Computer Applications  
An important problem is how to assign processors to real-time application tasks, obvious here basically concentrate on real time scheduling strategy.  ...  When higher priority transaction currently going to allocate processor and execute that transaction but another transaction is most needful to execute primary so using preemptive scheduling policy try  ...  It does not required fixed time interval for produce any transaction into application software and thus cause slow responsiveness of an application at unpredicted period.  ... 
doi:10.5120/17566-8225 fatcat:zp6twajeorcz3aqpx6bfpfwqru

Fixed-Priority Memory-Centric Scheduler for COTS-Based Multiprocessors

Gero Schwäricke, Tomasz Kloda, Giovani Gracioli, Marko Bertogna, Marco Caccamo, Marcus Völp
2020 Euromicro Conference on Real-Time Systems  
Our approach uses fixed-priority scheduling and proposes a global "memory preemption" scheme to boost real-time schedulability.  ...  However, even without said hardware support, it is possible to design an efficient memory-centric scheduler.  ...  [37] proposed exact response time analysis for fixed-priority scheduling on a single core with a fully preemptive DMA engine. Cache-based memory-centric scheduling.  ... 
doi:10.4230/lipics.ecrts.2020.1 dblp:conf/ecrts/SchwarickeKGBC20 fatcat:6aulrulamjbcvir2sh2ezimrie

Supporting Deliberative Real-Time AI Systems: A Fixed Priority Scheduling Approach

Yanching Chu, Alan Burns
2007 Real-Time Systems (ECRTS), Proceedings of the Euromicro Workshop on  
The works presented in this thesis provide new advances in fixed priority response time analysis for imprecise computation which, together with present results in the literature, should provide a more  ...  Constructing deliberative real-time AI systems is challenging due to the high execution-time variance in AI algorithms and the requirement of worst-case bounds for hard real-time guarantees, often resulting  ...  In Chapter 3 a review is provided for fundamental results in real-time scheduling, with an emphasis in response time analysis, and scheduling results in imprecise computation applicable for real-time AI  ... 
doi:10.1109/ecrts.2007.32 dblp:conf/ecrts/ChuB07 fatcat:ayfinirilbdxrhdjv5qc4wjyhu
« Previous Showing results 1 — 15 out of 39,216 results