Modification of Linux Kernel with Jumping Virtual Clock Round Robin Scheduling | Abstract

ISSN ONLINE(2320-9801) PRINT (2320-9798)

Research Article Open Access

Modification of Linux Kernel with Jumping Virtual Clock Round Robin Scheduling

Abstract

The open-source software and free operating system has attracted the attention of many users. People have failed to notice that while installing regular distributions, user is often forced to install many programs which are probably never used. These programs waste resources. Additionally in Linux, the performed scheduling algorithms are with high complexity such as Weighted Fair Queuing. Unless one can change a Linux OS, one can’t avoid presence of components which will never be required. Linux From Scratch (LFS) system allows to create compact Linux systems. LFS guides for building Linux system, compiling and installing all packages one by one, setting up boot scripts and installing the kernel. Additionally process scheduling can be implemented to meet growing needs such as faster execution. Over LFS system, one can build a hybrid scheduling algorithm called Jumping Virtual Clock Round Robin algorithm which combines Dynamic JVC and Static RR to solve the problems present in existing Weighted Fair Queueing and Leaf Forward Virtual Clock algorithms.

Laxmi M. Gurnani, Anurag Sinha, Gurmeet Singh Gujral, Abhijeet Patil, Ashish T. Bhole

To read the full article Download Full Article