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

Window Constrained Scheduling of Processes in Real Time CPU Using Multi Objective Genetic Algorithm

by M.Karthiga, S.Ramya
journal cover thumbnail
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 1 - Number 21
Year of Publication: 2010
Authors: M.Karthiga, S.Ramya
10.5120/41-642

M.Karthiga, S.Ramya . Window Constrained Scheduling of Processes in Real Time CPU Using Multi Objective Genetic Algorithm. International Journal of Computer Applications. 1, 21 ( February 2010), 86-90. DOI=10.5120/41-642

@article{ 10.5120/41-642,
author = { M.Karthiga, S.Ramya },
title = { Window Constrained Scheduling of Processes in Real Time CPU Using Multi Objective Genetic Algorithm },
journal = { International Journal of Computer Applications },
issue_date = { February 2010 },
volume = { 1 },
number = { 21 },
month = { February },
year = { 2010 },
issn = { 0975-8887 },
pages = { 86-90 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume1/number21/41-642/ },
doi = { 10.5120/41-642 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T19:47:38.108434+05:30
%A M.Karthiga
%A S.Ramya
%T Window Constrained Scheduling of Processes in Real Time CPU Using Multi Objective Genetic Algorithm
%J International Journal of Computer Applications
%@ 0975-8887
%V 1
%N 21
%P 86-90
%D 2010
%I Foundation of Computer Science (FCS), NY, USA
Abstract

This paper presents a new approach to window constrained scheduling, suitable for weakly-hard real-time systems. The originally developed algorithm, called Virtual Deadline Scheduling (VDS) that attempts to guarantee m out of k deadlines are serviced for real-time jobs such as periodic CPU tasks. VDS is capable of generating a feasible window constrained schedule that utilizes 100% of resources. However, when VDS either services a job or switches to a new request period, it must update the corresponding virtual deadline. This updation is a bottleneck for the algorithm which increases the time complexity. Further, when VDS tries to solve the problem of delay the number of context switches increases. Context switching and delay are two conflicting criteria. By using Multi Objective Genetic Algorithm a trade off can be achieved between the context switching and the delay. We design our algorithm in such a way that it also overcomes the problem of updation which is an additional overhead in the original VDS algorithm.

References
  1. Virtual Deadline Scheduler for Window Constrained Service Guarantees by Richard West,Yutang Zang,Xin Qi .
  2. S.K.BaruahandS.-.Lin.Pfairschedulingofgeneralized pinwheeltasksystems. IEEETransactionsonComputers, 47(7),July1998.
  3. G.BernatandA.Burns.Combining(n/m)-harddeadlinesanddualpriorityscheduling.In Proceedingsofthe18th IEEEReal-TimeSystemsSymposium,pages46ñ57,San Francisco,December1997.IEEE.
  4. G.Bernat,A.Burns,andA.Llamosi.Weakly-hardreal-time systems. IEEETransactionsonComputers,50(4):308ñ321, April2001.
  5. G.BernatandR.Cayssials.Guaranteedon-lineweakly-hard real-timesystems.In Proceedingsofthe22ndIEEEReal- TimeSystemsSymposium,December2001.
  6. M.ChanandF.Chin.Schedulersforthepinwheel Problem basedondouble-integerreduction. IEEETransactionson Computers,41(6):755ñ768,June1992.
Index Terms

Computer Science
Information Sciences

Keywords

Virtual Deadline Scheduling Multi Objective Genetic Algorithm window constrained scheduling

Powered by PhDFocusTM