CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

An Efficient Non-Preemptive Algorithm for Soft Real-Time Systems using Domain Cluster–Group EDF

by R. Kalpana, S. Keerthika
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 93 - Number 20
Year of Publication: 2014
Authors: R. Kalpana, S. Keerthika
10.5120/16542-5368

R. Kalpana, S. Keerthika . An Efficient Non-Preemptive Algorithm for Soft Real-Time Systems using Domain Cluster–Group EDF. International Journal of Computer Applications. 93, 20 ( May 2014), 1-8. DOI=10.5120/16542-5368

@article{ 10.5120/16542-5368,
author = { R. Kalpana, S. Keerthika },
title = { An Efficient Non-Preemptive Algorithm for Soft Real-Time Systems using Domain Cluster–Group EDF },
journal = { International Journal of Computer Applications },
issue_date = { May 2014 },
volume = { 93 },
number = { 20 },
month = { May },
year = { 2014 },
issn = { 0975-8887 },
pages = { 1-8 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume93/number20/16542-5368/ },
doi = { 10.5120/16542-5368 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:16:13.647679+05:30
%A R. Kalpana
%A S. Keerthika
%T An Efficient Non-Preemptive Algorithm for Soft Real-Time Systems using Domain Cluster–Group EDF
%J International Journal of Computer Applications
%@ 0975-8887
%V 93
%N 20
%P 1-8
%D 2014
%I Foundation of Computer Science (FCS), NY, USA
Abstract

In this paper a new non-preemptive domain clustering scheduling algorithm for soft real time application is proposed. The main aim of this algorithm is to achieve high deadline meeting ratio of the group Earliest Deadline First (gEDF) algorithm by maintaining the excellent performance during normal load. An efficient non-preemptive algorithm called Domain Cluster – group EDF (DC-gEDF) is proposed for real time systems which makes clustering the task according to the domain specification with their deadlines and schedules the tasks within a group. The results are analysed and compared for the metric deadline meeting ratio of gEDF and DC-gEDF under different deadline acceptable values. It shows an improvement in the deadline meeting ratio for the proposed DC-g-EDF algorithm.

References
  1. Wenming Li, B. S. , M. S. , GROUP EDF – A NEW APPROACH AND AN EFFICIENT NON-PREEMPTIVE ALGORITHM FOR SOFT REAL-TIME SYSTEMS, UNIVERSITY OF NORTH TEXAS, August 2006.
  2. R. Jain, C. J. Hughes, and S. V. Adve, "Soft Real-Time Scheduling on Simultaneous Multithreaded Processors", In Proceedings of the 23rd IEEE International Real-Time Systems Symposium, December 2002.
  3. K. Jeffay and C. U. Martel, "On Non-Preemptive Scheduling of Periodic and Sporadic Tasks", Proceedings of the 12thIEEE Real-Time Systems Symposium, San Antonio, Texas, December 1991, IEEE Computer Society Press, pp. 129-139.
  4. C. D. Locke, "Best-Effort Decision Making for Real-Time Scheduling", CMU-CS-86-134 (PhD Thesis), Computer Science Department, Carnegie-Mellon University, 1986.
  5. S. Zilberstein, "Using Anytime Algorithms in Intelligent Systems", AI Magazine, fall 1996, pp. 71-83.
  6. R. Heckmann, M. Langenbach, S. Thesing, and R. Wilhelm, "The Influence of Processor Architecture on the Design and the Results of WCET Tools", Proceedings of IEEE July 2003, Special Issue on Real-time Systems.
  7. J. Nieh and M. S. Lam, "A SMART Scheduler for Multimedia Applications", ACM Transactions on Computer Systems, Vol. 21, No. 2, May 2003.
  8. S. K. Baruah and J. R. Haritsa, "Scheduling for Overload in Real-Time Systems", IEEE Transactions on Computers, Vol. 46, No. 9, September 1997.
  9. B. D. Doytchinov, J. P. Lehoczky, and S. E. Shreve, "Real-Time Queues in Heavy Traffic with Earliest-Deadline-First Queue Discipline", Annals of Applied Probability, No. 11, 2001.
  10. W. T. Chan, T. W Lam, K. S. Liu, P. W. H. Wong, "Resource augmentation analysis of SRPT and SJF for minimizing total stretch in multiprocessor scheduling", University of Liverpool, UK.
  11. L. Sha, R. Rajkumar, and S. S. Sathaye, "Generalized Rate-Monotonic Scheduling Theory: A Framework for Developing Real-Time Systems", Proceedings of the IEEE, Jan. 1994.
  12. G. Buttazzo, M. Spuri, F. Sensini, "Value vs. Deadline Scheduling in Overload Conditions", Proceedings of the 16thIEEE Real-Time Systems Symposium (RTSS 1995), Pisa, Italy, pp. 90-99, December 5-7, 1995.
  13. S. Baskiyar, N. Meghanathan, "A Survey of Contemporary Real-Time Operating Systems", Informatica 29 (2005) 233-240.
  14. IEEE Information Technology – Portable Operating System Interface (POSIX): IEEE/ANSI Std 1003. 1, 1996 Edition.
  15. S. Agrawal, P. Bhatt, K. K Shukla, "Modified MUF and EDF Algorithms for Overload Soft Real Time", WSEAS Conferences on Recent Advances in Systems, Communications and Computers, April 6-8 2008.
  16. J. H. Anderson, V. Bud, U. C. Devi, "An EDF-based Scheduling Algorithm for Multiprocessor Soft Real-Time Systems", 17thEuromicro Conference on Real-Time Systems, 2005. Trans. Roy. Soc. London, vol. A247, pp. 529–551, April 1955.
  17. G Buttazzo, Research Trends in Real Time Computing for Embedded Systems, 2006
  18. F. Balarin, L. Lavagno, P. Murthy, and A. S. Vincentelli, "Scheduling for Embedded Real-Time Systems", IEEE Design & Test of Computer, January-March, 1998.
  19. N. C. Audsley, A. Burns, M. F. Richardson, A. J. Wellings "Hard Real-Time Scheduling: The Deadline-Monotonic Approach (1991)", Proceedings 8th IEEE Workshop on Real-Time Operating Systems and Software
  20. P. Brucker, "Scheduling Algorithms", Third Edition, Springer, 2001.
Index Terms

Computer Science
Information Sciences

Keywords

Group scheduling EDF group EDF soft real time non-preemptive

Powered by PhDFocusTM