Advertisement

Event Monitoring for Adaptive Multi-priority Streaming Time Sensitive-Based EDF Scheduling

Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 325)

Abstract

Real-time systems are bounded with strict time constraints. To accomplish this, task scheduling is needed. Earlier approaches are restricted to fixed priority scheduling policies, which follows static priority algorithm. It assigns a priority statically and schedules dynamically. It does not support dynamic priority requests. To overcome this, preemptive earliest deadline first (EDF) scheduling is used, which is a dynamic priority scheduling algorithm. It ensures that higher priority requests are executed first and they experience lower mean waiting time, without leading lower priority requests to overstarvation. But preemptive EDF leads to increase in runtime overhead. Hence, proposed method uses limited preemption EDF scheduling, which assigns an approximate deadline for each request, and the requests are serviced with limited preemption. It splits the request into multiple jobs and assigns fixed preemption points (FPP) to each sub job. Only at FPP position, preemption is allowed. Hence, it is proved experimentally that the mean waiting time for higher and lower priority tasks are the minimum with less runtime overhead.

Keywords

Earliest deadline first Fixed preemption points Fixed priority scheduling Limited preemption 

Notes

Acknowledgments

We like thank all those who gave us their support to complete this paper.

References

  1. 1.
    V. Gamini, T Zahir, P. Zeephongsekul, A.Y. Zomaya, Performance analysis of EDF scheduling in a multi priority preemptive M/G/1 Queue. IEEE Trans. (2013)Google Scholar
  2. 2.
    S. Das, L. Jenkins, D. Sengupta, Comparison of Loss Ratios of Different Scheduling Algorithms. Cornell University (2011)Google Scholar
  3. 3.
    G.C. Buttazzo, Rate Monotonic vs. EDF: Judgment Day. Springer Science, The Netherlands (2005)Google Scholar
  4. 4.
    G.C. Buttazzo, M. Bertogna, G. Yao, Limited preemptive scheduling for real time systems. IEEE Trans. Ind. Inf. 9(1) (2013)Google Scholar
  5. 5.
    A.F.M.S. Akhter, M.R. Khan, M.D.S. Islam, Overload avoidance algorithm for real-time distributed system. Int. J. Comput. Sci. Netw. Secur. 12(9) (2012)Google Scholar
  6. 6.
    M. Bertogna, M. Cirinei, G. Lipari, Improved schedulability analysis of EDF on multiprocessor platforms. ECRTS (2005)Google Scholar
  7. 7.
    G. Yao, G. Buttazzo, M. Bertogna, Feasibility analysis under fixed priority scheduling with fixed preemption points, in International Workshop on Real-Time Computing Systems and Applications (2010)Google Scholar
  8. 8.
    T.P. Baker, Stack-based scheduling for real-time processes. Real-Time Syst. 3(1), 67–99 (1991)CrossRefGoogle Scholar
  9. 9.
    V. Prajapati, A. Shah, P. Balani, Design of new scheduling algorithm LLF_DM and its comparison with existing EDF, LLF, and DM algorithms for periodic tasks, in ISSP Conference (2013)Google Scholar
  10. 10.
    M. Saleh, L. Dong, Comparing FCFS & EDF scheduling algorithms for real-time packet switching networks, in ICNSC Conference (2010)Google Scholar
  11. 11.
    Y. Wang, M. Saksena, Scheduling fixed-priority tasks with preemption threshold, in IEEE Conference (1999)Google Scholar
  12. 12.
    M. Kargahi, A. Movaghar, A method for performance analysis of earliest-deadline-first scheduling policy. J. Supercomputing 37(2), 197–222 (2006)CrossRefGoogle Scholar
  13. 13.
    J. Lehoczky, Real-time queueing theory, in Real-Time Systems Symposium. IEEE (1996)Google Scholar

Copyright information

© Springer India 2015

Authors and Affiliations

  1. 1.P.S.N.A College of Engineering and TechnologyAnna UniversityDindigulIndia
  2. 2.Department of Computer Science and EngineeringP.S.N.A College of Engineering and TechnologyDindigulIndia
  3. 3.Department of Information and TechnologyRMD College of Engineering and TechnologyChennaiIndia

Personalised recommendations