ODSA: A Novel Ordering Divisional Scheduling Algorithm for Modern Operating Systems
Journal Title: International Journal of Advanced Computer Science & Applications - Year 2017, Vol 8, Issue 7
Abstract
CPU scheduling is defined as scheduling multiple processes that are required to be executed in a specific time period. A large number of scheduling algorithms have been proposed to achieve maximum CPU utilization/throughput and minimizing turn around, waiting and response time. Existing studies claim that Round Robin (RR) is providing best results in terms of above-mentioned factors. In RR, a process is assigned to CPU for a fixed time quantum then the process starts its execution, in case that assigned time quantum greater than CPU’s capacity then remaining section of that process waits for its next turn. Although RR schedules processes in an efficient manner, however, it has certain limitations such as if time quantum is too small or large, it causes frequent context switching and response time can increase. To address these identified problems, various improved versions of RR also exist. The purpose of this paper is twofold: 1) a comparison between different improved versions of RR; and 2) a new algorithm named Ordering Divisional Scheduling Algorithm (ODSA) is also proposed that combines various features of different algorithms and is actually an improvement to RR. Our results show that ODSA can schedule processes with less turn around and average waiting time as compared to existing solutions.
Authors and Affiliations
Junaid Haseeb, Muhammad Tayyab, Khizar Hameed, Samia Rehman, Agha Muhammad Musa Khan
Keywords
Related Articles
- EP ID EP260337
- DOI 10.14569/IJACSA.2017.080739
- Views 109
- Downloads 0
User Interface Menu Design Performance and User Preferences: A Review and Ways Forward
This review paper is about menus on web pages and applications and their positioning on the user screen. The paper aims to provide the reader with a succinct summary of the major research in this area along with an easy...
Segmentation of Touching Arabic Characters in Handwritten Documents by Overlapping Set Theory and Contour Tracing
Segmentation of handwritten words into characters is one of the challenging problem in the field of OCR. In presence of touching characters, make this problem more difficult and challenging. There are many obstacles/chal...
Comparison of Inter-and Intra-Subject Variability of P300 Spelling Dictionary in EEG Compressed Sensing
In this paper, we propose a new compression method for electroencephalographic signals based on the concept of compressed sensing (CS) for the P300 detection spelling paradigm. The method uses a universal mega-dictionary...
Finite Elements Modeling of Linear Motor for Automatic Sliding Door Application
In this paper, a linear switched reluctance motor is designed and investigated to be used as a sliding door drive system. A non linear two dimensions finite model is built to predict the performance of the designed motor...
Feature based Algorithmic Analysis on American Sign Language Dataset
Physical disability is one of the factor in human beings, which cannot be ignored. A person who can’t listen by nature is called deaf person. For the representation of their knowledge, a special language is adopted calle...