Relevant bibliographies by topics / Earliest Deadline First

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Book chapters
  4. Conference papers

Academic literature on the topic 'Earliest Deadline First'

Author: Grafiati
Published: 4 June 2021
Last updated: 18 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Earliest Deadline First.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Earliest Deadline First"

1

Srivastava, Alok. "Ada Issue 00357: support for deadlines and earliest deadline first scheduling." ACM SIGAda Ada Letters XXVI, no. 2 (August 2006): 60–68. http://dx.doi.org/10.1145/1165678.1165685.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Gunzel, Mario, Georg von der Bruggen, and Jian-Jia Chen. "Suspension-Aware Earliest-Deadline-First Scheduling Analysis." IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 39, no. 11 (November 2020): 4205–16. http://dx.doi.org/10.1109/tcad.2020.3013095.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Lim, Teck Meng, Bu-Sung Lee, and Chai Kiat Yeo. "Quantum-Based Earliest Deadline First Scheduling for Multiservices." IEEE Transactions on Multimedia 9, no. 1 (January 2007): 157–68. http://dx.doi.org/10.1109/tmm.2006.886380.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Kruk, Łukasz, John Lehoczky, Steven Shreve, and Shu-Ngai Yeung. "Earliest-deadline-first service in heavy-traffic acyclic networks." Annals of Applied Probability 14, no. 3 (August 2004): 1306–52. http://dx.doi.org/10.1214/105051604000000314.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Xiong, Ming, Qiong Wang, and Krithi Ramamritham. "On earliest deadline first scheduling for temporal consistency maintenance." Real-Time Systems 40, no. 2 (June 5, 2008): 208–37. http://dx.doi.org/10.1007/s11241-008-9055-4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Bouakaz, Adnan, and Jean-Pierre Talpin. "Buffer minimization in earliest-deadline first scheduling of dataflow graphs." ACM SIGPLAN Notices 48, no. 5 (May 23, 2013): 133–42. http://dx.doi.org/10.1145/2499369.2465558.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Kruk, Łukasz, John Lehoczky, and Steven Shreve. "Accuracy of state space collapse for earliest-deadline-first queues." Annals of Applied Probability 16, no. 2 (May 2006): 516–61. http://dx.doi.org/10.1214/105051605000000809.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Gharsellaoui, Hamza, Mohamed Khalgui, and Samir Ben Ahmed. "New Optimal Preemptively Scheduling for Real-Time Reconfigurable Sporadic Tasks Based on Earliest Deadline First Algorithm." International Journal of Advanced Pervasive and Ubiquitous Computing 4, no. 2 (April 2012): 65–81. http://dx.doi.org/10.4018/japuc.2012040106.

Full text
Abstract:
This paper examines the problem of scheduling the mixed workload of both sporadic (on-line) and periodic (off-line) tasks on uniprocessor in a hard real-time environment. The authors introduce an optimal earliest deadline scheduling algorithm to optimize response time while ensuring that all periodic tasks meet their deadlines and to accept as many sporadic tasks. A necessary and sufficient schedulability test is presented, and an efficient O(n+m) guarantee algorithm is proposed. This optimal algorithm results in dynamic scheduling solutions. They are presented by a proposed intelligent agent-based architecture where a software agent is used to evaluate the response time, to calculate the processor utilization factor and also to verify the satisfaction of real-time deadlines. The agent dynamically provides technical solutions for users where the system becomes unfeasible by sending sporadic tasks to idle times, by modifying the deadlines of tasks, the worst case execution times (WCETs), the activation time, by tolerating some non critical tasks according to the (m, n) firm and a reasonable cost, or in the worst case by removing some non hard (soft) tasks according to predefined heuristic. The authors implement the agent to support these services which are applied to extensive experiments with real-life design examples in order to demonstrate the effectiveness and the excellent performance of the new optimal algorithm in normal and overload conditions.
APA, Harvard, Vancouver, ISO, and other styles
9

Ye, Jiang, and Jian Li. "The Improvement of Real-Time Performance of 3-Tier C/S Using LAD Scheduling Algorithm in Middleware." Advanced Materials Research 139-141 (October 2010): 1789–92. http://dx.doi.org/10.4028/www.scientific.net/amr.139-141.1789.

