Log in

Relevant bibliographies by topics / Earliest Deadline First / Journal articles

To see the other types of publications on this topic, follow the link: Earliest Deadline First.

Journal articles 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 top 50 journal articles for your research 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.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

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

11

P., Chandra Sekhar, Avadhani PS, Suresh Varma P., and Bhargava NRMR. "Two Stages Scheduling of Steel Making using Earliest Deadline First Algorithm." International Journal of Engineering and Technology 8, no. 4 (August 31, 2016): 1758–70. http://dx.doi.org/10.21817/ijet/2016/v8i4/160804416.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Kargahi, Mehdi, and Ali Movaghar. "A Method for Performance Analysis of Earliest-Deadline-First Scheduling Policy." Journal of Supercomputing 37, no. 2 (August 2006): 197–222. http://dx.doi.org/10.1007/s11227-006-5944-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

T, Eswari, and S. Ewins Pon Puspha. "Fault Tolerance and Energy Minimization in Improved Earliest Deadline First Algorithm." Journal of Computer Science Engineering and Software Testing 7, no. 1 (April 28, 2021): 28–44. http://dx.doi.org/10.46610/jocses.2021.v07i01.006.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Chapalkar*, Sandeep S., and Karibasappa K. "Relative Deadline Analysis in Multitasking RTS using RM & EDF Scheduling." International Journal of Recent Technology and Engineering 10, no. 1 (May 30, 2021): 246–51. http://dx.doi.org/10.35940/ijrte.a5900.0510121.

Full text

Abstract:

In embedded systems the time required for any process to complete its execution in multitasking environment is an important factor to understand the performance of Real Time System (RTS) and its ability fulfill the deadline requirement of each process under different process load conditions. Even though some non-critical systems provide flexibility over deadlines, the hard real time systems are to be designed to meet the deadline requirement of all processes under peak process load condition. The number of processes available in scheduling queue may vary with time, the dynamic load on processing unit also changes proportionately which in turn affects the relative deadlines of each process. The scheduling policies considered are widely used scheduling policies like Rate Monotonic (RM) and Earliest Deadline First (EDF) to analyze and understand the impact on relative deadline with respect to number of scheduled processes. The real time execution timings of each process is observed on Raspberry Pi 3b+ processing unit operating at standard frequency of 700 MHz in multitasking mode of operation. The results obtained will decisively conclude the suitable scheduling policy for a set of processes under different process load conditions.

APA, Harvard, Vancouver, ISO, and other styles

15

Xu, Chengjie, Rei-Heng Cheng, and Tung-Kuang Wu. "Wireless rechargeable sensor networks with separable charger array." International Journal of Distributed Sensor Networks 14, no. 4 (April 2018): 155014771876899. http://dx.doi.org/10.1177/1550147718768990.

Full text

Abstract:

Wireless charging technology has been developing rapidly in recent years and has been used to deliver power and provide a new source of energy for wireless rechargeable sensor networks. With current solutions, charging is usually done by a mobile vehicle equipped with a charger, which needs to be waiting on site until the sensor is properly charged. It is possible that some sensors drain their power while the charging vehicle is serving the other. Accordingly, we proposed a solution that uses a single charging vehicle equipped with multiple battery cells, which we call the separable charging array. The battery cell can be unloaded on site with sensor, while the vehicle carries on its mission. A scheduling algorithm, a revised earliest deadline first algorithm, is proposed to work with this new model. In this study, we will demonstrate that the idea of equipping charging vehicle with separable charger array is feasible. In addition, our simulations indicate that the revised earliest deadline first scheduling algorithm does improve the earliest deadline first scheduling algorithm significantly with only minor overhead in scheduling computation time and very few extra chargers. Some modified variations of the proposed revised earliest deadline first algorithm will also be discussed and evaluated.

APA, Harvard, Vancouver, ISO, and other styles

16

Madhumita, G., G. Rajini, and B. Subisha. "Energy harvesting earliest deadline first scheduling algorithm for increasing lifetime of real time systems." Restaurant Business 118, no. 4 (November 21, 2019): 160. http://dx.doi.org/10.26643/rb.v118i4.9757.

Full text

Abstract:

