The increasing acceptance of the Earliest Deadline First (EDF) scheduling algorithm in industrial environments, together with the continued usage of Fixed Priority (FP) scheduling is leading to heterogeneous systems with different scheduling policies in the same distributed system. Schedulability analysis techniques usually consider the entire system as a whole (holistic approach), with only on...

This paper proposes a QoS-Aware Optical Connection Setup Management scheme that uses the Earliest Deadline First (EDF) queueing discipline to schedule the setup of the optical connections. The benefits of this EDF-based scheme are twofold: a) it reduces the blocking probability since blocked connection requests due to resource unavailability are queued for possible future setup opportunities an...

The contention-free policy has received attention in real-time multiprocessor scheduling owing to its wide applicability and significant improvement in offline schedulability guarantees. Utilizing the notion of contention-free slots in which the number of active jobs is smaller than or equal to the number of processors, the policy improves the schedulability by offloading executions in contendi...

A new technique was recently introduced [7] for the analysis of real-time systems scheduled on multiprocessor platforms by the global Earliest Deadline First (EDF) scheduling algorithm. In this paper, this technique is adapted and applied to the schedulability analysis of realtime systems scheduled on multiprocessor platforms by the global Deadline-Monotonic (DM) scheduling algorithm. It is sho...

Prior work has provided bounds on the deadline tardiness that a set of sporadic real-time tasks may incur when scheduled using the global earliest-deadline-first (G-EDF) scheduling algorithm. Under the sporadic task model, it is necessary that no individual task overutilize a single processor and that the set of all tasks does not overutilize the set of all processors. In this work we generaliz...

In this paper we extend the results for the mixed scheduling algorithm of Liu and Layland in [3]. It is the seminal paper for the basic real-time scheduling algorithms: Rate Monotonic Scheduling (RMS) and Earliest Deadline First (EDF) Scheduling, and for their corresponding schedulability tests [1,2,4,5,7]. In a final section of the paper the authors also investigate the mixed scheduling algori...

Cloud Environment allows users to access on-demand IT resources over the cyberspace based on pay per use pattern. Optimizing the resource utilizationand reducing the amount of active server machine usage in clouds become a challenging task. The major intend of this work is to builda model which supports balancing the workload in cloud datacenters and minimizing the amount of active servers to s...

Ambient energy harvesting also known as energy scavenging is the process where energy is obtained from the environment, converted, and stored to power small devices such as wireless sensors. We present a variant of EDF scheduling algorithm called EH-EDF (Energy Harvesting-Earliest Deadline First). Decisions are taken at run-time without having prior knowledge about the future energy production ...

The aim of this talk is to present the software tool MARS (Maintenance Assessment of Repairable Systems), developed by EDF R&D and Grenoble University. MARS implements imperfect maintenance (virtual age) models and estimates jointly the effects of ageing and maintenance (preventive and/or corrective) efficiency on real data sets from field feedback.

This is the review of two papers, Tardiness Bounds under Global EDF Scheduling on a Multiprocessor (RTSS’05) and An O(m) Analysis Technique for Supporting Real-Time Self-Suspending Task Systems (RTSS’12).