A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
Filters
Analysis of window-constrained execution time systems
2006
Real-time systems
Preserved Fulltext
Feasibility tests for hard real-time systems provide information about the schedulability of the task set. ...
The extra time can be determined not only in all the task activations, but in n of a window of m invocations. This is what we call a window-constrained execution time system. ...
This extra time can be used to re-execute the task in certain faults. Our work has focused on the real-time scheduling theory of window-constrained execution time systems. ...
doi:10.1007/s11241-006-9004-z
fatcat:cd5a4fwxajgpjioxipqhthby6i
Vulnerability Analysis and Mitigation of Directed Timing Inference Based Attacks on Time-Triggered Systems
2018
Euromicro Conference on Real-Time Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
In this paper, we analyze the severity of these vulnerabilities by assuming successful compromise of a subset of the tasks running in a real-time system and by investigating the attack potential that attackers ...
ACM Subject Classification Computer systems organization → Real-time systems, Software and its engineering → Scheduling, Security and privacy → Operating systems security Keywords and phrases real-time ...
Acknowledgements We want to thank the reviewers for their helpful comments which greatly improved this paper. We are also gratefully indebted to Ali Syed, Florian Heilmann and Rodrigo ...
doi:10.4230/lipics.ecrts.2018.22
dblp:conf/ecrts/KrugerVF18
fatcat:sxqlxf7p3rcyfhjdxutezg2veq
Generalized Weakly Hard Schedulability Analysis for Real-Time Periodic Tasks
2020
ACM Transactions on Embedded Computing Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
The analysis applies to constrained-deadline periodic real-time systems scheduled with fixed priority and no knowledge of the task activation offsets, while allowing for activation jitter. ...
The weakly hard model allows to constrain the maximum number of acceptable missed deadlines in any set of consecutive task executions. ...
Schedulability analysis for hard real-time systems has been investigated in the past and solutions exist for many cases of interest. ...
doi:10.1145/3404888
fatcat:4mdyfdqpynbsvo7pavnetlhl5i
Energy-constrained scheduling for weakly-hard real-time systems
2005
26th IEEE International Real-Time Systems Symposium (RTSS'05)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
We adopt the weakly-hard realtime scheduling paradigm to ensure a predictable performance for all the tasks: Our aim is to minimize the number of dynamic failures (in terms of (m,k)-firm deadline constraints ...
In this paper, we explore performance optimization problems for real-time systems that have to rely on a fixed energy budget during an operation/mission. ...
Figure 1 shows a sample schedule for a (2,3)-firm real-time task over six consecutive periods. ...
doi:10.1109/rtss.2005.18
dblp:conf/rtss/AlEnawyA05
fatcat:hofu35gifree7naqep6agaxk6e
Schedulability analysis of DAG tasks with arbitrary deadlines under global fixed-priority scheduling
2019
Real-time systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
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. ...
Abstract 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. ...
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
Synchronizing Real-Time Tasks in Time-Triggered Networks
2021
Zenodo
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
2021 IEEE 24th International Symposium on Real-Time Distributed Computing (ISORC) ...
and (a) a real-time task scheduler. ...
This paper investigates the problem of synchronizing the execution of real-time tasks with a time-triggered communication layer. ...
doi:10.5281/zenodo.5856419
fatcat:5elbxuhb5jd7powysetve73r24
Research On Weakly Hard Real-Time Constraints And Their Boolean Combination To Support Adaptive Qos
2009
Zenodo
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
There are two extensions, which are the (m, k)-firm model and Window-Constrained model. This paper researches on weakly hard real-time constraints and their combination to support QoS. ...
The fact that a practical application can tolerate some violations of temporal constraint under certain distribution is employed to support adaptive QoS on the open real-time system. ...
For arrival time and execution time of the task in CBS are random, the main thought of weakly hard real-time constant bandwidth server should be the object scheduled by WHRTS, not be the task in CBS. ...
doi:10.5281/zenodo.1062111
fatcat:6o7rsqxmgvaavlrpkhlxeg6ta4
A Time-predictable Open-Source TTEthernet End-System
2020
Journal of systems architecture
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
For the computation, end-systems need time-predictable processors where the worst-case execution time of the application tasks can be analyzed statically. ...
The operation of such systems requires coordinated execution of the individual tasks with bounded communication network latency to guarantee quality-of-control. ...
Acknowledgement This research has received funding from the European Union's Horizon 2020 research and innovation programme under the Marie Sk ł odowska-Curie grant agreement no. 764785 , FORA -Fog Computing for ...
doi:10.1016/j.sysarc.2020.101744
fatcat:zcnixytbgvdqvfgmkul7ctwel4
Guest editorial: Special issue on ECRTS 2008
2009
Real-time systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
As a consequence, most embedded systems have requirements to adapt the timing of their response to the changes of their environment, which leads to the need for using real-time techniques and methods in ...
These systems usually control or monitor artefacts and elements of the outside world that change with time. ...
The first paper: "An analysis of global EDF schedulability for arbitrary-deadline sporadic task systems" by Baker and Baruah, is concerned with the fundamental question of schedulability for EDF systems ...
doi:10.1007/s11241-009-9077-6
fatcat:ilpb4bgsnvgm5phjtis4saqzve
Implementing soft real-time agent control
2001
Proceedings of the fifth international conference on Autonomous agents - AGENTS '01
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
, and those which facilitate on-line real-time control, including scheduling flexibility, caching, and windowed commitments. ...
Two types of enhancements are covered: those which enable planning to meet real-time constraints, such as our task representation, metalevel costing, alternative plan selection, and partial-order scheduling ...
In a real-time environment, where the agent must constantly reevaluate their execution schedule in the face of varied action characteristics, this sort of control architecture was impractical. ...
doi:10.1145/375735.376329
dblp:conf/agents/VincentHLW01
fatcat:36dd3nlsn5gxxkkteihdvvprfm
Hybrid Workflow Scheduling on Edge Cloud Computing Systems
2021
IEEE Access
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
We provide a multi-objective optimization model for execution time and monetary cost under constraints of deadline and throughput. ...
In comparison to a meta-heuristics technique using Particle Swarm Optimization (PSO), the proposed scheduler provides significant improvement for large-scale hybrid workflows in terms of execution time ...
The technique is not suitable for time-sensitive applications due to the complexity of real-time windows size identification. Deypir et al. ...
doi:10.1109/access.2021.3116716
fatcat:4n73d2x7cbdepalalfjugesqbu
Response-time analysis of arbitrarily activated tasks in multiprocessor systems with shared resources
2009
2009 Design, Automation & Test in Europe Conference & Exhibition
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
As multiprocessor systems are increasingly used in real-time environments, scheduling and synchronization analysis of these platforms receive growing attention. ...
In this paper, we address these constraints and present a general analysis which allows the calculation of response times for fixed priority task sets with arbitrary activations and deadlines in a partitioned ...
For long, however, real-time analysis has focused on constrained task models -i.e. periodic activation and deadlines not larger than the periods. ...
doi:10.1109/date.2009.5090720
dblp:conf/date/NegreanSE09
fatcat:mpdsospdfvdqjlvkaaaapuao3m
A multiprocessor real-time scheduling simulation tool
2012
CONIELECOMP 2012, 22nd International Conference on Electrical Communications and Computers
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we introduce RealtssMP, a tool to perform scheduling analysis and simulation of multiprocessor real-time scheduling algorithms. ...
One alternative to verify the schedulability of a real-time task set with a larger system utilization on a multiprocessor system, is through the use of exhaustive simulation. ...
Examples of real-time systems include digital control, command and control, signal processing, and telecommunication systems [26] . A real-time system is comprised of several tasks. ...
doi:10.1109/conielecomp.2012.6189901
dblp:conf/conielecomp/Diaz-RamirezVM12
fatcat:qt3hadv7ubenzaiz3igdhg5cp4
From Dataflow Specification to Multiprocessor Partitioned Time-triggered Real-time Implementation
2013
Leibniz Transactions on Embedded Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Then, we provide novel algorithms for the off-line scheduling of these extended specifications onto partitioned time-triggered architectures à la ARINC 653. ...
Allocation of time slots/windows to partitions can be fully or partially provided, or synthesized by our tool. ...
Compared to classical work on the on-line real-time scheduling of tasks with execution modes (cf. ...
doi:10.4230/lites-v002-i002-a001
dblp:journals/lites/CarlePSL15
fatcat:7c2bz23n7rg6nguukkfatyhqpy
Decentralized multi-robot allocation of tasks with temporal and precedence constraints
2017
Advanced Robotics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In our approach each robot owns its schedule for the subset of tasks assigned to it. A schedule is represented as a simple temporal network (STN) [4] , which stores the execution times of the tasks. ...
Temporal constraints are expressed as time windows, within which a task must be executed. ...
After the tasks are allocated, when the start time arrives robots execute the tasks in their schedules in real time in ROS/Gazebo. ...
doi:10.1080/01691864.2017.1396922
fatcat:nvbk2pv4dve67bsaeywxoynpm4
« Previous
Showing results 1 — 15 out of 28,148 results