In this paper, a new approach for energy minimization in energy harvesting real time systems has been investigated. Lifetime of a real time systems is depend upon its battery life. Energy is a parameter by which the lifetime of system can be enhanced. To work continuously and successively, energy harvesting is used as a regular source of energy. EDF (Earliest Deadline First) is a traditional real time tasks scheduling algorithm and DVS (Dynamic Voltage Scaling) is used for reducing energy consumption. In this paper, we propose an Energy Harvesting Earliest Deadline First (EH-EDF) scheduling algorithm for increasing lifetime of real time systems using DVS for reducing energy consumption and EDF for tasks scheduling with energy harvesting as regular energy supply. Our experimental results show that the proposed approach perform better to reduce energy consumption and increases the system lifetime as compared with existing approaches.

APA, Harvard, Vancouver, ISO, and other styles

17

Kumar, Arvind, and Bashir Alam. "Energy harvesting earliest deadline first scheduling algorithm for increasing lifetime of real time systems." International Journal of Electrical and Computer Engineering (IJECE) 9, no. 1 (February 1, 2019): 539. http://dx.doi.org/10.11591/ijece.v9i1.pp539-545.

Full text

Abstract:

<span lang="EN-US">In this paper, a new approach for energy minimization in energy harvesting real time systems has been investigated. Lifetime of a real time systems is depend upon its battery life. Energy is a parameter by which the lifetime of system can be enhanced. To work continuously and successively, energy harvesting is used as a regular source of energy. EDF (Earliest Deadline First) is a traditional real time tasks scheduling algorithm and DVS (Dynamic Voltage Scaling) is used for reducing energy consumption. In this paper, we propose an Energy Harvesting Earliest Deadline First (EH-EDF) scheduling algorithm for increasing lifetime of real time systems using DVS for reducing energy consumption and EDF for tasks scheduling with energy harvesting as regular energy supply. Our experimental results show that the proposed approach perform better to reduce energy consumption and increases the system lifetime as compared with existing approaches. </span>

APA, Harvard, Vancouver, ISO, and other styles

18

Atar, Rami, Anup Biswas, and Haya Kaspi. "Law of large numbers for the many-server earliest-deadline-first queue." Stochastic Processes and their Applications 128, no. 7 (July 2018): 2270–96. http://dx.doi.org/10.1016/j.spa.2017.09.009.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Kim, C., H. Cho, and Y. Sung. "Optimising earliest deadline first scheduling for parallel real‐time tasks on multiprocessors." Electronics Letters 55, no. 25 (December 2019): 1343–45. http://dx.doi.org/10.1049/el.2019.3017.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Korbi, I. El, and L. Azouz Saidane. "Performance evaluation of the earliest deadline first policy over ad hoc networks." International Journal of Ad Hoc and Ubiquitous Computing 10, no. 3 (2012): 175. http://dx.doi.org/10.1504/ijahuc.2012.048627.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

George, Laurent, Pierre Courbin, and Yves Sorel. "Job vs. portioned partitioning for the earliest deadline first semi-partitioned scheduling." Journal of Systems Architecture 57, no. 5 (May 2011): 518–35. http://dx.doi.org/10.1016/j.sysarc.2011.02.008.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Doytchinov, Bogdan, John Lehoczky, and Steven Shreve. "Real-time queues in heavy traffic with earliest-deadline-first queue discipline." Annals of Applied Probability 11, no. 2 (May 2001): 332–78. http://dx.doi.org/10.1214/aoap/1015345295.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Kalaivani, C. T., and N. Kalaiarasi. "Earliest deadline first scheduling technique for different networks in network control system." Neural Computing and Applications 31, S1 (September 22, 2018): 223–32. http://dx.doi.org/10.1007/s00521-018-3729-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Moyal, Pascal. "On queues with impatience: stability, and the optimality of Earliest Deadline First." Queueing Systems 75, no. 2-4 (February 5, 2013): 211–42. http://dx.doi.org/10.1007/s11134-013-9342-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Quan, Zhi, and Jong-Moon Chung. "Statistical admission control for real-time services under earliest deadline first scheduling." Computer Networks 48, no. 2 (June 2005): 137–54. http://dx.doi.org/10.1016/j.comnet.2004.10.017.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Felix Arokya Jose, A., C. Anand Deva Durai, and S. John Livingston. "DBac: deadline based data collection using CSMA/CD and earliest deadline first (EDF) scheduling in wireless sensor network." International Journal of Engineering & Technology 7, no. 3 (August 27, 2018): 1956. http://dx.doi.org/10.14419/ijet.v7i3.14522.

Full text

Abstract:

