We address the problem of combining the collective hard real-time resource requirements into a single hard real-time resource requirement supporting composability. We first propose a resource model to characterize a periodic resource allocation and present exact schedulability conditions for our proposed resource model under the EDF (earliest deadline first) and RM (rate monotonic) algorithms. ...

Recent trends toward multi-core architectures in real-time embedded systems pose challenges in designing efficient real-time multiprocessor scheduling algorithms. We believe that it is important to take into consideration both timing constraints of tasks (urgency) and parallelism restrictions of multiprocessor platforms (parallelism) together when designing scheduling algorithms. Motivated by t...

A scheduling algorithm is crucial for real-time simulations because it guarantees that each model meets its deadline. Traditional online real-time scheduling algorithms such as Earliest Deadline First (EDF) introduce a high overhead when scheduling a large number of models. In this paper, a new algorithm called time-stepped load balancing (TLS) is proposed to address the real-time execution of ...

While Grid users are often interested in satisfaction of their Quality of Service (QoS) requirements, these cannot be satisfactory handled by commonly used queuebased approaches. This paper concentrates on the application of schedule-based methods which allow both efficient handling of QoS requirements as well as traditional machine usage objective. An incremental application of our methods rea...

In this paper novel technique for CPU scheduling in real time operating systems by using genetic algorithm (GA) is proposed. Proposed adaptive algorithm is a combination of existing dynamic priority driven algorithm i.e. Earliest Deadline First (EDF) and new genetic algorithm (GA) based scheduling algorithm. First we have developed GA based scheduling algorithm and tested it during both under l...

This survey paper provides a detailed explanation of Long Term Evolution (LTE) cellular network’s packet scheduling algorithms in both downlink and uplink directions. It starts by explaining the difference between Orthogonal Frequency Division Multiple Access (OFDMA) that is used transmission, Single Carrier – (SC-FDMA) uplink. Then, it explains LTE process donwlink through interaction users sc...

In this paper, we focus on the Bluetooth wireless network, analyzing its ability to support Quality of Service (QoS) requirements defined by the application. We focus on two QoS parameters : (i) an application constraint denoting the importance degree of a message, and (ii) an end-to-end delivery deadline. In a first step, we introduce a local scheduling accounting for the two QoS parameters in...

The paper investigates the behavior of four transformer models in electromagnetic transients programs (EMTP) when calculating inrush currents due to shell-type transformers energization. These models are single-phase Saturable Transformer (STC), BCTRAN, Hybrid Transformer (XFMR) and UMEC. The measurements of a real transformer energization performed by EDF in France are used to evaluate the acc...

CEA, ANDRA and EDF are jointly developing the software platform ALLIANCES which aim is to produce a tool for the simulation of nuclear waste storage and disposal repository. This type of simulations deals with highly coupled thermo-hydro-mechanical and chemical (T-H-M-C) processes. A key objective of Alliances is to give the capability for coupling algorithms development between existing codes....

This paper compares the performance of several variations on EDF-based global and partitioned multiprocessor scheduling algorithms, together with their associated feasibility tests, on a variety of pseudo-randomly chosen sets of sporadic tasks. A new hybrid EDF-based scheme is shown to perform better than previously studied priority-based global scheduling schemes, though not as well as EDF-bas...