Revitalizing the single batch environment: a 'Quest' to achieve fairness and efficiency

In the realm of computer systems, efficient utilization of the CPU (Central Processing Unit) has always been a paramount concern. Researchers and engineers have long sought ways to optimize process execution on the CPU, leading to the emergence of CPU scheduling as a field of study. In this research...

Full description

Saved in:
Bibliographic Details
Published in:International journal of computers & applications Vol. 46; no. 8; pp. 651 - 665
Main Authors: Manna, Supriya, Mudigonda, Krishna Siva Prasad
Format: Journal Article
Language:English
Published: Calgary Taylor & Francis 02.08.2024
Taylor & Francis Ltd
Subjects:
Batch processing
Central processing units
CPU scheduling
CPUs
Efficiency
fairness
greedy algorithm
Optimization
Paradigms
Preempting
Priority scheduling
Sorting algorithms
ISSN:1206-212X, 1925-7074
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In the realm of computer systems, efficient utilization of the CPU (Central Processing Unit) has always been a paramount concern. Researchers and engineers have long sought ways to optimize process execution on the CPU, leading to the emergence of CPU scheduling as a field of study. In this research, we have analyzed the single offline batch processing and investigated other sophisticated paradigms such as time-sharing operating systems and wildly used algorithms, and their shortcomings. Our work is directed toward two fundamental aspects of scheduling: efficiency and fairness. We propose a novel algorithm for batch processing that operates on a preemptive model, dynamically assigning priorities based on a robust ratio, employing a dynamic time slice, and utilizing periodic sorting to achieve fairness. By engineering this responsive and fair model, the proposed algorithm strikes a delicate balance between efficiency and fairness, providing an optimized solution for batch scheduling while ensuring system responsiveness.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1206-212X
1925-7074
DOI:10.1080/1206212X.2024.2380660