Full text
Abstract:
This paper studied the real-time performance of three-tier client/server architecture used in remote monitoring system. A scheduling algorithm was adopted in middleware of this architecture, which based on the regulation: setting the priority of task according to the percentage of useful data in the data-buffer or the LAD (most locally available data first) but not according to the earliest deadline. Contrast simulation of the improved algorithm and EDF (earliest deadline first algorithm) had been achieved from program developed using VC++ at different average task lengths and update workloads under the tentative parameters such as the size of data in different data-buffer, the time used for fetch an object from these data-buffers and average task inter-arrival time. The results showed that the LAD’s completed task percentage before deadlines was higher than EDF, which proved LAD was more suitable to improve the real-time performance of three-tier client/server architecture.
APA, Harvard, Vancouver, ISO, and other styles
10

Shehzad, Muhammad Naeem, Qaisar Bashir, Ghufran Ahmad, Adeel Anjum, Muhammad Naeem Awais, Umar Manzoor, Zeeshan Azmat Shaikh, Muhammad A. Balubaid, and Tanzila Saba. "Thermal-aware resource allocation in earliest deadline first using fluid scheduling." International Journal of Distributed Sensor Networks 15, no. 3 (March 2019): 155014771983441. http://dx.doi.org/10.1177/1550147719834417.

Full text
Abstract:
Thermal issues in microprocessors have become a major design constraint because of their adverse effects on the reliability, performance and cost of the system. This article proposes an improvement in earliest deadline first, a uni-processor scheduling algorithm, without compromising its optimality in order to reduce the thermal peaks and variations. This is done by introducing a factor of fairness to earliest deadline first algorithm, which introduces idle intervals during execution and allows uniform distribution of workload over the time. The technique notably lowers the number of context switches when compare with the previous thermal-aware scheduling algorithm based on the same amount of fairness. Although, the algorithm is proposed for uni-processor environment, it is also applicable to partitioned scheduling in multi-processor environment, which primarily converts the multi-processor scheduling problem to a set of uni-processor scheduling problem and thereafter uses a uni-processor scheduling technique for scheduling. The simulation results show that the proposed approach reduces up to 5% of the temperature peaks and variations in a uni-processor environment while reduces up to 7% and 6% of the temperature spatial gradient and the average temperature in multi-processor environment, respectively.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Earliest Deadline First"

1

Zhu, Kaiqian. "Limited Preemptive Earliest Deadline First Scheduling of Real-Time Tasks on Multiprocessors." Thesis, Mälardalens högskola, Inbyggda system, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-28252.

Full text
Abstract:
Real-time systems are employed in many areas, such as aerospace and defenses. In real-time systems, especially in hard real-time systems, it is important to meet the associated time requirements. With the increasing demand for high speed processing capabilities, the requirement for high computing power is becoming more and more urgent. However, it is no longer possible to increase processor speeds because of thermal and power constraints. Consequently, industry has focused on providing more computing capabilities using more number of processors.As to the scheduling policies, they can be classified into two categories, preemptive and non-preemptive. Preemptive scheduling allows preemptions arbitrarily, whereas it implies prohibitively high preemption related overheads. On the contrary, the non-preemptive scheduling which do not allow preemption at all, will not have such overheads, but suffers due to the block time on high priority tasks. Limited preemptive scheduling, that builds on the best of preemptive and non-preemptive scheduling, benefits from the limited number of preemptions without a major effect on real-time properties. It is proved that limited preemptive scheduling dominates preemptive and non-preemptive scheduling on uniprocessors under fixed priority. However, less work has been done on multiprocessor limited preemptive scheduling, especially under Earliest Deadline First (EDF). On a multiprocessor, limited preemptively scheduling real-time tasks imply an additional challenge with respect to determining which of the running task to preempt. On one extreme, the scheduler can preempt the lowest priority running task and this is referred to as Adaptive Deferred Scheduling (ADS). On the other hand, the scheduler can preempt any lower priority running task that becomes pre-emptible. Such a scheduler is referred to as Regular Deferred Scheduling (RDS)In this work, we empirically investigate the performance of ADS and RDS, and compare it with the global preemptive and non-preemptive scheduling, in the context of an EDF based scheduler. Our empirical investigation revealed that the number of preemptions under ADS is less compared to RDS, at runtime. This is due to the fact that by delaying preemptions, the higher priority tasks that are released subsequently will run in priority order thereby avoiding the need for more preemptions. Also, by delaying preemptions, the possibility of one or more processors becoming available increases. Experiments investigating the schedulability ratio shows that ADS and RDS performs almost equally well, but better than fully non-preemptive scheduling.
APA, Harvard, Vancouver, ISO, and other styles
2