Wireless Sensor Network (WSN) has an enormous scope of utilizations in detecting different parameters such as temperature, pressure, sound, pollution, etc. The sensed data in each sensor node are a valuable one. To communicate the information to the base station for further processing, a lot of strategies are available. Each sensor senses the data in different sampling rate depending upon the sudden raise in the sensing parameters. Data communication to the base station is very critical due to the dynamicity of the environment during the stipulated time.The sensed data should reach the base station before the data becomes invalid due to the violation of the deadline. In order to avoid deadline violation so that the sensed data becomes useless, this paper proposing a novel data collection algorithm based on the popular Earliest Deadline First (EDF) scheduling algorithm. The various simulation parameters are taken into account to verify the performance of the proposed method and the result shows that it achieves high throughput, low delay, high Packet Delivery Ratio (PDR) and low energy consumption.

APA, Harvard, Vancouver, ISO, and other styles

27

Lam, Kam-Yiu, Sheung-Lun Hung, and Ken Chee-Keung Law. "Performance Studies of Locking Protocols for Real-time Databases With Earliest Deadline First." Journal of Database Management 6, no. 2 (April 1995): 22–32. http://dx.doi.org/10.4018/jdm.1995040103.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Atar, Rami, Anup Biswas, and Haya Kaspi. "Fluid Limits ofG/G/1+GQueues Under the Nonpreemptive Earliest-Deadline-First Discipline." Mathematics of Operations Research 40, no. 3 (August 2015): 683–702. http://dx.doi.org/10.1287/moor.2014.0690.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Sivaraman, Vijay, and Fabio M. Chiussi. "Statistical analysis of delay bound violations at an earliest deadline first (EDF) scheduler." Performance Evaluation 36-37 (August 1999): 457–70. http://dx.doi.org/10.1016/s0166-5316(99)00025-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Hammadeh, Zain A. H., Sophie Quinton, and Rolf Ernst. "Weakly-hard Real-time Guarantees for Earliest Deadline First Scheduling of Independent Tasks." ACM Transactions on Embedded Computing Systems 18, no. 6 (January 22, 2020): 1–25. http://dx.doi.org/10.1145/3356865.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Han, Qiushi, Linwei Niu, Gang Quan, Shaolei Ren, and Shangping Ren. "Energy efficient fault-tolerant earliest deadline first scheduling for hard real-time systems." Real-Time Systems 50, no. 5-6 (September 28, 2014): 592–619. http://dx.doi.org/10.1007/s11241-014-9210-z.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Choi, Young-Jin, and Hyung-Myung Kim. "A new scheduling scheme for high-speed packet networks: Earliest-virtual-deadline-first." Computer Communications 30, no. 10 (July 2007): 2291–300. http://dx.doi.org/10.1016/j.comcom.2007.06.003.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Short, Michael. "Eligible earliest deadline first: Server-based scheduling for master-slave industrial wireless networks." Computers & Electrical Engineering 64 (November 2017): 305–21. http://dx.doi.org/10.1016/j.compeleceng.2017.08.007.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Huang, Shu Juan, and Yi An Zhu. "Evaluation of Two Mixed-Criticality Scheduling Algorithm for Periodic Tasks." Applied Mechanics and Materials 513-517 (February 2014): 1160–64. http://dx.doi.org/10.4028/www.scientific.net/amm.513-517.1160.

Full text

Abstract:

Nowadays, there are two approach in mixed-criticality scheduling. One is reservations-based approach such as EDF-VD(Earliest Deadline First-Virtual Deadline) and the Other is priority-based scheduling such as OCBP(Own Criticality Based Priority). This paper compared the two mixed-criticality scheduling algorithm from three aspects. The simulation results show that EDF-VD is better than OCBP in completed tasks and the system utilization, but in unmissed deadline ratio the later owns the better.

APA, Harvard, Vancouver, ISO, and other styles

35

Zhou, Quan, Guohui Li, Qi Chen, and Jianjun Li. "Guaranteeing Timely Response to Changes of Monitored Objects by Assigning Deadlines and Periods to Tasks." ACM Transactions on Embedded Computing Systems 20, no. 5s (October 31, 2021): 1–22. http://dx.doi.org/10.1145/3477027.

Full text

Abstract:

