Why Vedic Multiplication Algorithm Works? | Chapter 4 | Research Highlights in Mathematics and Computer Science Vol. 8

 The speed of spoken multiplication utilizing the Vedic formula is amazing. This paper gives a footing for it. Vedic formula adequately uses traditional multiplication only but it is effective to produce quick results. In common product verdict, the result is found only after calculate all multiplications. On the contrast, Vedic algorithm does the reverse construction. It finds what partial multiplications are filling at wholes, tens, hundreds, etc. The importance a column is filled, summary of all partial device is immediately finished and proceeds to the next column. This habit oral commodity finding becomes extremely well speedy. In spite of this, it begun losing significance due advent of computers, supercomputers, and further, very cheap calculators. But at any moment computer hardware designers were allured to cash the advantageous Vedic treasure to make the calculating speedy at less power use and less area.

Author(s) Details:

Manohar Mathur,
Bangalore Metro Rail Corporation, Bangalore, India.

Aarnav,
KIIT, Bhuvaneshwar, India.

Please see the link here: https://stm.bookpi.org/RHMCS-V8/article/view/10192

Traditional Round Robin CPU Scheduling Algorithm to Prioritize Processes with Residual Burst time Nearest to the Specified time Quantum: An Advanced Approach | Chapter 01 | Novel Perspectives of Engineering Research Vol. 5

 The goal of this study is to present an improved version of the round robin scheduling technique. The Round Robin scheduling technique is one of the most extensively used CPU scheduling algorithms, and it may be found in a wide range of software applications. Every algorithm works in its own unique way and has its own set of advantages and disadvantages. In terms of waiting time, turnaround time, throughput, and the frequency of context shifts, the suggested algorithm solves the shortcomings of existing scheduling algorithms. The algorithm is proactive and works in accordance with the priority of the procedures involved. The priority of a process is determined by the remaining burst time, with the smaller the burst time, the higher the priority, and the greater the burst time, the lower the priority. A time quantum is initially set to complete the execution. If a process's burst time is less than 2X of the required time quantum but greater than 1X of the specified time quantum, the process is given high priority and permitted to run until it completes and terminates completely. These processes don't have to wait for the next burst cycle to happen.

Author(S) Details

Mythili Boopathi
SITE School, VIT University, Vellore-632014, Tamil Nadu, India.

Pranav Korde
SITE School, VIT University, Vellore-632014, Tamil Nadu, India.

Pallav Dey
SITE School, VIT University, Vellore-632014, Tamil Nadu, India.

View Book:- https://stm.bookpi.org/NPER-V5/article/view/5316