Nyberg, Angelica, and Jonas Hartman. "Evaluation of EDF scheduling for Ericsson LTE system : A comparison between EDF, FIFO and RR." Thesis, Linköpings universitet, Programvara och system, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-131551.

Full text
Abstract:
Scheduling is extremely important for modern real-time systems. It enables several programs to run in parallel and succeed with their tasks. Many systems today are real-time systems, which means that good scheduling is highly needed. This thesis aims to evaluate the real-time scheduling algorithm earliest deadline first, newly introduced into the Linux kernel, and compare it to the already existing real-time scheduling algorithms first in, first out and round robin in the context of firm tasks. By creating a test program that can create pthreads and set their scheduling characteristics, the performance of earliest deadline first can be evaluated and compared to the others.
Schemaläggning är extremt viktigt för dagens realtidssystem. Det tillåter att flera program körs parallellt samtidigt som deras processer inte misslyckas med sina uppgifter. Idag är många system realtidssystem, vilket innebär att det finns ett ytterst stort behov för en bra schemaläggningsalgoritm. Målet med det här examensarbetet är att utvärdera schema-läggningsalgoritmen earliest deadline first som nyligen introducerats i operativsystemet Linux. Målet är även att jämföra algoritmen med två andra schemaläggningsalgoritmer (first in, first out och round robin), vilka redan är väletablerade i Linux kärnan. Det här görs med avseende på processer klassificerade som firm. Genom att skapa ett program som kan skapa pthreads med önskvärda egenskaper kan prestandan av earliest deadline first algoritmen utvärderas, samt jämföras med de andra algoritmerna.
APA, Harvard, Vancouver, ISO, and other styles
3

Pokorný, Martin. "Mechanismy plánování RT úloh při nedostatku výpočetních a energetických zdrojů." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2012. http://www.nusl.cz/ntk/nusl-236596.

Full text
Abstract:
This term project deals with the problem of scheduling real-time tasks in overload conditions and techniques for lowering power consumption. Each of these parts features mechanisms and reasons for their using. There are also described specific algorithms, that are implemented, in operating system uC/OS-II, and compared in next phase of master's thesis.
APA, Harvard, Vancouver, ISO, and other styles
4

Kloda, Tomasz. "Conditions d’ordonnançabilité pour un langage dirigé par le temps." Thesis, Toulouse, ISAE, 2015. http://www.theses.fr/2015ESAE0019/document.

Full text
Abstract:
Les travaux réalisés dans le cadre de cette thèse ont pour objectif de proposer un langage de description temporelle pour des systèmes temps-réel et d’établir les conditions de leur ordonnançabilité sous l’algorithme Earliest Deadline First (EDF). Les langages de description temporelle permettent de spécifier le comportement temporel d’une application indépendamment de son comportement fonctionnel. Le programmeur déclare dans ces langages à quels instants précis doivent être déclenchées et terminées les activités du système. Cette gestion du temps, précise et explicite, apporte au système son caractère déterministe. Le langage proposé, Extended Timing Definition Language (E-TDL), étend des langages dirigés par le temps existants, en particulier Giotto et TDL, en introduisant un nouveau modèle de tâche donné par quatre paramètres : phase, pire temps d’exécution, temps d’exécution logique TEL (intervalle de temps séparant le lancement de la tâche et sa terminaison) et période. L’introduction de ce nouveau modèle de tâche nécessite de revisiter en particulier le problème de l’ordonnançabilité des tâches pour EDF. Cette thèse propose et développe une analyse basée sur la fonction de demande pour des ensembles de tâches décrites en E-TDL et s’exécutant en contexte monoprocesseur. Une condition nécessaire et suffisante est obtenue au travers d’une analyse précise des intervalles séparant les activations de tâches au sein de différents modules s’exécutant indépendamment et pouvant changer de mode à des instants prédéfinis. Une borne de la longueur des intervalles sur lesquels doit s’opérer la vérification est déterminée. Un outil mettant en œuvre cette analyse a été développé
The goal of this research is to define a time-triggered language for modeling real-time systems and to provide the conditions for their schedulability under Earliest Deadline First (EDF). Time-triggered languages separate the functional part of applications from their timing definition. These languages permit to model the real-time system temporal behavior by assigning system activities to particular time instants. We propose a new time-triggered framework, Extended Timing Definition Language (E-TDL), that enhances the basic task model used in Giotto and TDL while keeping compositional and modular structure brought by the latter. An E-TDL task is characterized by: an offset, a worst case execution time, a Logical Execution Time (a time interval between task release and its termination) and a period. The schedulability analysis of the system based on this new task model should be, in particular for EDF, investigated. We develop, on the concept of the processor demand criterion, conditions for the feasibility of an E-TDL system running on a single CPU under EDF. A necessary and sufficient condition is obtained by considering the global schedules that are made up of execution traces occurring at the same time in distinct modules that are able to switch their modes at predefined instants. We estimate a maximal length of the interval on which the schedulability condition must be checked. A tool suite performing the schedulability analysis of the E-TDL systems is developed
APA, Harvard, Vancouver, ISO, and other styles
5

