The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Real-time streaming applications with cyclic data dependencies that are executed on multiprocessor systems with processor sharing usually require a temporal analysis to give guarantees on their temporal behavior at design time. Current accurate analysis techniques for cyclic applications that are scheduled with Static Priority Preemptive (SPP) schedulers are however limited to the analysis of applications...
The development of Internet and Web systems in recent years has made it difficult and challenging to deal with large-scale data. What we usually need to process is incremental data, the scale of which will enlarge with the changing of time. Nowadays, many general queries over data is traditionally based on the full amount of raw data, which becomes a great challenge to performance when the data increases...
Network calculus (also known as real-time calculus) and event stream theory are two theories designed to compute upper bounds on response time for real-time systems. Both generalise the common periodic request arrival to any kind of workload using cumulative functions. In network calculus, a data flow is modelled by its cumulative curve, A(t), representing the amount of data sent by the flow up to...
Time Basic Petri nets are an expressive extension of Petri nets, suitable to model real-time systems. This paper introduces a coverability analysis technique to cope with structurally unbounded Time Basic Petri net models exhibiting non-urgent behavior: i.e., models in which transitions may choose to do not fire and let time pass, even if this could lead to transition disabling. The approach we present...
Real-time task graphs are used to describe complex real-time systems with non-cyclic timing behaviors. The workload of such systems are typically bursty, which may degrade their schedulability even with sufficient resource in the long term. In this paper, we propose to use task graph transformation to improve system schedulability. The idea is to insert artificial delays to the release times of certain...
In a multi-core system with shared resources, the accesses to the shared resources from several cores may experience non-deterministic arbitration delay due to resource contention. Such delay should be considered conservatively in the worst case response time (WCRT) analysis of multi-core systems. Recently, several techniques have been proposed to account for arbitration delay for shared resource...
Functional Reactive Programming (FRP) is a declarative approach for modeling and building reactive systems. The FRP has been shown to be an expressive formalism for building graphics, robotic, and vision applications. The Priority-based FRP (P-FRP) is a formalism of FRP that allows preemption of execution and guarantees real-time response. Since functional programs cannot maintain state and mutable...
Nowadays dangerous, repetitive or precision requiring jobs are done by robots like flying drones, industrial assembly arms or medical assistants. In all these cases, human beings can interact with the machines, therefore it is essential to guarantee that every part of the robot's software and hardware will produce a safe behavior: both the overall behavior and the local behaviors of such embedded...
The rating (score) and knowledge of the payment behavior of a client to reduce the time of granting of consumer credit is one of the requirements that financial institutions have dedicated to providing these services. For qualifying customers, these entities are based on qualitative and quantitative information of a client, making it difficult a homogeneous rating. Because of the need to reduce response...
The analysis of probabilistic schedulability explores all possible combinations of the probabilities of task attributes, which can easily lead to exponential computation time [24]. In this paper, we present a flexible schedulability analysis framework for periodic and sporadic tasks having probabilistic attributes where the computation time scales linearly in the size of analyzed systems. The framework...
Response Time Analysis (RTA) is one of the key problems in real-time system design. This paper proposes new RTA methods for EDF scheduling, with general system models where workload and resource availability are represented by request/demand bound functions and supply bound functions. The main idea is to derive response time upper bounds by lower-bounding the slack times. We first present a simple...
We provide four new schedulability tests for a scheduling model according to which there is a high priority task concurrently executed with a set of EDF-scheduled tasks. All tests are proved correct and have their performance evaluated by simulation.
Limited preemption models have been proposed as a viable alternative between the two extreme cases of fully preemptive and non-preemptive scheduling. In particular, allowing preemption to occur only at predefined preemption points reduces context switch costs, simplifies the access to shared resources, and allows more predictable estimations of worst-case execution times. Current results related to...
The generalized multi frame (GMF) task has been proposed to model a task whose execution times, deadlines and minimum separation times are changed according to a specified pattern. In this paper we relax the assumption of having a specified activation pattern, this yields to non-cyclic GMF task. In this context, current schedulability analysis techniques for GMF task sets under dynamic priority assignment...
Modern computing systems have adopted multicore architectures and multiprocessor systems on chip (MPSoCs) for accommodating the increasing demand on computation power. However, performance boosting is constrained by shared resources, such as buses, main memory, DMA, etc.This paper analyzes the worst-case completion (response) time for real-time tasks when time division multiple access (TDMA) policies...
Schedulability analysis based the worst-case response time is an important research issue in real-time systems. Due to the restriction that the traditional schedulability analysis for fault-tolerant real-time systems only considered that the deadline of each task must be no larger than its period, this paper extends the computation model that the deadline of each task can be longer than its period...
Round-Robin scheduling is the most popular time triggered scheduling policy, and has been widely used in communication networks for the last decades. It is an efficient scheduling technique for integration of unrelated system parts, but the worst-case timing depends on the system properties in a very complex way. The existing works on response time analysis of task scheduled under Round-Robin determine...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.