Timely response to changes of monitored objects is the key to ensuring the safety and reliability of cyber-physical systems (CPSs). There are two kinds of tasks in CPSs: update tasks and control tasks. Update tasks are responsible for updating the data in the system based on the state of the objects they monitor. Control tasks are responsible for making decisions based on the data in the system. The response time of the system to the change of a monitored object consists of two parts: the time taken by update tasks to reflect the change to the system, and the time taken by control tasks to make decisions according to the data in the system. Deadlines and periods of update tasks and control tasks directly affect the response time. Reasonable deadline and period assignment is the key to ensuring timely response to the changes of monitored objects. In this paper, we study the deadline and period assignment in CPSs. To the best of our knowledge, all existing work only focuses on the deadline and period assignment for update tasks with the goal of ensuring the freshness of the data in CPSs, and this is the first study focusing on the deadline and period assignment for both update tasks and control tasks with the goal of ensuring timely response to the changes of monitored objects. A new problem about response time control and system workload control is defined in this paper. Two deadline and period assignment methods are proposed to solve the defined problem. All the proposed methods can be used in the CPSs adopting the earliest deadline first (EDF) scheduling method. Experiments with randomly generated tasks are conducted to evaluate the performance of the proposed methods in terms of acceptance ratio and execution efficiency.

APA, Harvard, Vancouver, ISO, and other styles

36

Saed, Nima, Kuokkwee Wee, Siew-chin Chong, Liew Tze Hui, and Wee Yit Yin. "Low Complexity in Exaggerated Earliest Deadline First Approach for Channel and QoS-aware Scheduler." Journal of Communications 9, no. 11 (2014): 884–90. http://dx.doi.org/10.12720/jcm.9.11.884-890.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Liu, Deming, and Yann-Hang Lee. "An Efficient Scheduling Discipline for Packet Switching Networks Using Earliest Deadline First Round Robin." Telecommunication Systems 28, no. 3-4 (March 2005): 453–74. http://dx.doi.org/10.1007/s11235-004-5582-z.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

George, Laurent, and Jean-François Hermant. "Characterization of the Space of Feasible Worst-Case Execution Times for Earliest-Deadline-First Scheduling." Journal of Aerospace Computing, Information, and Communication 6, no. 11 (November 2009): 604–23. http://dx.doi.org/10.2514/1.44721.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Chen, Mu-Song, and Hao-Wei Yen. "A probabilistic approach to estimate the mean waiting times in the earliest deadline first polling." Computers & Industrial Engineering 64, no. 3 (March 2013): 817–26. http://dx.doi.org/10.1016/j.cie.2012.12.019.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Ma, Zhi Yan, Zong Mei Tang, Guang You Yang, and Xu Wu Su. "CANbus Hybrid Scheduling Algorithm Based on DMS and EDF." Advanced Materials Research 787 (September 2013): 982–86. http://dx.doi.org/10.4028/www.scientific.net/amr.787.982.

Full text

Abstract:

By studying static scheduling algorithm Deadline Monotonous Scheduling (DMS) which assigns the priority fixedly to each message based on its deadline before starting the system and dynamic scheduling algorithm Earliest Deadline First (EDF) which assigns the priority dynamically based on its remaining deadline in the running time of system, combining the cheap CPU cost of DMS and high network utilization of EDF and using the layered structure, we presented a hybrid scheduling algorithm with considering critical level of messages. Based on the work mentioned above, the simulation platform of CANbus is developed with MATLAB/SimEvents tool box. The platform was used to real-time analysis for the scheduling algorithms mentioned before, the simulation results showed that the hybrid scheduling algorithm could not only improve the real-time performance of system, but also reduce the cost of processor.

APA, Harvard, Vancouver, ISO, and other styles

41

Vasiliu, Laura, Florin Pop, Catalin Negru, Mariana Mocanu, Valentin Cristea, and Joanna Kolodziej. "A Hybrid Scheduler for Many Task Computing in Big Data Systems." International Journal of Applied Mathematics and Computer Science 27, no. 2 (June 27, 2017): 385–99. http://dx.doi.org/10.1515/amcs-2017-0027.

Full text

Abstract:

AbstractWith the rapid evolution of the distributed computing world in the last few years, the amount of data created and processed has fast increased to petabytes or even exabytes scale. Such huge data sets need data-intensive computing applications and impose performance requirements to the infrastructures that support them, such as high scalability, storage, fault tolerance but also efficient scheduling algorithms. This paper focuses on providing a hybrid scheduling algorithm for many task computing that addresses big data environments with few penalties, taking into consideration the deadlines and satisfying a data dependent task model. The hybrid solution consists of several heuristics and algorithms (min-min, min-max and earliest deadline first) combined in order to provide a scheduling algorithm that matches our problem. The experimental results are conducted by simulation and prove that the proposed hybrid algorithm behaves very well in terms of meeting deadlines.