Belfkih, Abderrahmen. "Contraintes temporelles dans les bases de données de capteurs sans fil." Thesis, Le Havre, 2016. http://www.theses.fr/2016LEHA0014/document.

Full text
Abstract:
Dans ce travail, nous nous focalisons sur l’ajout de contraintes temporelles dans les Bases de Données de Capteurs Sans Fil (BDCSF). La cohérence temporelle d’une BDCSF doit être assurée en respectant les contraintes temporelles des transactions et la validité temporelle des données, pour que les données prélevées par les capteurs reflètent fidèlement l’état réel de l’environnement. Cependant, les retards de transmission et/ou de réception pendant la collecte des données peuvent conduire au non-respect de la validité temporelle des données. Une solution de type bases de données s'avère la plus adéquate. Il faudrait pour cela faire coïncider les aspects BD traditionnelles avec les capteurs et leur environnement. À cette fin, les capteurs déployés au sein d'un réseau sans fils sont considérés comme une table d'une base de données distribuée, à laquelle sont appliquées des transactions (interrogations, mises à jour, etc.). Les transactions sur une BD de capteurs nécessitent des modifications pour prendre en compte l'aspect continu des données et l'aspect temps réel. Les travaux réalisés dans cette thèse portent principalement sur trois contributions : (i) une étude comparative des propriétés temporelles entre une collecte périodique des données avec une base de données classique et une approche de traitement des requêtes avec une BDCSF, (ii) la proposition d’un modèle de traitement des requêtes temps réel, (iii) la mise en œuvre d’une BDCSF temps réel, basée sur les techniques décrites dans la deuxième contribution
In this thesis, we are interested in adding real-time constraints in the Wireless Sensor Networks Database (WSNDB). Temporal consistency in WSNDB must be ensured by respecting the transaction deadlines and data temporal validity, so that sensor data reflect the current state of the environment. However, delays of transmission and/or reception in a data collection process can lead to not respect the data temporal validity. A database solution is most appropriate, which should coincide with the traditional database aspects with sensors and their environment. For this purpose, the sensor in WSN is considered as a table in a distributed database, which applied transactions (queries, updates, etc.). Transactions in a WSNDB require modifications to take into account of the continuous datastream and real-time aspects. Our contribution in this thesis focus on three parts: (i) a comparative study of temporal properties between a periodic data collection based on a remote database and query processing approach with WSNDB, (ii) the proposition of a real-time query processing model, (iii) the implementation of a real time WSNDB, based on the techniques described in the second contribution
APA, Harvard, Vancouver, ISO, and other styles
6

Darera, Vivek N. "Bounds For Scheduling In Non-Identical Uniform Multiprocessor Systems." Thesis, 2006. http://hdl.handle.net/2005/342.

