Comparative Analysis of Different CPU Scheduling Algorithms with Respect to Average Waiting Time and Average Turnaround Time | Chapter 11 | Mathematics and Computer Science: Research Updates Vol. 5

CPU scheduling is one of the fundamental concepts of an Operating System. Most CPU scheduling algorithms concentrate on maximising CPU utilisation and throughput and minimising turnaround time, waiting time, response time and number of context switches for a set of requests. Some of the popular CPU scheduling algorithms are First-Come-First-Served (FCFS), Shortest Job First (SJF), Priority Based (PB) and Round Robin (RR). It has been found that CPU scheduling algorithms serve as the basis of multiprogramming. This paper presents the relationship between existing CPU scheduling algorithms with respect to their average waiting time and average turnaround time through different cases. There are five cases where each of which has four parts, and each part represents different existing CPU scheduling algorithms, i.e. FCFS, SJF, RR, and PB. Each part assumes that there are four different processes with different or the same priority and arrival time depending upon the particular case, as designed in the Section 4 of this paper. The goal of this paper is to find out the relationship with respect to average waiting time and average turnaround time, when different cases are implemented on the existing CPU scheduling algorithms and find the fastest algorithm amongst the existing CPU scheduling algorithms taken in this article.

Case Formulation-

·         In case 1, the CPU bursts taken are 4, 3, 5 and 2 for all the respective 4 processes.

·         In case 2, the CPU burst taken is an addition of 1 from the CPU burst of case 1 of each process.

·         In case 3, the CPU burst taken is the subtraction of 2 from the CPU burst of case 2 of each process.

·         In case 4, the CPU burst taken is an addition of 3 from the CPU burst of case 3 of each process.

·         In case 5, the CPU burst taken is the addition of 1 from the CPU burst of case 4 of each process.

 

Author (s) Details

 

Biswarup Samanta
Sarala Birla University, Ranchi, Jharkhand, India.

 

Arinjay Biswas
Adobe Systems, Noida, India.

 

Please see the book here:- https://doi.org/10.9734/bpi/mcsru/v5/4919

Evaluating Equity Crowd Funding Platforms in Europe - A New Financial Phenomenon for Gen-Z Entrepreneurs | Chapter 1 | Current Strategies in Economics and Management Vol.6

 

Today’s α is Tomorrow’s β and Future’s γ. The fresh winds and waves in the Science of Analytics,
Digitalisation, Artificial Intelligence (AI), Virtual and Viral Technologies forcing the ‘Alternative
Investing’ into the 3-Phase. Equity Crowd Funding evolved as an ‘Alternative Investment-3.0’ (KPMG)
and emerged as a new financial phenomenon for raising capital from the crowd online (Forbes). GenZ Entrepreneurs are plugged in like no other Generations and targeting Start-Ups and Small
Businesses to focus on next wave of growth. The Equity CrowdFunding is set to be valued more than
$93 billion by 2025, is an indicative of its progress in recent years(World Bank).
In European Context, the positive and progressive tax regime and regulations, high volumes and
valorem, independency and transparency of European Taxonomy, the crystal and clear regulatory
and legislative system in Europe, indeed, a mooting point for the study. The EU capital seekers
(participants) and capital providers (crowd funders) differ according to the needs and preferences.
Hence, the ECF is on the high rise and rapidly evolving financial landscape that connects Start-Ups,
Stand-Ups and Small Business to flourish in EU. The present study is diagnostic, innovative, and exploratory and considers Top-12 Operative ECF Platforms in Europe. The prime objective of the study is to evaluate the financial as well as operational performance of ECF. The ‘Inductive Content Analysis, Cross Sectional Study, and One-Way ANOVA’ form the basis, in order to get insights and draw inferences. The analytics and dynamics of ECF are presented and recommended ‘Regulatory Sand-Box, Algorithm-Driven Mechanism and Market Orientation and Digital Compliance’ to attract and retain investors. In dictum, the future, progress and prosperity of ECF rely on the ignited interests, innovative ideas, and inspiring involvement of Gen-Z Entrepreneurs, Intrapreneurs, Investors, and Policy Makers in tot .

Author (s) Details

Dr. K. Bhanu Prakash
Professor &CFO, MN INFRA PVT., LTD., Tadepalligudem, Andhra Pradesh, India.

Mr. P. Siva Reddy
Assistant Professor, School of Management Studies, Lakireddy Bali Reddy College of Engineering (Autonomous), Mylavaram, Krishna District, Andhra Pradesh, India.

View Book :- http://bp.bookpi.org/index.php/bpi/catalog/book/254

An Experimental Approach to Improve the Performance of FCFS Disk Scheduling Algorithm | Chapter 5 | Theory and Practice of Mathematics and Computer Science Vol. 1

 

One of the functions of the Operating System is serve the pending I/O requests from disk queue to the

requesting processes. Once a request is served, the operating system has to determine which request will be

served next. This process involves a careful examination of pending requests to determine the most efficient

way to service the requests. The aim of most of the disk scheduling algorithms is to reduce seek times for a set

of pending I/O requests. Some of the important disk scheduling algorithms are First-Come-First-Served (FCFS),

Shortest Seek Time First (SSTF), SCAN, Circular Scan (C-SCAN) and LOOK. Out of these disk scheduling

algorithms, the simplest and fair is the FCFS which serves the I/O requests based on their arrival. FCFS is

simple and easy to implement but usually it does not provide the efficient service. Here, I am proposing an

approach which can improve the performance of FCFS and reduce the seek time. This approach can be called

Improved First-Come-First-Served (IFCFS). After applying the suggested improvement, it has been found that

the service is fast and seek time has been reduced drastically. This has been proved with the experimental results with some sets of pending I/O requests.

 

Author (s) Details

Manish Kumar Mishra
Department of Computer Science, University of Gondar, Ethiopia.

View Book :-https://bp.bookpi.org/index.php/bpi/catalog/book/237