CPU Scheduling Techniques: A Review on Novel Approaches Strategy and Performance Assessment

Abstract

<jats:p>The operating system (OS) is now being widely used in many of the various modern applications in recent years, ranging from diabetic monitoring to other strategic planning. The main function of any OS is to control and coordinate all hardware resources among the commands of the same/different user, which increases the efficiency of advanced comprehensive applications. In an autonomous computer system, the CPU is one of the important resources to manage and process all activities which require scheduling techniques on a processor. Since the early days of computing and other multi-programming OS, various studies have been assigned to CPU scheduling techniques based on processes management and performance evaluation. Thus, outlining the many issues related to scheduling methodologies and the weaknesses that need to be addressed. This review paper is organized based on two distinct perspectives: the implement strategies of CPU scheduling technique and criteria-based measures used, which assess how the strategies are analyzed and used under performance evaluation.</jats:p>

A Comprehensive Study of Kernel (Issues and Concepts) in Different Operating Systems

“…At the heart of an OS is the kernel. It is the first process loaded at boot time, and it remains in continuous use for the duration of the session [55]. In its simplest form, a kernel provides the following services:…”

A Survey of Data Mining Activities in Distributed Systems

“…Distributed computing is a field of computer science that studies distributed systems [54]. A distributed system is a system whose components are located on different networked computers, which communicate and coordinate their actions by passing messages to one another from any system [57].…”

“…It may be necessary to handle heterogeneous systems, several databases and perhaps various schemes [53]. The communications protocol between nodes should be scalable and effective, as well as how information collected from various nodes may be used selectively [54].…”

Parallel Makespan Calculation for Flow Shop Scheduling Problem with Minimal and Maximal Idle Time

“…For several decades, scheduling and job scheduling have received constant attention from both researchers and practitioners from across the world. Such a level of interest is justified by the broad applications of scheduling which go from production planning and manufacturing [1,2], construction [3], cloud computing [4,5], transportation [6], education [7], healthcare [8] to CPUs [9], Internet of Things [10] and sensor networks [11]. Moreover, many scheduling problems are NP-hard, increasing the importance of developing faster and more efficient solving methods for scheduling problems with real-life instance sizes.…”