Full text
Abstract:
With multiprocessors and multicore processors becoming ubiquitous, focus has shifted from research on uniprocessors to that on multiprocessors. Results derived for the uniprocessor case unfortunately do not always directly extend to the multiprocessor case in a straightforward manner. This necessitates a paradigm shift in the approach used to design and analyse the behaviour of such processors. In the case of Real-time systems, that is, systems characterised by explicit timing constraints, analysis and performance guarantees are more important, as failure is unacceptable. Scheduling algorithms used in Real-time systems have to be carefully designed as the performance of the system depends critically on them. Efficient tests for determining if a set of tasks can be feasibly scheduled on such a computing system using a particular scheduling algorithm thus assumes importance. Traditionally, the ‘task utilization’ parameter has been used for devising such tests. Utilization based tests for Earliest Deadline First(EDF) and Rate Monotonic(RM) scheduling algorithms are known and are well understood for uniprocessor systems. In our work, we derive limits on similar bounds for the multiprocessor case. Our work diners from previous literature in that we explore the case when the individual processors constituting the multiprocessor need not be identical. Each processor in such a system is characterised by a capacity, or speed, and the time taken by a task to execute on a processor is inversely proportional to its speed. Such instances may arise during system upgradation, when faster processors may be added to the system, making it a non-identical multiprocessor, or during processor design, when the different cores on the chip may have different processing power to handle dynamic workloads. We derive results for the partitioned paradigm of multiprocessor scheduling, that is, when tasks are partitioned among the processors, and interprocessor migration after a part of execution is completed is not allowed. Results are derived for both fixed priority algorithms(RM)and dynamic priority algorithms (EDF) used on individual processors. A maximum and minimum limit on the bounds for a ‘greedy’ class of algorithms are established, since the actual value of the bound depends on the algorithm that allocates the tasks. We also derive the utilization bound of an algorithm whose bound is close to the upper limit in both cases. We find that an expression for the utilization bound can be obtained when EDF is used as the uniprocessor scheduling algorithm, but when RM is the uniprocessor scheduling algorithm,an O(mn) algorithm is required to find the utilization bound, where m is the number of tasks in the system and n is the number of processors. Knowledge of such bounds allows us to carry out very fast schedulability tests, although we have the limitation that the tests are sufficient but not necessary to ensure schedulability. We also compare the value of the bounds with those achievable in ‘equivalent’ identical multiprocessor systems and find that the performance guarantees provided by the non-identical multiprocessor system are far higher than those offered by the equivalent identical system.
APA, Harvard, Vancouver, ISO, and other styles
7

Das, Sudipta. "Loss Ratios of Different Scheduling Policies for Firm Real-time System : Analysis and Comparisons." Thesis, 2013. http://etd.iisc.ernet.in/handle/2005/2808.

Full text
Abstract:
Firm real time system with Poisson arrival process, iid exponential service times and iid deadlines till the end of service of a job, operated under the First Come First Served (FCFS) scheduling policy is well studied. In this thesis, we present an exact theoretical analysis of a similar (M/M/1 + G queue) system with exact admission control (EAC). We provide an explicit expression for the steady state workload distribution. We use this solution to derive explicit expressions for the loss ratio and the sojourn time distribution. An exact theoretical analysis of the performance of an M/M/1 + G queue with preemptive deadlines till the end of service, operating under the Earliest Deadline First (EDF) scheduling policy, appears to be difficult, and only approximate formulas for the loss ratio are available in the literature. We present in this thesis similar approximate formulas for the loss ratio in the present of an exit control mechanism, which discards a job at the epoch of its getting the server if there is no chance of completing it. We refer to this exit control mechanism as the Early job Discarding Technique (EDT). Monte Carlo simulations of performance indicate that the maximum approximation error is reasonably small for a wide range of arrival rates and mean deadlines. Finally, we compare the loss ratios of the First Come First Served and the Earliest Deadline First scheduling policies with or without admission or exit control mechanism, as well as their counterparts with deterministic deadlines. The results include some formal equalities, inequalities and some counter-examples to establish non-existence of an order. A few relations involving loss ratios are posed as conjectures, and simulation results in support of these are reported. These results lead to a complete picture of dominance and non-dominance relations between pairs of scheduling policies, in terms of loss ratios.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Earliest Deadline First"

1

Ryu, Yeonseung. "Scheduling Mixed Traffic under Earliest-Deadline-First Algorithm." In Computer and Information Sciences - ISCIS 2003, 715–22. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/978-3-540-39737-3_89.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Wu, Chuansheng. "Feedback Earliest Deadline First Exploiting Hardware Assisted Voltage Scaling." In Lecture Notes in Electrical Engineering, 989–96. Cham: Springer International Publishing, 2013. http://dx.doi.org/10.1007/978-3-319-01766-2_113.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Han, Sangchul, Moonju Park, and Yookun Cho. "Fast Real-Time Job Selection with Resource Constraints Under Earliest Deadline First." In Lecture Notes in Computer Science, 242–50. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11512622_26.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Sohn, Jong Moon, and Gil Yong Kim. "Earliest-Deadline-First scheduling on nonpreemptive real-time threads for a continuous media server." In High-Performance Computing and Networking, 950–56. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/bfb0031666.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Hei, Xiaojun, and Danny H. K. Tsang. "The Earliest Deadline First Scheduling with Active Buffer Management for Real-Time Traffic in the Internet." In Networking — ICN 2001, 45–54. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-47728-4_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Lee, Junghoon, Mikyung Kang, Gyung-Leen Park, Ikchan Kim, Cheolmin Kim, Jong-Hyun Park, and Jiman Hong. "A Real-Time Message Scheduling Scheme Based on Optimal Earliest Deadline First Policy for Dual Channel Wireless Networks." In Embedded and Ubiquitous Computing, 264–73. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11802167_28.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

