This paper focuses on the problem of providing efficient run-time support to multimedia applications in a real-time system, where two types tasks can coexist simultaneously: soft and hard tasks. Hard are guaranteed based worst case execution times minimum interarrival times, whereas served mean parameters. The describes server-based mechanism for scheduling without jeopardizing priori guarantee activities. performance proposed method is compared with that similar service mechanisms through...

Knowledge of complexity, fundamental limits and performance bounds-well known for many scheduling problems-helps real time designers choose a good design algorithm avoid poor ones. The problem has so dimensions that it no accepted taxonomy. We divide theory between uniprocessor multiprocessor results. In the section, we begin with independent tasks then consider shared resources overload. work static dynamic algorithms.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML"...

Recent advances in wireless technology have brought us closer to the vision of pervasive computing where sensors/actuators can be connected through a network. Due cost constraints and dynamic nature sensor networks, it is undesirable assume existence base stations by wired backbone. In this paper, we present network architecture suitable for networks along with medium access control protocol based on earliest deadline first.

An increasing number of real time applications, related to multimedia and adaptive control systems, require greater flexibility than classical theory usually permits. We present a novel periodic task model, in which tasks' periods are treated as springs, with given elastic coefficients. Under this framework, tasks can intentionally change their execution rate provide different quality service, the other automatically adapt keep system underloaded. The proposed model also be used handle...

An increasing number of real-time applications related to multimedia and adaptive control systems require greater flexibility than classical theory usually permits. We present a novel scheduling framework in which tasks are treated as springs with given elastic coefficients better conform the actual load conditions. Under this model, periodic can intentionally change their execution rate provide different quality service other automatically adapt periods keep system underloaded. The proposed...

Feasibility analysis of fixed priority systems has been widely studied in the real-time literature and several acceptance tests have proposed to guarantee a set periodic tasks. They can be divided two main classes: polynomial time exact tests. Polynomial efficiently used for online applications, where tasks are activated at runtime. These introduce negligible overhead, when executed upon new task arrival, however provide only sufficient schedulability condition, which may cause poor...

The question whether preemptive algorithms are better than nonpreemptive ones for scheduling a set of real-time tasks has been debated long time in the research community. In fact, especially under fixed priority systems, each approach advantages and disadvantages, no one dominates other when both predictability efficiency have to be taken into account system design. Recently, limited preemption models proposed as viable alternative between two extreme cases fully scheduling. This paper...

This article presents a survey of energy-aware scheduling algorithms proposed for real-time systems. The analysis the main results starting from middle 1990s until today, showing how solutions evolved to address evolution platform's features and needs. first taxonomy classify existing approaches uniprocessor systems, distinguishing them according technology exploited reducing energy consumption, that is, Dynamic Voltage Frequency Scaling (DVFS), Power Management (DPM), or both. Then,...

Most unmanned aerial vehicles nowadays engage in coverage missions using simple patterns, such as back-and-forth and spiral. However, there is no general agreement about which one more appropriate. This letter proposes an E-Spiral algorithm for accurate photogrammetry that considers the camera sensor flight altitude to apply overlapping necessary guarantee mission success. The uses energy model set different optimal speeds straight segments of path, reducing consumption. We also propose...

Different task models have been proposed to represent the parallel structure of real-time tasks executing on manycore platforms: fork/join, synchronous parallel, DAG-based, etc. Despite different schedulability tests and resource augmentation bounds are available for these systems, we experience difficulties in applying such results real application scenarios, where execution flow is characterized by multiple (and nested) conditional structures. When a branch drives number size sub-jobs...

Techniques originating from the Internet of Things (IoT) and Cyber-Physical Systems (CPS) areas have extensively been applied to develop intelligent pervasive systems such as assistive monitoring, feedback in telerehabilitation, energy management, negotiation. Those application domains particularly include three major characteristics: intelligence, autonomy real-time behavior. Multi-Agent (MAS) are one technological paradigms that used implement systems. However, they mainly address first...

Deep learning and convolutional neural networks allow achieving impressive performance in computer vision tasks, such as object detection semantic segmentation (SS). However, recent studies have shown evident weaknesses of models against adversarial perturbations. In a real-world scenario instead, like autonomous driving, more attention should be devoted to examples (RWAEs), which are physical objects (e.g., billboards printable patches) optimized the entire perception pipeline. This paper...

Ethernet was not originally developed to meet the requirements of real-time industrial automation systems and it commonly considered unsuited for applications at field level. Hence, several techniques were make this protocol exhibit behavior, some them requiring specialized hardware, others providing soft-real-time guarantees only, or achieving hard with different levels bandwidth efficiency. More recently, there has been an effort support quality-of-service (QoS) negotiation enforcement but...

We present a comparative study among scheduling algorithms which use different priority assignments and guarantee mechanisms to improve the performance of real-time system during overload conditions. In order enhance quality service, we assume that tasks are characterized not only by deadline, but also an importance value. The algorithm is then evaluated computing cumulative value gained on task set, i.e. sum values those completed their deadline. purpose this simulation was twofold....