APA, Harvard, Vancouver, ISO, and other styles

42

Sabri, et al. "Energy performance evaluation for dynamic frequency scaling on rate monotonic and earliest deadline first scheduling algorithm." International Journal of ADVANCED AND APPLIED SCIENCES 5, no. 1 (January 2018): 143–47. http://dx.doi.org/10.21833/ijaas.2018.01.019.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Short, Michael. "Bounds on Worst-Case Deadline Failure Probabilities in Controller Area Networks." Journal of Computer Networks and Communications 2016 (2016): 1–12. http://dx.doi.org/10.1155/2016/5196092.

Full text

Abstract:

Industrial communication networks like the Controller Area Network (CAN) are often required to operate reliably in harsh environments which expose the communication network to random errors. Probabilistic schedulability analysis can employ rich stochastic error models to capture random error behaviors, but this is most often at the expense of increased analysis complexity. In this paper, an efficient method (of time complexityO(n log n)) to bound the message deadline failure probabilities for an industrial CAN network consisting ofnperiodic/sporadic message transmissions is proposed. The paper develops bounds for Deadline Minus Jitter Monotonic (DMJM) and Earliest Deadline First (EDF) message scheduling techniques. Both random errors and random bursts of errors can be included in the model. Stochastic simulations and a case study considering DMJM and EDF scheduling of an automotive benchmark message set provide validation of the technique and highlight its application.

APA, Harvard, Vancouver, ISO, and other styles

44

Liu, Shuo, Gang Quan, and Shangping Ren. "On-Line Real-Time Service-Oriented Task Scheduling Using TUF." ISRN Software Engineering 2012 (July 1, 2012): 1–12. http://dx.doi.org/10.5402/2012/681985.

Full text

Abstract:

We present our approach to real-time service-oriented scheduling problems with the objective of maximizing the total system utility. Different from the traditional utility accrual scheduling problems that each task is associated with only a single time utility function (TUF), we associate two different TUFs—a profit TUF and a penalty TUF—with each task, to model the real-time services that not only need to reward the early completions but also need to penalize the abortions or deadline misses. The scheduling heuristics we proposed in this paper judiciously accept, schedule, and abort real-time services when necessary to maximize the accrued utility. Our extensive experimental results show that our proposed algorithms can significantly outperform the traditional scheduling algorithms such as the Earliest Deadline First (EDF), the traditional utility accrual (UA) scheduling algorithms, and an earlier scheduling approach based on a similar model.

APA, Harvard, Vancouver, ISO, and other styles

45

Zhang, Fengxiang, Yanfeng Zhai, and Jianwei Liao. "A new sufficient schedulability analysis for hybrid scheduling." International Journal of Applied Mathematics and Computer Science 26, no. 3 (September 1, 2016): 683–92. http://dx.doi.org/10.1515/amcs-2016-0047.

Full text

Abstract:

Abstract Earliest deadline first (EDF) and fixed priority (FP) are the most commonly used and studied scheduling algorithms for real-time systems. This paper focuses on combining the EDF and FP strategies in one system. We provide a new sufficient schedulability analysis for real-time hybrid task systems which are scheduled by EDF and FP. The proposed analysis has a polynomial time complexity and no restrictions on task parameters, where the relative deadline of each task could be less than, equal to, or greater than its period. By extensive experiments, we show that our proposed analysis significantly improves the acceptance ratio compared with the existing results of the sufficient schedulability test for hybrid scheduling systems.

APA, Harvard, Vancouver, ISO, and other styles

46

Elsayed, Khaled M. F., Amr Saad Ayad, and Mahmoud T. El-Hadidi. "Performance Evaluation of Resource Reservation Policies for Rate-Controlled Earliest-Deadline-First Scheduling in Multi-Service Packet Networks." Telecommunication Systems 26, no. 1 (May 2004): 69–91. http://dx.doi.org/10.1023/b:tels.0000029021.03407.c9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Abdul Khalib, Zahereel Ishwar, R. Badlishah Ahmad, and Ong Bi Lynn. "Energy Efficient Scheduling Algorithm for Soft Real Time System with High Deadline Meeting Rate on Overload." Applied Mechanics and Materials 699 (November 2014): 840–45. http://dx.doi.org/10.4028/www.scientific.net/amm.699.840.

Full text

Abstract:

The fact that earliest deadline first (EDF) scheduling algorithm behaves unpredictably during overload is an old and existing issue in the field of real time system. In this paper, a new software process scheduling algorithm for soft real time applications is presented. The algorithm is formulated by means of logical reasoning and excessive simulation method. This method is adopted due to the fact that the problem of scheduling a set of periodic task on single processor using non-preemptive scheme is NP-hard in the strong sense. The new algorithm, with inherently less computational complexity is found to improve in power consumption by almost 50 percent at the peak of practical overload which is at 150 percent of system load. At the same system load, the new algorithm also gives a minimum of 16 percent improvement in deadline meeting rate (DMTR) as compared to EDF. Design and formulation of the new algorithm along with graphical results of the power consumption level and the level of the deadline meeting rate of both algorithms will be presented and discuss in detail.

APA, Harvard, Vancouver, ISO, and other styles

48

Peres, Leticia Mara, Luis Allan Künzle, and Eduardo Todt. "Applying global time Petri net analysis on the embedded software context." Sba: Controle & Automação Sociedade Brasileira de Automatica 22, no. 6 (December 2011): 610–19. http://dx.doi.org/10.1590/s0103-17592011000600006.

Full text

Abstract:

This paper presents an application of Global Time technique (GTT) which is an approach to construct class graphs of Time Petri nets based on relative and global time. Besides the constructing of GTT class graph we propose a schedulability analysis of quantitative time type for fixed priority policies and Earliest Deadline First (EDF). We propose that analysis of scenarios, or behavior itineraries duration of a system, can be done using this approach.

APA, Harvard, Vancouver, ISO, and other styles

49

Wu, Jian Lang, Jing Kai Shi, and Yi Bin Wang. "Analysis on Scheduling Algorithms of Real-Time Hybrid Tasks." Applied Mechanics and Materials 644-650 (September 2014): 2253–57. http://dx.doi.org/10.4028/www.scientific.net/amm.644-650.2253.

Full text

Abstract:

In real-time systems, periodic tasks and aperiodic tasks exist simultaneously. In a uniprocessor system, mainly there are Deferrable Server algorithm (DS) [1], Slack Stealing algorithm (SSA) [2] and their extended version for software/hardware hybrid real-time task scheduling. DS algorithm sets a high priority periodic task server to provide services for aperiodic tasks, while SSA algorithm computes tasks unoccupied time offline, and then schedule aperiodic tasks during the unoccupied period. The two algorithms are both proposed for soft real-time tasks, reducing the response time of the real-time tasks, but cannot guarantee that these aperiodic real-time tasks received can meet deadlines. In this paper, through combination of DS algorithm and EDF (Earliest Deadline First) algorithm [6], a new algorithm called DS-EDF is introduced, which can scheduling hard real-time aperiodic tasks on the DS server. This algorithm is not only suitable for uniprocessor systems, but also has the ability to extend to multiprocessor systems.

APA, Harvard, Vancouver, ISO, and other styles

50

Sharma, Rashmi, and Nitin. "Performance Evaluation of New Joint EDF-RM Scheduling Algorithm for Real Time Distributed System." Journal of Engineering 2014 (2014): 1–13. http://dx.doi.org/10.1155/2014/485361.

Full text

Abstract:

In Real Time System, the achievement of deadline is the main target of every scheduling algorithm. Earliest Deadline First (EDF), Rate Monotonic (RM), and least Laxity First are some renowned algorithms that work well in their own context. As we know, there is a very common problem Domino's effect in EDF that is generated due to overloading condition (EDF is not working well in overloading situation). Similarly, performance of RM is degraded in underloading condition. We can say that both algorithms are complements of each other. Deadline missing in both events happens because of their utilization bounding strategy. Therefore, in this paper we are proposing a new scheduling algorithm that carries through the drawback of both existing algorithms. Joint EDF-RM scheduling algorithm is implemented in global scheduler that permits task migration mechanism in between processors in the system. In order to check the improved behavior of proposed algorithm we perform simulation. Results are achieved and evaluated in terms of Success Ratio (SR), Average CPU Utilization (ECU), Failure Ratio (FR), and Maximum Tardiness parameters. In the end, the results are compared with the existing (EDF, RM, and D_R_EDF) algorithms. It has been shown that the proposed algorithm performs better during overloading condition as well in underloading condition.

APA, Harvard, Vancouver, ISO, and other styles

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!