George, Laurent, and Pierre Courbin. "Reconfiguration of Uniprocessor Sporadic Real-Time Systems." In Reconfigurable Embedded Control Systems, 167–89. IGI Global, 2011. http://dx.doi.org/10.4018/978-1-60960-086-0.ch007.

Full text
Abstract:
In this chapter the authors focus on the problem of reconfiguring embedded real-time systems. Such reconfiguration can be decided either off-line to determine if a given application can be run on a different platform, while preserving the timeliness constraints imposed by the application, or on-line, where a reconfiguration should be done to adapt the system to the context of execution or to handle hardware or software faults. The task model considered in this chapter is the classical sporadic task model defined by a Worst Case Execution Time (WCET), a minimum inter-arrival time (also denoted the minimum Period) and a late termination deadline. The authors consider two preemptive scheduling strategies: Fixed Priority highest priority first (FP) and Earliest Deadline First (EDF). They propose a sensitivity analysis to handle reconfiguration issues. Sensitivity analysis aims at determining acceptable deviations from the specifications of a problem due to evolutions in system characteristics (reconfiguration or performance tuning). They present a state of the art for sensitivity analysis in the case of WCETs, Periods and Deadlines reconfigurations and study to what extent sensitivity analysis can be used to decide on the possibility of reconfiguring a system.
APA, Harvard, Vancouver, ISO, and other styles
8

Chéour, Rym, Sébastien Bilavarn, and Mohamed Abid. "Exploitation of the EDF Scheduling in the Wireless Sensors Networks." In Advanced Instrument Engineering, 87–100. IGI Global, 2013. http://dx.doi.org/10.4018/978-1-4666-4165-5.ch007.

Full text
Abstract:
Today, due to recent advances in wireless technology, new products using wireless sensor networks are being employed. However, despite the excitement surrounding wireless sensor networks, it is not immune to the problem of energy consumption. To overcome this deficiency and enhance the real time aspect, a growing interest lies in the implementation of an “Earliest Deadline First” (EDF) scheduler. Thus, in this paper, the authors establish a management policy of periodic tasks that is preemptive, multiprocessor, and dynamic. The authors implement a real-time scheduling policy as a part of a user-level threads package under the Linux operating system as Linux does not support EDF. Furthermore, this paper describes the technique of the EDF scheduler and how it can yield to significant power savings.
APA, Harvard, Vancouver, ISO, and other styles
9

Shah, Apurva. "Adaptive Scheduling for Real-Time Distributed Systems." In Advances in Data Mining and Database Management, 236–48. IGI Global, 2014. http://dx.doi.org/10.4018/978-1-4666-6078-6.ch011.

Full text
Abstract:
Biologically inspired data mining techniques have been intensively used in different data mining applications. Ant Colony Optimization (ACO) has been applied for scheduling real-time distributed systems in the recent time. Real-time processing requires both parallel activities and fast response. It is required to complete the work and deliver services on a timely basis. In the presence of timing, a real-time system's performance does not always improve as processor and speed increases. ACO performs quite well for scheduling real-time distributed systems during overloaded conditions. Earliest Deadline First (EDF) is the optimal scheduling algorithm for single processor real-time systems during under-loaded conditions. This chapter proposes an adaptive algorithm that takes advantage of EDF- and ACO-based algorithms and overcomes their limitations.
APA, Harvard, Vancouver, ISO, and other styles
10

Achour, Fehima, Wassim Jaziri, and Emna Bouazizi. "Semantics-Based Scheduling Approach of Ontology-Based Real-Time DBMS." In Frontiers in Artificial Intelligence and Applications. IOS Press, 2021. http://dx.doi.org/10.3233/faia210053.

Full text
Abstract:
Real-time DBMSs (DataBase Management Systems) are designed to manage transactions with time constraints and maintain the database consistency. The Quality of Service (QoS) in these systems is often evaluated based on the number of transactions satisfying their deadlines using a Feedback Control Scheduling Architecture (FCS). In this context, we are interested in the recently proposed FCS for Real-Time Ontology (FCSRTO) allowing to manage real-time ontological data, to which a specific execution of transactions is proposed. Being essential for the execution process of transactions, scheduling has been the subject of a recent work proposing the Advanced Earliest Deadline First based on Transactions Aggregation Links and Data Semantic Links (AEDF-TAL-DSL) as a scheduling protocol. It is mainly based on considering the aggregation links existing between transactions as well as the semantic links appearing between the users queries as scheduling parameters. Our work is to propose a new QoS approach called Semantics-Based FCSRTO. Our approach consists in combining the FCSRTO and the AEDF-TAL-DSL in a same architecture. Hence, we are improving the FCSRTO by using a sophisticated scheduling protocol on one hand, and on the other, it improves the AEDF-TAL-DSL scheduling protocol by managing transactions accessing to real-time ontological data. We also show the contributions provided by our QoS approach through a set of simulations.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Earliest Deadline First"

1

Socci, Dario, Peter Poplavko, Saddek Bensalem, and Marius Bozga. "Mixed Critical Earliest Deadline First." In 2013 25th Euromicro Conference on Real-Time Systems (ECRTS). IEEE, 2013. http://dx.doi.org/10.1109/ecrts.2013.20.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Lih-Yih Chiou, Hsin-Ei Lim, and Yi-Siou Chen. "Aggressive look-ahead earliest deadline first algorithm." In TENCON 2007 - 2007 IEEE Region 10 Conference. IEEE, 2007. http://dx.doi.org/10.1109/tencon.2007.4428980.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Beitollahi, Hakem, Seyed Ghassem Miremadi, and Geert Deconinck. "Fault-Tolerant Earliest-Deadline-First Scheduling Algorithm." In 2007 IEEE International Parallel and Distributed Processing Symposium. IEEE, 2007. http://dx.doi.org/10.1109/ipdps.2007.370608.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

"Enhancement of Generalized Earliest Deadline First Policy." In 15th International Conference on Enterprise Information Systems. SciTePress - Science and and Technology Publications, 2013. http://dx.doi.org/10.5220/0004448802310238.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Zhao, Xuejing, Yehua Wei, and Wenjia Li. "The Improved Earliest Deadline First with Virtual Deadlines Mixed-Criticality Scheduling Algorithm." In 2017 IEEE International Symposium on Parallel and Distributed Processing with Applications and 2017 IEEE International Conference on Ubiquitous Computing and Communications (ISPA/IUCC). IEEE, 2017. http://dx.doi.org/10.1109/ispa/iucc.2017.00072.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Bouakaz, Adnan, Thierry Gautier, and Jean-Pierre Talpin. "Earliest-deadline first scheduling of multiple independent dataflow graphs." In 2014 IEEE Workshop on Signal Processing Systems (SiPS). IEEE, 2014. http://dx.doi.org/10.1109/sips.2014.6986102.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Wang, Hongya, Jie Jin, Zhijun Wang, and LihChyun Shu. "On a novel property of the earliest deadline first algorithm." In 2011 Eighth International Conference on Fuzzy Systems and Knowledge Discovery (FSKD 2011). IEEE, 2011. http://dx.doi.org/10.1109/fskd.2011.6019496.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Bouakaz, Adnan, and Jean-Pierre Talpin. "Buffer minimization in earliest-deadline first scheduling of dataflow graphs." In the 14th ACM SIGPLAN/SIGBED conference. New York, New York, USA: ACM Press, 2013. http://dx.doi.org/10.1145/2491899.2465558.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Faggioli, Dario, Michael Trimarchi, and Fabio Checconi. "An implementation of the earliest deadline first algorithm in Linux." In the 2009 ACM symposium. New York, New York, USA: ACM Press, 2009. http://dx.doi.org/10.1145/1529282.1529723.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Korbi, In, and Leila Azouz Saidane. "Analytical Model of the Earliest Deadline First Policy over 802.11." In 2008 Fourth Advanced International Conference on Telecommunications (AICT). IEEE, 2008. http://dx.doi.org/10.1109/aict.2008.74.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Earliest Deadline First' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography