An Optimum Time Quantum Using Linguistic Synthesis for Round Robin Cpu Scheduling Algorithm

In Round Robin CPU scheduling algorithm the main concern is with the size of time quantum and the increased waiting and turnaround time. Decision for these is usually based on parameters, which are assumed to be precise. However, in many cases the values of these parameters are vague and imprecise....

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International Journal on Soft Computing Jg. 3; H. 1; S. 57 - 66
1. Verfasser: Raheja, Supriya
Format: Journal Article
Sprache:Englisch
Veröffentlicht: 29.02.2012
Schlagworte:
Algorithms
Design of experiments
Fuzzy
Fuzzy logic
Linguistics
Mathematical analysis
Mathematical models
Scheduling
ISSN:2229-7103, 2229-6735
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In Round Robin CPU scheduling algorithm the main concern is with the size of time quantum and the increased waiting and turnaround time. Decision for these is usually based on parameters, which are assumed to be precise. However, in many cases the values of these parameters are vague and imprecise. The performance of fuzzy logic depends upon the ability to deal with Linguistic variables. With this intent, this paper attempts to generate an Optimal Time Quantum dynamically based on the parameters, which are treated as Linguistic variables. This paper also includes Mamdani Fuzzy Inference System using Trapezoidal membership function, results in LRRTQ Fuzzy Inference System. In this paper, the authors present an algorithm to improve the performance of round robin scheduling algorithm. Numerical analysis based on LRRTQ results on proposed algorithm shows the improvement in the performance of the system by reducing unnecessary context switches and also by providing reasonable turnaround time.
Bibliographie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:2229-7103
2229-6735
DOI:10.5121/ijsc.2012.3105