Design of Stochastic Simulator for Analyzing the Impact of Scalability on CPU Scheduling Algorithms

This paper investigates the performance interference of blockchain services that run on cloud data centers. As the data centers offer shared computing resources to multiple services, the blockchain services can experience performance interference due to the co-located services. We explore the impact of the interference on Fabric performance and develop a new technique to offer performance isolation for Hyperledger Fabric, the most popular blockchain platform. First, we analyze the characteristics of the different components in Hyperledger Fabric and show that Fabric components have different impacts on the performance of Fabric. Then, we present QiOi, component-level performance isolation technique for Hyperledger Fabric. The key idea of QiOi is to dynamically control the CPU scheduling of Fabric components to cope with the performance interference. We implement QiOi as a user-level daemon and evaluate how QiOi mitigates the performance interference of Fabric. The evaluation results demonstrate that QiOi mitigates performance degradation of Fabric by 22% and improves Fabric latency by 2.5 times without sacrificing the performance of co-located services. In addition, we show that QiOi can support different ordering services and chaincodes with negligible overhead to Fabric performance.

Download Full-text

The first class of “think time oriented” CPU scheduling algorithms

Proceedings of the 28th annual Southeast regional conference on - ACM-SE 28 ◽

10.1145/98949.98966 ◽

1990 ◽

Author(s):

Robert A. Allen

Keyword(s):

Scheduling Algorithms ◽

Cpu Scheduling

Download Full-text

Efficient vaccine scheduler based on CPU scheduling algorithms

10.1109/aimv53313.2021.9670986 ◽

2021 ◽

Author(s):

Vasu Gondaliya ◽

Shreya Patel ◽

Jay Hemnani ◽

Samir Patel

Keyword(s):

Scheduling Algorithms ◽

Cpu Scheduling

Download Full-text

A new visual tool to improve the effectiveness of teaching and learning CPU scheduling algorithms

2017 IEEE Jordan Conference on Applied Electrical Engineering and Computing Technologies (AEECT) ◽

10.1109/aeect.2017.8257759 ◽

2017 ◽

Cited By ~ 2

Author(s):

Yosef Hasan Jbara

Keyword(s):

Teaching And Learning ◽

Scheduling Algorithms ◽

Cpu Scheduling ◽

Visual Tool

Download Full-text

Scheduling and Synchronization Algorithms in Operating System: A Survey

Journal of Studies in Science and Engineering ◽

10.53898/josse2021121 ◽

2021 ◽

Vol 1 (2) ◽

pp. 1-16

Author(s):

Mohammed Y. Shakor ◽

Keyword(s):

Operating System ◽

Real Time ◽

Current Trend ◽

Scheduling Algorithms ◽

Computer Hardware ◽

Real Time Operating System ◽

Cpu Scheduling ◽

System A ◽

First Come First Serve ◽

Remaining Time

An operating system is software that is designed to manage computer hardware and software resources. However, this management requires applying an ample number of techniques and algorithms which are called synchronization and scheduling. The scheduling algorithms are used to arrange the way that the CPU is assigned to the processes, while synchronization is utilized to indicate how to work with multi-processes at the same time. Therefore, they are related to each other. CPU scheduling is a vital phenomenon of an operating system. At present, numerous CPU scheduling algorithms exist as First Come First Serve) FCFS(, Shortest Job First (SJF), Shortest Remaining Time First (SRTF), Priority Scheduling, and Round Robin (RR). In this paper, a survey of the current synchronization and scheduling algorithms have been presented. An overview of each technique with the main algorithms have been described in detail with the advantages and the issues of each algorithm. Furthermore, this paper has dug deep into the real-time operating system scheduling issues, which is the current trend in operating system researches.

Download Full-text

Priority based round robin (PBRR) CPU scheduling algorithm

International Journal of Electrical and Computer Engineering (IJECE) ◽

10.11591/ijece.v9i1.pp190-202 ◽

2019 ◽

Vol 9 (1) ◽

pp. 190

Author(s):

Sonia Zouaoui ◽

Lotfi Boussaid ◽

Abdellatif Mtibaa

Keyword(s):

Operating System ◽

Real Time ◽

Waiting Time ◽

Scheduling Algorithm ◽

Scheduling Algorithms ◽

Turnaround Time ◽

Round Robin ◽

New Approach ◽

Real Time Operating System ◽

Cpu Scheduling

<p>This paper introduce a new approach for scheduling algorithms which aim to improve real time operating system CPU performance. This new approach of CPU Scheduling algorithm is based on the combination of round-robin (RR) and Priority based (PB) scheduling algorithms. This solution maintains the advantage of simple round robin scheduling algorithm, which is reducing starvation and integrates the advantage of priority scheduling. The proposed algorithm implements the concept of time quantum and assigning as well priority index to the processes. Existing round robin CPU scheduling algorithm cannot be dedicated to real time operating system due to their large waiting time, large response time, large turnaround time and less throughput. This new algorithm improves all the drawbacks of round robin CPU scheduling algorithm. In addition, this paper presents analysis comparing proposed algorithm with existing round robin scheduling algorithm focusing on average waiting time and average turnaround time.</p>

Download Full-text

Comparative analysis of the essential CPU scheduling algorithms

Bulletin of Electrical Engineering and Informatics ◽

10.11591/eei.v10i5.2812 ◽

2021 ◽

Vol 10 (5) ◽

pp. 2742-2750

Author(s):

Hoger K. Omar ◽

Kamal H. Jihad ◽

Shalau F. Hussein

Keyword(s):

Comparative Analysis ◽

Operating Systems ◽

Waiting Times ◽

Stable State ◽

Scheduling Algorithms ◽

High Rate ◽

Cpu Scheduling ◽

Significant Function ◽

Cpu Utilization ◽

Maximum Utilization

CPU scheduling algorithms have a significant function in multiprogramming operating systems. When the CPU scheduling is effective a high rate of computation could be done correctly and also the system will maintain in a stable state. As well as, CPU scheduling algorithms are the main service in the operating systems that fulfill the maximum utilization of the CPU. This paper aims to compare the characteristics of the CPU scheduling algorithms towards which one is the best algorithm for gaining a higher CPU utilization. The comparison has been done between ten scheduling algorithms with presenting different parameters, such as performance, algorithm’s complexity, algorithm’s problem, average waiting times, algorithm’s advantages-disadvantages, allocation way, etc. The main purpose of the article is to analyze the CPU scheduler in such a way that suits the scheduling goals. However, knowing the algorithm type which is most suitable for a particular situation by showing its full properties.

Download Full-text