نتایج جستجو برای: earliest deadline first edf policy

تعداد نتایج: 1686067  

2003
Anubhav Savant Nasir D. Memon Torsten Suel

Image transcoding proxies are used to improve Web browsing over low bandwidth networks by adapting content-rich web images to bandwidth-constrained clients. Such transcoding proxies dynamically analyze, manipulate and transcode images (e.g. quality reduction, down sampling) on the fly enabling significant reductions in download times over low bandwidth links. However, transcoding proxies have s...

2009
Sanjoy Baruah

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...

2011
Jeremy P. Erickson James H. Anderson

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...

1996
Steven Sommer

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...

2014
S. RamKumar V. Vaithiyanathan M. Lavanya

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...

Journal: :IJDSN 2013
Hussein El Ghor Maryline Chetto Rafic Hage Chehade

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 ...

2009
Franck Corset Stephane Despréaux Laurent Doyen Jean Kuntzmann

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.

2010
Simon Aittamaa Johan Eriksson Per Lindgren

With the growing complexity of modern embedded real-time systems, scheduling and managing of resources has become a daunting task. While scheduling and resource management for internal events can be simplified by adopting a commonplace real-time operating system (RTOS), scheduling and resource management for external events are left in the hands of the programmer, not to mention managing resour...

2014
Guangmo Tong

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).

2000
José María López Manuel García José Luis Díaz Daniel F. García

In this paper we present the utilization bound for Earliest Deadline First (EDF) scheduling on homogeneous multiprocessor systems with partitioning strategies. Assuming that tasks are pre-emptively scheduled on each processor according to the EDF algorithm, and allocated according to the First Fit (FF) heuristic, we prove that the worst-case achievable utilization is 0:5(n + 1), where n is the ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید