The document presents a new CPU scheduling algorithm that acts as both preemptive and non-preemptive based on arrival time. It compares the proposed algorithm to existing algorithms like FCFS, SJF, priority, and round robin. The proposed algorithm calculates a condition factor by adding arrival time and burst time. Processes are arranged based on this factor to improve waiting time, turnaround time, and CPU utilization compared to other algorithms. Simulation results show the proposed algorithm performs equally to SJF and better than FCFS, priority, and round robin scheduling.
An Improved Round Robin CPU Scheduling Algorithm with Varying Time QuantumIJCSEA Journal
Process management is one of the important tasks performed by the operating system. The performance of the system depends on the CPU scheduling algorithms. The main aim of the CPU scheduling algorithms is to minimize waiting time, turnaround time, response time and context switching and maximizing CPU utilization. First-Come-First-Served (FCFS) Round Robin (RR), Shortest Job First (SJF) and, Priority Scheduling are some popular CPU scheduling algorithms. In time shared systems, Round Robin CPU scheduling is the preferred choice. In Round Robin CPU scheduling, performance of the system depends on the choice of the optimal time quantum. This paper presents an improved Round Robin CPU scheduling algorithm coined enhancing CPU performance using the features of Shortest Job First and Round Robin scheduling with varying time quantum. The proposed algorithm is experimentally proven better than conventional RR. The simulation results show that the waiting time and turnaround time have been reduced in the proposed algorithm compared to traditional RR.
It consists of CPU scheduling algorithms, examples, scheduling problems, realtime scheduling algorithms and issues. Multiprocessing and multicore scheduling.
Hello....
Dear views
Scheduling is most important Role in OS..... in this ppt i described very Creatively about Process Scheduling...... I hope you like it..... and easily understand it...... :-) :-)
An Improved Round Robin CPU Scheduling Algorithm with Varying Time QuantumIJCSEA Journal
Process management is one of the important tasks performed by the operating system. The performance of the system depends on the CPU scheduling algorithms. The main aim of the CPU scheduling algorithms is to minimize waiting time, turnaround time, response time and context switching and maximizing CPU utilization. First-Come-First-Served (FCFS) Round Robin (RR), Shortest Job First (SJF) and, Priority Scheduling are some popular CPU scheduling algorithms. In time shared systems, Round Robin CPU scheduling is the preferred choice. In Round Robin CPU scheduling, performance of the system depends on the choice of the optimal time quantum. This paper presents an improved Round Robin CPU scheduling algorithm coined enhancing CPU performance using the features of Shortest Job First and Round Robin scheduling with varying time quantum. The proposed algorithm is experimentally proven better than conventional RR. The simulation results show that the waiting time and turnaround time have been reduced in the proposed algorithm compared to traditional RR.
It consists of CPU scheduling algorithms, examples, scheduling problems, realtime scheduling algorithms and issues. Multiprocessing and multicore scheduling.
Hello....
Dear views
Scheduling is most important Role in OS..... in this ppt i described very Creatively about Process Scheduling...... I hope you like it..... and easily understand it...... :-) :-)
COMPARATIVE ANALYSIS OF FCFS, SJN & RR JOB SCHEDULING ALGORITHMSijcsit
One of the primary roles of the operating system is job scheduling. Oftentimes, what makes the differencebetween the performance of one operating system over the other could be the underlying implementation ofits job scheduling algorithm. This paper therefore examines, under identical conditions and parameters,the comparative performances of First Come First Serve (FCFS), Shortest Job Next (SJN) and RoundRobin (RR) scheduling algorithms. Simulation results presented in this paper serve to stimulate furtherresearch into the subject area.
An improved approach to minimize context switching in round robin scheduling ...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Learning scheduler parameters for adaptive preemptioncsandit
An operating system scheduler is expected to not al
low processor stay idle if there is any
process ready or waiting for its execution. This pr
oblem gains more importance as the numbers
of processes always outnumber the processors by lar
ge margins. It is in this regard that
schedulers are provided with the ability to preempt
a running process, by following any
scheduling algorithm, and give us an illusion of si
multaneous running of several processes. A
process which is allowed to utilize CPU resources f
or a fixed quantum of time (termed as
timeslice for preemption) and is then preempted for
another waiting process. Each of these
'process preemption' leads to considerable overhead
of CPU cycles which are valuable resource
for runtime execution. In this work we try to utili
ze the historical performances of a scheduler
and predict the nature of current running process,
thereby trying to reduce the number of
preemptions. We propose a machine-learning module t
o predict a better performing timeslice
which is calculated based on static knowledge base
and adaptive reinforcement learning based
suggestive module. Results for an "adaptive timesli
ce parameter" for preemption show good
saving on CPU cycles and efficient throughput time.
What is a Process?
A process is a program in execution. Process is not as same as program code but a lot more than it. A process is an 'active' entity as opposed to program which is considered to be a 'passive' entity. Attributes held by process include hardware state, memory, CPU etc .
( Program & Process )
Program
A computer program is a collection of instruction that performs a specific task when executed by a computer .
Passive entity
( Process )
- Active entity
- Program code + pc + associated resources + Status of the
process’s execution .
Processes
Process Concept
Process Scheduling
Operations on Processes
Cooperating Processes
Interprocess Communication
Communication in Client-Server Systems
( Process Concept )
An operating system executes a variety of programs: -
- Batch system – jobs
- Time-shared systems – user programs or tasks
Process – a program in execution; process execution must progress in sequential fashion.
A process includes:
Text section
Data section
Stack section
program counter
( Process Concept )
Program is passive entity stored on disk (executable file), process is active
Program becomes process when executable file loaded into memory
Execution of program started via GUI mouse clicks, command line entry of its name, etc
One program can be several processes
Consider multiple users executing the same program
What the OS is going to do for the Process?
Creating and removing( destroying )process .
Controlling the progress of processes .
Acting on interrupts and arithmetic errors .
Resource allocation among processes .
Inter process communication .
( Process Memory )
Process memory is divided into four sections for efficient working : -
The Text section is made up of the compiled program code, read in from non-volatile storage when the program is launched.
The Data section is made up the global and static variables, allocated and initialized prior to executing the main.
The Heap is used for the dynamic memory allocation, and is managed via calls to new, delete, malloc, free, etc.
The Stack is used for local variables. Space on the stack is reserved for local variables when they are declared.
( Process Memory )
#include<iostream>
using namespace std;
int total;
int Square(int x)
{
return x*x;
}
int SquareOfSum(int x,int y)
{
int z=Square(x+y);
return z;
}
int main()
{
int a=4,b=8;
total=SquareOfSum(a,b);
cout<<"Total ="<<total<<endl;
system("pause");
}
( Stack & Heap )
#include<iostream>
using namespace std;
void main()
{
int x;
x=10;
int *ptr;
ptr=&x;
cout<<*ptr<<" "<<x<<" "<<ptr <<" "<<&x<<endl;
*ptr=30;
cout<<endl<<endl;
cout<<*ptr<<" "<<x<<" "<< ptr <<" "<<&x<<endl;
cout<<endl<<endl;
system("pause");
}
Gives an overview about Process, PCB, Process States, Process Operations, Scheduling, Schedulers, Interprocess communication, shared memory and message passing systems
Operating system 28 fundamental of schedulingVaibhav Khanna
The objective of multiprogramming is to have some process running at all times to maximize CPU utilization.
The objective of time-sharing system is to switch the CPU among processes so frequently that users can interact with each program while it is running.
For a uniprocessor system, there will never be more than one running process.
If there are more processes, the rest will have to wait until the CPU is free and can be rescheduled
PI-Tool To Improve Performance of Application In Multi-core ArchitectureCSCJournals
Multi-core CPUs become increasingly popular on server-grade hardware as well as end-user desktop PCs or laptops. Necessary efforts are taken in the community towards developing applications optimized for multi-core architecture [1], still every user is expecting to run applications or programs with more speed than normal execution. In order to achieve maximum possible performance, there is a need for fine tuning in the areas of Operating System scheduling, Process Priority and CPU Affinity. So this paper presents PI-tool, to aid user by changing priority and CPU Affinity to his application or program at runtime to achieve better performance .The PI-tool is compared with Red Hat TUNA tool with NQueens program the results are presented for evaluation.
SCHEDULING DIFFERENT CUSTOMER ACTIVITIES WITH SENSING DEVICEijait
Most periodic tasks are assigned to processors using partition scheduling policy after checking feasibility conditions. A new approach is proposed for scheduling different activities with one periodic task within the system. In this paper, control strategies are identified for allocating different types of tasks (activities) to
individual computing elements like Smartphone or microphones. In our simulation model, each periodic task generates an aperiodic tasks are taken into consideration. Different sets of periodic tasks and aperiodic tasks are scheduled together. This new approach proves that when all different activities are
scheduled with one periodic tasks leads to better performance.
Optimizing Linux Kernel for Real-time Performance On Multi-Core ArchitectureCSCJournals
Linux kernel developed and distributed in open source doesn’t support for Hard Real-time scheduling. The open source Linux kernels are designed in time sharing manner to obtain maximum throughput. With this, Linux Operating System is considered to be an OS, which is not supporting Real-Time Applications, natively it has some features, already included in the mainstream to provide real-time support. There are certain modified Linux kernels like RTLinux, Symbian OS, Nucleus OS, Lynx OS and Fusion RTOS [1] which are explicitly designed for hard Real-Time support [2]. These specially designed Real-Time Linux kernels is mostly targeted for special hardware’s like embedded systems, robots, safety critical etc. ,very few kernels for general purpose. Most of these kernels are be available as proprietary or closed, excluding a very few and not suitable for all hardware architecture’s.
Now a days Real-Time Performance has become universal requirement for computer games, multimedia systems, household monitoring and controlling appliances. So the general purpose Linux kernel needs to be optimized, to achieve Real-time performance to meet the user expectations. This paper tries to extract real-time performance from general kernel and suggest some techniques to optimize Linux kernel to meet real-time deadlines.
COMPARATIVE ANALYSIS OF FCFS, SJN & RR JOB SCHEDULING ALGORITHMSijcsit
One of the primary roles of the operating system is job scheduling. Oftentimes, what makes the differencebetween the performance of one operating system over the other could be the underlying implementation ofits job scheduling algorithm. This paper therefore examines, under identical conditions and parameters,the comparative performances of First Come First Serve (FCFS), Shortest Job Next (SJN) and RoundRobin (RR) scheduling algorithms. Simulation results presented in this paper serve to stimulate furtherresearch into the subject area.
An improved approach to minimize context switching in round robin scheduling ...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Learning scheduler parameters for adaptive preemptioncsandit
An operating system scheduler is expected to not al
low processor stay idle if there is any
process ready or waiting for its execution. This pr
oblem gains more importance as the numbers
of processes always outnumber the processors by lar
ge margins. It is in this regard that
schedulers are provided with the ability to preempt
a running process, by following any
scheduling algorithm, and give us an illusion of si
multaneous running of several processes. A
process which is allowed to utilize CPU resources f
or a fixed quantum of time (termed as
timeslice for preemption) and is then preempted for
another waiting process. Each of these
'process preemption' leads to considerable overhead
of CPU cycles which are valuable resource
for runtime execution. In this work we try to utili
ze the historical performances of a scheduler
and predict the nature of current running process,
thereby trying to reduce the number of
preemptions. We propose a machine-learning module t
o predict a better performing timeslice
which is calculated based on static knowledge base
and adaptive reinforcement learning based
suggestive module. Results for an "adaptive timesli
ce parameter" for preemption show good
saving on CPU cycles and efficient throughput time.
What is a Process?
A process is a program in execution. Process is not as same as program code but a lot more than it. A process is an 'active' entity as opposed to program which is considered to be a 'passive' entity. Attributes held by process include hardware state, memory, CPU etc .
( Program & Process )
Program
A computer program is a collection of instruction that performs a specific task when executed by a computer .
Passive entity
( Process )
- Active entity
- Program code + pc + associated resources + Status of the
process’s execution .
Processes
Process Concept
Process Scheduling
Operations on Processes
Cooperating Processes
Interprocess Communication
Communication in Client-Server Systems
( Process Concept )
An operating system executes a variety of programs: -
- Batch system – jobs
- Time-shared systems – user programs or tasks
Process – a program in execution; process execution must progress in sequential fashion.
A process includes:
Text section
Data section
Stack section
program counter
( Process Concept )
Program is passive entity stored on disk (executable file), process is active
Program becomes process when executable file loaded into memory
Execution of program started via GUI mouse clicks, command line entry of its name, etc
One program can be several processes
Consider multiple users executing the same program
What the OS is going to do for the Process?
Creating and removing( destroying )process .
Controlling the progress of processes .
Acting on interrupts and arithmetic errors .
Resource allocation among processes .
Inter process communication .
( Process Memory )
Process memory is divided into four sections for efficient working : -
The Text section is made up of the compiled program code, read in from non-volatile storage when the program is launched.
The Data section is made up the global and static variables, allocated and initialized prior to executing the main.
The Heap is used for the dynamic memory allocation, and is managed via calls to new, delete, malloc, free, etc.
The Stack is used for local variables. Space on the stack is reserved for local variables when they are declared.
( Process Memory )
#include<iostream>
using namespace std;
int total;
int Square(int x)
{
return x*x;
}
int SquareOfSum(int x,int y)
{
int z=Square(x+y);
return z;
}
int main()
{
int a=4,b=8;
total=SquareOfSum(a,b);
cout<<"Total ="<<total<<endl;
system("pause");
}
( Stack & Heap )
#include<iostream>
using namespace std;
void main()
{
int x;
x=10;
int *ptr;
ptr=&x;
cout<<*ptr<<" "<<x<<" "<<ptr <<" "<<&x<<endl;
*ptr=30;
cout<<endl<<endl;
cout<<*ptr<<" "<<x<<" "<< ptr <<" "<<&x<<endl;
cout<<endl<<endl;
system("pause");
}
Gives an overview about Process, PCB, Process States, Process Operations, Scheduling, Schedulers, Interprocess communication, shared memory and message passing systems
Operating system 28 fundamental of schedulingVaibhav Khanna
The objective of multiprogramming is to have some process running at all times to maximize CPU utilization.
The objective of time-sharing system is to switch the CPU among processes so frequently that users can interact with each program while it is running.
For a uniprocessor system, there will never be more than one running process.
If there are more processes, the rest will have to wait until the CPU is free and can be rescheduled
PI-Tool To Improve Performance of Application In Multi-core ArchitectureCSCJournals
Multi-core CPUs become increasingly popular on server-grade hardware as well as end-user desktop PCs or laptops. Necessary efforts are taken in the community towards developing applications optimized for multi-core architecture [1], still every user is expecting to run applications or programs with more speed than normal execution. In order to achieve maximum possible performance, there is a need for fine tuning in the areas of Operating System scheduling, Process Priority and CPU Affinity. So this paper presents PI-tool, to aid user by changing priority and CPU Affinity to his application or program at runtime to achieve better performance .The PI-tool is compared with Red Hat TUNA tool with NQueens program the results are presented for evaluation.
SCHEDULING DIFFERENT CUSTOMER ACTIVITIES WITH SENSING DEVICEijait
Most periodic tasks are assigned to processors using partition scheduling policy after checking feasibility conditions. A new approach is proposed for scheduling different activities with one periodic task within the system. In this paper, control strategies are identified for allocating different types of tasks (activities) to
individual computing elements like Smartphone or microphones. In our simulation model, each periodic task generates an aperiodic tasks are taken into consideration. Different sets of periodic tasks and aperiodic tasks are scheduled together. This new approach proves that when all different activities are
scheduled with one periodic tasks leads to better performance.
Optimizing Linux Kernel for Real-time Performance On Multi-Core ArchitectureCSCJournals
Linux kernel developed and distributed in open source doesn’t support for Hard Real-time scheduling. The open source Linux kernels are designed in time sharing manner to obtain maximum throughput. With this, Linux Operating System is considered to be an OS, which is not supporting Real-Time Applications, natively it has some features, already included in the mainstream to provide real-time support. There are certain modified Linux kernels like RTLinux, Symbian OS, Nucleus OS, Lynx OS and Fusion RTOS [1] which are explicitly designed for hard Real-Time support [2]. These specially designed Real-Time Linux kernels is mostly targeted for special hardware’s like embedded systems, robots, safety critical etc. ,very few kernels for general purpose. Most of these kernels are be available as proprietary or closed, excluding a very few and not suitable for all hardware architecture’s.
Now a days Real-Time Performance has become universal requirement for computer games, multimedia systems, household monitoring and controlling appliances. So the general purpose Linux kernel needs to be optimized, to achieve Real-time performance to meet the user expectations. This paper tries to extract real-time performance from general kernel and suggest some techniques to optimize Linux kernel to meet real-time deadlines.
Numerical Analysis of Fin Side Turbulent Flow for Round and Flat Tube Heat E...IJMER
Numerical three dimensional simulation of turbulent flow in round and flat tube fin heat exchangers having two rows of staggered arrangement has been carried out to investigate fluid flow and heat transfer characteristics using ANSYS Fluent 14® software. HYPERMESH10® Software has been
used for the creation of models as well for meshing. The cases have been simulated for different fin side Reynolds number in turbulent regime to observe the effect of various parameters like fin pitch, tube pitch and fin temperature on Colburn j factor and Friction factor f for both round and flat tubes. Fin side flow has been simulated using various steady flow models in the software for same velocity range. As simulation using k-ε model resulted in close agreement with that of experimental in turbulent regime, it is considered for further analysis. The performance of round tubes is compared with that of flat tubes with same flow area and geometrical parameters. For both round and flat tube domains with all the geometrical configurations simulated in this work Colburn j factor varied inversely with the inlet air velocity. The heat transfer is more with the higher fin spacing for both round and flat tubes following the above said trend. On the other hand, the pressure drop across the tubes is more with the lesser fin spacing
in contrast to the heat transfer. Due to lesser turbulent intensity in flat tubes, they exhibit slightly lesser
Colburn j factor and considerably lesser pressure drop compared to round tubes. Although flat tubes
exhibit slightly lesser Colburn j factor, due to larger exposed tube area increase in the air temperature in
the fin side is comparable with that of round tubes. Higher fin temperatures result with lesser Colburn j factor and higher pressure drop across the tubes although the fin temperature affects the pressure drop to lesser extent.
Effect of Co doping on the structural and physical properties of SrC4H4O6.3H2...IJMER
Single crystals of strontium tartrate and cobalt doped strontium tartrate crystals were
grown by the single diffusion gel growth technique. The growth conditions were optimized by varying
the parameters such as pH, concentration of the gel, gel setting time and concentration of the reactants.
Silica gel was used as the growth medium with test tubes as crystallization vessels. Crystals having
different morphologies were obtained (transparent and few opaque). The grown crystals were
characterized by carrying out PXRD, SXRD, FTIR spectral, UV-Vis-NIR spectral, SHG, PL spectral,
AAS, microhardness and TG/DTA measurements. The tri hydrate crystals belong to the monoclinic
crystal system and the tetra hydrate crystals belong to orthorhombic crystal system and are optically
transparent, NLO active, mechanically soft and thermally stable up to 100 °C. AAS measurement
revealed the presence of Co atoms in the doped crystals. Results indicate that Co-doping significantly
increases SHG efficiency. Details are presented
Development of Nanocomposite from Epoxy/PDMS-Cyanate/Nanoclay for Materials w...IJMER
Dicyanate monomer viz bis-4-cyanato-polydimethylsiloxane(PDMS-CY) containing
siloxane known as thermally stable structural unit was prepared. The PDMS-CY/DGEBA-stability, thermal degradation kinetics and microstructures
Seasonal Variational Impact of the Physical Parameters On Mohand Rao River F...IJMER
The paper depicts the seasonal variational impact on water quality of Doon Valley . Study was
proposed to analyze the various water sample of Mohand-Rao river flowing in the Mohand Anticline in
the lower parts of Shiwalik hills in Doon Valley for physico-chemical characteristics of water quality
parameters such as pH; Temperature; Conductivity; Hardness; Alkalinity; Total Solids; Total Dissolved
Solids; Total Suspended Solids..To analyze the physical, chemical, and toxicological parameters of
Streams and rivers.
Impact of Hybrid Pass-Transistor Logic (HPTL) on Power, Delay and Area in VL...IJMER
Abstract: Power reduction is a serious concern now days. As the MOS devices are wide spread, there is
high need for circuits which consume less power, mainly for portable devices which run on batteries, like
Laptops and hand-held computers. The Pass-Transistor Logic (PTL) is a better way to implement circuits
designed for low power applications.
Numerical Analysis of Header Configuration of the Plate-Fin Heat ExchangerIJMER
Numerical analysis of a plate fin heat exchanger accounting for the effect of fluid flow
maldistribution onthe inlet header configuration of the heat exchanger is investigated. In this analysis , it
was found that flow maldistribution has effect on the flow perpendicular to its velocity direction. The peak
velocity occurs in the central zone of the header while the velocityalong the perpendicular direction of the
inlet flow diminishes more and more. By this investigation,the results of the flow maldistribution are
presented for a plate fin heat exchangerwhich is reduced as compare to theexisting configuration of the
plate fin heat exchanger.
(MCKIBBEN’S MUSCLE) Robots Make Our Work Lighter, But We Have Made the Robots...IJMER
International Journal of Modern Engineering Research (IJMER) is Peer reviewed, online Journal. It serves as an international archival forum of scholarly research related to engineering and science education.
Finite Element Analysis of Obround Pressure VesselsIJMER
International Journal of Modern Engineering Research (IJMER) is Peer reviewed, online Journal. It serves as an international archival forum of scholarly research related to engineering and science education.
A Threshold fuzzy entropy based feature selection method applied in various b...IJMER
Large amount of data have been stored and manipulated using various database
technologies. Processing all the attributes for the particular means is the difficult task. To avoid such
difficulties, feature selection process is processed.In this paper,we are collect a eight various benchmark
datasets from UCI repository.Feature selection process is carried out using fuzzy entropy based
relevance measure algorithm and follows three selection strategies like Mean selection strategy,Half
selection strategy and Neural network for threshold selection strategy. After the features are selected,
they are evaluated using Radial Basis Function (RBF) network,Stacking,Bagging,AdaBoostM1 and Antminer
classification methodologies.The test results depicts that Neural network for threshold selection
strategy works well in selecting features and Ant-miner methodology works best in bringing out better
accuracy with selected feature than processing with original dataset.The obtained result of this
experiment shows that clearly the Ant-miner is superiority than other classifiers.Thus, this proposed Antminer
algorithm could be a more suitable method for producing good results with fewer features than
the original datasets.
AN IMPROVED ROUND ROBIN CPU SCHEDULING ALGORITHM WITH VARYING TIME QUANTUMIJCSEA Journal
Process management is one of the important tasks performed by the operating system. The performance of
the system depends on the CPU scheduling algorithms. The main aim of the CPU scheduling algorithms is
to minimize waiting time, turnaround time, response time and context switching and maximizing CPU
utilization. First-Come-First-Served (FCFS) Round Robin (RR), Shortest Job First (SJF) and, Priority
Scheduling are some popular CPU scheduling algorithms. In time shared systems, Round Robin CPU
scheduling is the preferred choice. In Round Robin CPU scheduling, performance of the system depends on
the choice of the optimal time quantum. This paper presents an improved Round Robin CPU scheduling
algorithm coined enhancing CPU performance using the features of Shortest Job First and Round Robin
scheduling with varying time quantum. The proposed algorithm is experimentally proven better than
conventional RR. The simulation results show that the waiting time and turnaround time have been reduced
in the proposed algorithm compared to traditional RR.
Process management is one of the important tasks performed by the operating system. The performance of
the system depends on the CPU scheduling algorithms. The main aim of the CPU scheduling algorithms is
to minimize waiting time, turnaround time, response time and context switching and maximizing CPU
utilization. First-Come-First-Served (FCFS) Round Robin (RR), Shortest Job First (SJF) and, Priority
Scheduling are some popular CPU scheduling algorithms. In time shared systems, Round Robin CPU
scheduling is the preferred choice. In Round Robin CPU scheduling, performance of the system depends on
the choice of the optimal time quantum. This paper presents an improved Round Robin CPU scheduling
algorithm coined enhancing CPU performance using the features of Shortest Job First and Round Robin
scheduling with varying time quantum. The proposed algorithm is experimentally proven better than
conventional RR. The simulation results show that the waiting time and turnaround time have been reduced
in the proposed algorithm compared to traditional RR.
AN OPTIMIZED ROUND ROBIN CPU SCHEDULING ALGORITHM WITH DYNAMIC TIME QUANTUMijcseit
CPU scheduling is one of the most crucial operations performed by operating system. Different algorithms
are available for CPU scheduling amongst them RR (Round Robin) is considered as optimal in time shared
environment. The effectiveness of Round Robin completely depends on the choice of time quantum. In this
paper a new CPU scheduling algorithm has been proposed, named as DABRR (Dynamic Average Burst
Round Robin). That uses dynamic time quantum instead of static time quantum used in RR. The
performance of the proposed algorithm is experimentally compared with traditional RR and some existing
variants of RR. The results of our approach presented in this paper demonstrate improved performance in
terms of average waiting time, average turnaround time, and context switching.
CPU scheduling is one of the most crucial operations performed by operating system. Different algorithms
are available for CPU scheduling amongst them RR (Round Robin) is considered as optimal in time shared
environment. The effectiveness of Round Robin completely depends on the choice of time quantum. In this
paper a new CPU scheduling algorithm has been proposed, named as DABRR (Dynamic Average Burst
Round Robin). That uses dynamic time quantum instead of static time quantum used in RR. The
performance of the proposed algorithm is experimentally compared with traditional RR and some existing
variants of RR. The results of our approach presented in this paper demonstrate improved performance in
terms of average waiting time, average turnaround time, and context switching.
AN OPTIMIZED ROUND ROBIN CPU SCHEDULING ALGORITHM WITH DYNAMIC TIME QUANTUMijcseit
CPU scheduling is one of the most crucial operations performed by operating system. Different algorithms
are available for CPU scheduling amongst them RR (Round Robin) is considered as optimal in time shared
environment. The effectiveness of Round Robin completely depends on the choice of time quantum. In this
paper a new CPU scheduling algorithm has been proposed, named as DABRR (Dynamic Average Burst
Round Robin). That uses dynamic time quantum instead of static time quantum used in RR. The
performance of the proposed algorithm is experimentally compared with traditional RR and some existing
variants of RR. The results of our approach presented in this paper demonstrate improved performance in
terms of average waiting time, average turnaround time, and context switching.
AN OPTIMIZED ROUND ROBIN CPU SCHEDULING ALGORITHM WITH DYNAMIC TIME QUANTUMijcseit
CPU scheduling is one of the most crucial operations performed by operating system. Different algorithms are available for CPU scheduling amongst them RR (Round Robin) is considered as optimal in time shared environment. The effectiveness of Round Robin completely depends on the choice of time quantum. In this paper a new CPU scheduling algorithm has been proposed, named as DABRR (Dynamic Average Burst Round Robin). That uses dynamic time quantum instead of static time quantum used in RR. The performance of the proposed algorithm is experimentally compared with traditional RR and some existing variants of RR. The results of our approach presented in this paper demonstrate improved performance in terms of average waiting time, average turnaround time, and context switching.
CPU Scheduling is a process of determining which process will own CPU for execution while another process is on hold. The main task of CPU scheduling is to make sure that whenever the CPU remains idle, the OS at least select one of the processes available in the ready queue for execution.
Comparative analysis of the essential CPU scheduling algorithmsjournalBEEI
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.
In a multiprogramming system, multiple processes exist concurrently in main memory. Each process alternates between using a processor and waiting for some event to occur, such as the completion of an I O operation. The processor or processors are kept busy by executing one process while the others wait. The key to multiprogramming is scheduling. CPU scheduling deals with the problem of deciding which of the processes in the ready queue is to be allocated the CPU. By switching the CPU among processor the operating system can make the computer more productive. Scheduling affectes the performance of the system because it determines which processes will wait and which will progress. In this paper, simulation of various scheduling algorithm First Come First Served FCFS , Round Robin RR , Shortest Process Next SPN and Shortest Remaining Time SRT is done over C Daw Khin Po ""Simulation of Process Scheduling Algorithms"" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-3 | Issue-4 , June 2019, URL: https://www.ijtsrd.com/papers/ijtsrd25124.pdf
Paper URL: https://www.ijtsrd.com/computer-science/operating-system/25124/simulation-of-process-scheduling-algorithms/daw-khin-po
A Study on Translucent Concrete Product and Its Properties by Using Optical F...IJMER
- Translucent concrete is a concrete based material with light-transferring properties,
obtained due to embedded light optical elements like Optical fibers used in concrete. Light is conducted
through the concrete from one end to the other. This results into a certain light pattern on the other
surface, depending on the fiber structure. Optical fibers transmit light so effectively that there is
virtually no loss of light conducted through the fibers. This paper deals with the modeling of such
translucent or transparent concrete blocks and panel and their usage and also the advantages it brings
in the field. The main purpose is to use sunlight as a light source to reduce the power consumption of
illumination and to use the optical fiber to sense the stress of structures and also use this concrete as an
architectural purpose of the building
Developing Cost Effective Automation for Cotton Seed DelintingIJMER
A low cost automation system for removal of lint from cottonseed is to be designed and
developed. The setup consists of stainless steel drum with stirrer in which cottonseeds having lint is mixed
with concentrated sulphuric acid. So lint will get burn. This lint free cottonseed treated with lime water to
neutralize acidic nature. After water washing this cottonseeds are used for agriculter purpose
Study & Testing Of Bio-Composite Material Based On Munja FibreIJMER
The incorporation of natural fibres such as munja fiber composites has gained
increasing applications both in many areas of Engineering and Technology. The aim of this study is to
evaluate mechanical properties such as flexural and tensile properties of reinforced epoxy composites.
This is mainly due to their applicable benefits as they are light weight and offer low cost compared to
synthetic fibre composites. Munja fibres recently have been a substitute material in many weight-critical
applications in areas such as aerospace, automotive and other high demanding industrial sectors. In
this study, natural munja fibre composites and munja/fibreglass hybrid composites were fabricated by a
combination of hand lay-up and cold-press methods. A new variety in munja fibre is the present work
the main aim of the work is to extract the neat fibre and is characterized for its flexural characteristics.
The composites are fabricated by reinforcing untreated and treated fibre and are tested for their
mechanical, properties strictly as per ASTM procedures.
Hybrid Engine (Stirling Engine + IC Engine + Electric Motor)IJMER
Hybrid engine is a combination of Stirling engine, IC engine and Electric motor. All these 3 are
connected together to a single shaft. The power source of the Stirling engine will be a Solar Panel. The aim of
this is to run the automobile using a Hybrid engine
Fabrication & Characterization of Bio Composite Materials Based On Sunnhemp F...IJMER
The present day technology demands eco-friendly developments. In this era the
composite material are playing a vital roal in different field of Engineering .The composite materials
are using as a principle materials. Nowaday the composite materials are utilizing as a important
component of engineering field .Where as the importance of the applications of composites is well
known, but thrust on the use of natural fibres in it for reinforcement has been given priority for some
times. But changing from synthetic fibres to natural fibres provides only half green-composites. A
partial green composite will be achieved if the matrix component is also eco-friendly. Keeping this in
view, a detailed literature surveyed has been carried out through various issues of the Journals
related to this field. The material systems used are sunnhemp fibres. Some epoxy and hardener has
been also added for stability and drying of the bio-composites. Various graphs and bar-charts are
super-imposed on each other for comparison among themselves and Graphs is plotted on MAT LAB
and ORIGIN 6.0 software. To determining tensile strengths, Various properties for different biocomposites
have been compared among themselves. Comparison of the behaviour of bio-composites of
this work has been also compare with other works. The bio-composites developed in this work are
likely to get applications in fall ceilings, partitions, bio-degradable packagings, automotive interiors,
sports things (e.g. rackets, nets, etc.), toys etc.
Geochemistry and Genesis of Kammatturu Iron Ores of Devagiri Formation, Sandu...IJMER
The Greenstone belts of Karnataka are enriched in BIFs in Dharwar craton, where Iron
formations are confined to the basin shelf, clearly separated from the deeper-water iron formation that
accumulated at the basin margin and flanking the marine basin. Geochemical data procured in terms of
major, trace and REE are plotted in various diagrams to interpret the genesis of BIFs. Al2O3, Fe2O3 (T),
TiO2, CaO, and SiO2 abundances and ratios show a wide variation. Ni, Co, Zr, Sc, V, Rb, Sr, U, Th,
ΣREE, La, Ce and Eu anomalies and their binary relationships indicate that wherever the terrigenous
component has increased, the concentration of elements of felsic such as Zr and Hf has gone up. Elevated
concentrations of Ni, Co and Sc are contributed by chlorite and other components characteristic of basic
volcanic debris. The data suggest that these formations were generated by chemical and clastic
sedimentary processes on a shallow shelf. During transgression, chemical precipitation took place at the
sediment-water interface, whereas at the time of regression. Iron ore formed with sedimentary structures
and textures in Kammatturu area, in a setting where the water column was oxygenated.
Experimental Investigation on Characteristic Study of the Carbon Steel C45 in...IJMER
In this paper, the mechanical characteristics of C45 medium carbon steel are investigated
under various working conditions. The main characteristic to be studied on this paper is impact toughness
of the material with different configurations and the experiment were carried out on charpy impact testing
equipment. This study reveals the ability of the material to absorb energy up to failure for various
specimen configurations under different heat treated conditions and the corresponding results were
compared with the analysis outcome
Non linear analysis of Robot Gun Support Structure using Equivalent Dynamic A...IJMER
Robot guns are being increasingly employed in automotive manufacturing to replace
risky jobs and also to increase productivity. Using a single robot for a single operation proves to be
expensive. Hence for cost optimization, multiple guns are mounted on a single robot and multiple
operations are performed. Robot Gun structure is an efficient way in which multiple welds can be done
simultaneously. However mounting several weld guns on a single structure induces a variety of
dynamic loads, especially during movement of the robot arm as it maneuvers to reach the weld
locations. The primary idea employed in this paper, is to model those dynamic loads as equivalent G
force loads in FEA. This approach will be on the conservative side, and will be saving time and
subsequently cost efficient. The approach of the paper is towards creating a standard operating
procedure when it comes to analysis of such structures, with emphasis on deploying various technical
aspects of FEA such as Non Linear Geometry, Multipoint Constraint Contact Algorithm, Multizone
meshing .
Static Analysis of Go-Kart Chassis by Analytical and Solid Works SimulationIJMER
This paper aims to do modelling, simulation and performing the static analysis of a go
kart chassis consisting of Circular beams. Modelling, simulations and analysis are performed using 3-D
modelling software i.e. Solid Works and ANSYS according to the rulebook provided by Indian Society of
New Era Engineers (ISNEE) for National Go Kart Championship (NGKC-14).The maximum deflection is
determined by performing static analysis. Computed results are then compared to analytical calculation,
where it is found that the location of maximum deflection agrees well with theoretical approximation but
varies on magnitude aspect.
In récent year various vehicle introduced in market but due to limitation in
carbon émission and BS Séries limitd speed availability vehicle in the market and causing of
environnent pollution over few year There is need to decrease dependancy on fuel vehicle.
bicycle is to be modified for optional in the future To implement new technique using change in
pedal assembly and variable speed gearbox such as planetary gear optimise speed of vehicle
with variable speed ratio.To increase the efficiency of bicycle for confortable drive and to
reduce torque appli éd on bicycle. we introduced epicyclic gear box in which transmission done
throgh Chain Drive (i.e. Sprocket )to rear wheel with help of Epicyclical gear Box to give
number of différent Speed during driving.To reduce torque requirent in the cycle with change in
the pedal mechanism
Integration of Struts & Spring & Hibernate for Enterprise ApplicationsIJMER
The proposal of this paper is to present Spring Framework which is widely used in
developing enterprise applications. Considering the current state where applications are developed using
the EJB model, Spring Framework assert that ordinary java beans(POJO) can be utilize with minimal
modifications. This modular framework can be used to develop the application faster and can reduce
complexity. This paper will highlight the design overview of Spring Framework along with its features that
have made the framework useful. The integration of multiple frameworks for an E-commerce system has
also been addressed in this paper. This paper also proposes structure for a website based on integration of
Spring, Hibernate and Struts Framework.
Microcontroller Based Automatic Sprinkler Irrigation SystemIJMER
Microcontroller based Automatic Sprinkler System is a new concept of using
intelligence power of embedded technology in the sprinkler irrigation work. Designed system replaces
the conventional manual work involved in sprinkler irrigation to automatic process. Using this system a
farmer is protected against adverse inhuman weather conditions, tedious work of changing over of
sprinkler water pipe lines & risk of accident due to high pressure in the water pipe line. Overall
sprinkler irrigation work is transformed in to a comfortableautomatic work. This system provides
flexibility & accuracy in respect of time set for the operation of a sprinkler water pipe lines. In present
work the author has designed and developed an automatic sprinkler irrigation system which is
controlled and monitored by a microcontroller interfaced with solenoid valves.
On some locally closed sets and spaces in Ideal Topological SpacesIJMER
In this paper we introduce and characterize some new generalized locally closed sets
known as
δ
ˆ
s-locally closed sets and spaces are known as
δ
ˆ
s-normal space and
δ
ˆ
s-connected space and
discussed some of their properties
Intrusion Detection and Forensics based on decision tree and Association rule...IJMER
This paper present an approach based on the combination of, two techniques using
decision tree and Association rule mining for Probe attack detection. This approach proves to be
better than the traditional approach of generating rules for fuzzy expert system by clustering methods.
Association rule mining for selecting the best attributes together and decision tree for identifying the
best parameters together to create the rules for fuzzy expert system. After that rules for fuzzy expert
system are generated using association rule mining and decision trees. Decision trees is generated for
dataset and to find the basic parameters for creating the membership functions of fuzzy inference
system. Membership functions are generated for the probe attack. Based on these rules we have
created the fuzzy inference system that is used as an input to neuro-fuzzy system. Fuzzy inference
system is loaded to neuro-fuzzy toolbox as an input and the final ANFIS structure is generated for
outcome of neuro-fuzzy approach. The experiments and evaluations of the proposed method were
done with NSL-KDD intrusion detection dataset. As the experimental results, the proposed approach
based on the combination of, two techniques using decision tree and Association rule mining
efficiently detected probe attacks. Experimental results shows better results for detecting intrusions as
compared to others existing methods
Natural Language Ambiguity and its Effect on Machine LearningIJMER
"Natural language processing" here refers to the use and ability of systems to process
sentences in a natural language such as English, rather than in a specialized artificial computer
language such as C++. The systems of real interest here are digital computers of the type we think of as
personal computers and mainframes. Of course humans can process natural languages, but for us the
question is whether digital computers can or ever will process natural languages. We have tried to
explore in depth and break down the types of ambiguities persistent throughout the natural languages
and provide an answer to the question “How it affects the machine translation process and thereby
machine learning as whole?” .
Today in era of software industry there is no perfect software framework available for
analysis and software development. Currently there are enormous number of software development
process exists which can be implemented to stabilize the process of developing a software system. But no
perfect system is recognized till yet which can help software developers for opting of best software
development process. This paper present the framework of skillful system combined with Likert scale. With
the help of Likert scale we define a rule based model and delegate some mass score to every process and
develop one tool name as MuxSet which will help the software developers to select an appropriate
development process that may enhance the probability of system success.
Material Parameter and Effect of Thermal Load on Functionally Graded CylindersIJMER
The present study investigates the creep in a thick-walled composite cylinders made
up of aluminum/aluminum alloy matrix and reinforced with silicon carbide particles. The distribution
of SiCp is assumed to be either uniform or decreasing linearly from the inner to the outer radius of
the cylinder. The creep behavior of the cylinder has been described by threshold stress based creep
law with a stress exponent of 5. The composite cylinders are subjected to internal pressure which is
applied gradually and steady state condition of stress is assumed. The creep parameters required to
be used in creep law, are extracted by conducting regression analysis on the available experimental
results. The mathematical models have been developed to describe steady state creep in the composite
cylinder by using von-Mises criterion. Regression analysis is used to obtain the creep parameters
required in the study. The basic equilibrium equation of the cylinder and other constitutive equations
have been solved to obtain creep stresses in the cylinder. The effect of varying particle size, particle
content and temperature on the stresses in the composite cylinder has been analyzed. The study
revealed that the stress distributions in the cylinder do not vary significantly for various combinations
of particle size, particle content and operating temperature except for slight variation observed for
varying particle content. Functionally Graded Materials (FGMs) emerged and led to the development
of superior heat resistant materials.
Energy Audit is the systematic process for finding out the energy conservation
opportunities in industrial processes. The project carried out studies on various energy conservation
measures application in areas like lighting, motors, compressors, transformer, ventilation system etc.
In this investigation, studied the technical aspects of the various measures along with its cost benefit
analysis.
Investigation found that major areas of energy conservation are-
1. Energy efficient lighting schemes.
2. Use of electronic ballast instead of copper ballast.
3. Use of wind ventilators for ventilation.
4. Use of VFD for compressor.
5. Transparent roofing sheets to reduce energy consumption.
So Energy Audit is the only perfect & analyzed way of meeting the Industrial Energy Conservation.
An Implementation of I2C Slave Interface using Verilog HDLIJMER
The focus of this paper is on implementation of Inter Integrated Circuit (I2C) protocol
following slave module for no data loss. In this paper, the principle and the operation of I2C bus protocol
will be introduced. It follows the I2C specification to provide device addressing, read/write operation and
an acknowledgement. The programmable nature of device provide users with the flexibility of configuring
the I2C slave device to any legal slave address to avoid the slave address collision on an I2C bus with
multiple slave devices. This paper demonstrates how I2C Master controller transmits and receives data to
and from the Slave with proper synchronization.
The module is designed in Verilog and simulated in ModelSim. The design is also synthesized in Xilinx
XST 14.1. This module acts as a slave for the microprocessor which can be customized for no data loss.
Discrete Model of Two Predators competing for One PreyIJMER
This paper investigates the dynamical behavior of a discrete model of one prey two
predator systems. The equilibrium points and their stability are analyzed. Time series plots are obtained
for different sets of parameter values. Also bifurcation diagrams are plotted to show dynamical behavior
of the system in selected range of growth parameter
Discrete Model of Two Predators competing for One Prey
Do2644844490
1. International Journal of Modern Engineering Research (IJMER)
www.ijmer.com Vol.2, Issue.6, Nov-Dec. 2012 pp-4484-4490 ISSN: 2249-6645
A Novel CPU Scheduling Algorithm–Preemptive & Non-Preemptive
Sukumar Babu Bandarupalli1, Neelima Priyanka Nutulapati2,
Prof. Dr. P.Suresh Varma3
1
(Computer Science & Engg, Vijaya Institute of Technology for Women, India)
2
(MCA & CSE Dept, SRK Institute of Technology, India)
3
(Computer Science & Dean, Adikavi Nannaya University, India
ABSTRACT: The main objective of this paper is to introduce a new CPU algorithm called A Novel CPU Scheduling
Algorithm which acts as both preemptive and non-preemptive based on the arrival time. The prosed algorithm helps to
improve the CPU efficiency in real time uni-processor-multi programming operating system. CPU Scheduling is the basis of
multi-programmed operating system. The scheduler is responsible for multiplexing processes on the CPU. There are many
scheduling algorithms available for a multi-programmed operating system like FCFS, SJF, Priority, Round Robin etc. In
this paper, the results of the existing algorithms (FCFS, SJF, Priority and Round Robin) are compared with the proposed
algorithm.
Keyword: Operating System, uni-processor, uni programming, multi-programming, Resource utilization, Scheduling,
FCFS, SJF, Priority, Round Robin, ERR etc.
I. INTRODUCTION
Operating system performs variety of tasks in which scheduling is one of the basic task. Scheduling is heart of any
computer system since it contains decision of giving resources between possible processes. Sharing of computer resources
between multiple processes is also called scheduling [1]. Process is a smallest work unit of a program which requires a set of
resources for its execution that are allocated to it by the CPU. These processes are many in number and keep coming in a
particular fashion, different scheduling techniques are employed that enable faster and efficient process execution thereby
reducing the waiting time faced by each process and increasing CPU utilization. A process has five basic states namely
NEW, Ready, Running, Waiting and Terminate [1] [2].
Throughout its lifetime a process migrates between various scheduling queues by different schedulers until it gets
terminated. These queues mainly contain the ready queue which contains set of processes ready for CPU response. The
second queue is the device or the I/O queue which contains all the processes that are waiting for I/O response [1]. The
operating system must select processes for scheduling from these queues in a specific manner. This selection process using a
particular scheduling technique is carried out by schedulers. Schedulers in general try to maximize the average performance
of a system according to the given criterion [3]. Scheduling algorithms are broadly classified into preemptive and non-
preemptive scheduling disciplines.
The algorithm proposed in this article is both preemptive and non-preemptive in nature and attempts to give fair
CPU execution time by focusing on average waiting time and turnaround time of a process.
This article comprises of the following sections: Section 2 presents scheduling parameters, which will decide
against which parameters the new CPU algorithm will be tested. Section 3 introduces existing scheduling algorithms.
Section 4 explains the proposed Algorithm – A Novel CPU Scheduling algorithm. Section 5 contains pseudo code of the
proposed algorithm. Section 6 explains the two basic elements that make up the simulation and provide an interactive user
interface. Section 7 presents a graphical comparison of the new algorithm with existing algorithms. Section 8 will provide
conclusion of the work.
II. SCHEDULING PARAMETERS
THERE ARE DIFFERENT SCHEDULING ALGORITHMS WITH DIFFERENT CHARACTERISTICS WHICH DECIDE SELECTION OF
PROCESS USING DIFFERENT CRITERIA FOR EXECUTION BY CPU. THE CRITERIA FOR A GOOD SCHEDULING ALGORITHM DEPEND,
AMONG OTHERS, ON THE FOLLOWING MEASURES [1].
A. CPU Utilization: It is the average fraction of time, during which the processor is busy [2, 4].
B. Throughput: It refers to the amount of work completed in a unit of time. The number of processes the system can
execute in a period of time. The higher the number, the more work is done by the system [4].
C. Waiting Time: The average period of time a process spends waiting. Waiting time may be expressed as turnaround time
less the actual execution time [4].
D. Turnaround time: The interval from the time of submission of a process to the time of completion is the turnaround
time [4].
E. Response time: Response time is the time from submission of a request until the first response is produced [4].
F. Priority: give preferential treatment to processes with higher priorities [4].
G. Fairness: Avoid the process from starvation. All the processes must be given equal opportunity to execute [4].
www.ijmer.com 4484 | Page
2. International Journal of Modern Engineering Research (IJMER)
www.ijmer.com Vol.2, Issue.6, Nov-Dec. 2012 pp-4484-4490 ISSN: 2249-6645
III. OVERVIEW OF EXISTING CPU SCHEDULING ALGORITHMS.
A. FIRST COME FIRST SERVED (FCFS) Scheduling.
It is the simplest CPU Scheduling algorithm. The criteria of this algorithm is „the process that requests first, holds
the CPU first‟ or which process enter the ready queue first is served first [3]. The workload is processed in the order of
arrival time, with no preemption [2]. Once a process has been submitted to the CPU, it runs into completion without being
interrupted. Such a technique is fair in the case of smaller processes but is quite unfair for long an unimportant job [5]. Since
FCFS does not involve context switching therefore it has minimal overhead. It has low throughput since long processes can
keep processor occupied for a long time making small processes suffer. As a result waiting time, turnaround time and
response time can be low [6].
B. Shortest Job First (SJF) Scheduling.
The criteria of this algorithm are which process having the smallest CPU burst, CPU is assigned to that process
next. If two process having the same CPU burst time FCFS is used to break up the tie [3]. SJF can be worked as preemptive
and non–preemptive in nature based on the arrival time and burst time of the processes. SJF reduces average waiting time of
the processes as compared to FCFS. SJF favors shorter processes over longer ones which is an overhead as compared to
FCFS. It selects the job with the smallest burst time ensuing CPU availability for other processes as soon as the current
process reaches its completion. This prevents smaller processes from suffering behind larger processes in the ready queue for
a longer time [5] [7].
C. Priority Based Scheduling.
In this algorithm, priority is associated with each process and on the basis of that priority CPU is allocated to the
processes. Higher priority processes are executed first and lower priority processes are executed at the end. If multiple
processes having the same priorities are ready to execute, control of CPU is assigned to these processes on the basis of FCFS
[1]. Priority Scheduling can be preemptive and non-preemptive in nature.
D. Round Robin (RR) Scheduling.
It is a preemptive scheduling algorithm. It is designed especially for time sharing systems. In this algorithm, a small
unit of time called time quantum or time slice is assigned to each process [2]. When the time quantum expired, the CPU is
switched to another process. Performance of Round Robin totally depends on the size of the time quantum.
IV. PROPOSED WORK: NOVEL CPU SCHEDULING ALGORITHM
The proposed algorithm A Novel CPU Scheduling algorithm is both preemptive and non-preemptive in nature. In
this algorithm a new factor called condition factor (F) is calculated by the addition of burst time and arrival time ie., F =
Burst Time + Arrival Time.
This factor f is assigned to each process and on the basis of this factor process are arranged in ascending order in the
ready queue. Process having shortest condition factor (F) are executed first and process with next shortest factor (F) value is
executed next. By considering the arrival time the new algorithms acts as preemptive or non-preemptive.
Proposed CPU scheduling algorithm reduces waiting time, turnaround time and response time and also increases
CPU utilization and throughput.
The working procedure of A Novel Preemptive Scheduling of Preemptive and Non Preemptive algorithm is as given below:
Take the list of processes, their burst time and arrival time.
Find the condition factor F by adding arrival time and burst time of processes.
First arrange the processes, burst time, condition factor based on arrival time ascending order.
Iterate step a, b until burst time becomes zero.
a. If arrival time of first and second process are equal the arrange them based on their condition factor f.
b. Decrement the burst time and increment arrival time by 1
When burst time becomes find the waiting time and turnaround time of that process.
Average waiting time is calculated by dividing total waiting time with total number of processes.
Average turnaround time is calculated by dividing total turnaround time by total number of processes.
V. PSEUDO CODE
Initialization variables
Burst time[n] 0
Arrival time[n] 0
Numprocess[n] 0
Factor[i] 0
Turn[n] 0
Wait[n] 0
Temp 0
Current time 0
Wait time=0
www.ijmer.com 4485 | Page
3. International Journal of Modern Engineering Research (IJMER)
www.ijmer.com Vol.2, Issue.6, Nov-Dec. 2012 pp-4484-4490 ISSN: 2249-6645
Turn time=0
Avgwaititme=0.0
Avgturntime=0.0
Read burst time[n] and arrival time[n]
Compute factor[i] <- bursstime[i] + arrival time[i]
a. Pseudo code for Non Preemptive
Arrange the elements in ascending order based on condition factor
For i 0 to n-1
For j I to n
If factor[i] > factor[j]
Temp burst time[i]
Burst time[i] burst time[j]
Burst time[j] temp
Temp arrival time[i]
Arrival time[i] arrival time[j]
Arrival time[j] temp
Temp factor[i]
Factor[i] factor[j]
Factor[j] temp
End for
For i 0 to n
Begin
Wait[i]=wait[i]+burst time[i]
Turn[i]=wait[i]+btime[i]
Wait time = wartime + wait[i]
turn time = turn time + turn[i]
End
Avgwaittime = wait time/n
Avgturntime = turn time/n
b. Pseudo code for Preemptive
Arrange the elements in ascending order based on arrival time
For i 0 to n-1
For j I to n
If factor[i] > factor[j]
Temp burst time[i]
Burst time[i] burst time[j]
Burst time[j] temp
Temp arrival time[i]
Arrival time[i] arrival time[j]
Arrival time[j] temp
Temp factor[i]
Factor[i] factor[j]
Factor[j] temp
End for
For i 0 to n-1
For j I to n
If atime[i] == atime[j] then sort elements in ascending order based on factor[i] and factor[j]
If burs time! =0 && atime==current time
Begin
Atime[i] =atime[i]+1
Btime[i] =btime[i]-1
Current time++
If btime[i]==0
turn time=current time
End
For i 0 to n
Begin
Wait [i]=turn[i]-btime[i]-atime[i]
turn [i]=turn[i]+atime[i]
Wait time = wartime + wait[i]
Turn time = turn time + turn[i]
www.ijmer.com 4486 | Page
4. International Journal of Modern Engineering Research (IJMER)
www.ijmer.com Vol.2, Issue.6, Nov-Dec. 2012 pp-4484-4490 ISSN: 2249-6645
End
Avgwaittime = wait time/n
Avgturntime = turn time/n
VI. SIMULATION DESIGN
The simulation provides an interactive GUI interface to the user through which a user can input data related to
different processes then applying different algorithms based on the algorithm choices given in the simulator. The
simulator employs JAVA swings.
The front end user interfaces are designed using java awt‟s and swings. The parent screen i.e., screen1 allows the
user to enter number of processes to be in execution.
Screen 2 allows the user to enter the details of the processes burst time, arrival time and priority.
Screen 3 shows that a user can compare any two algorithms of his choice or he can compare all the scheduling algorithms.
www.ijmer.com 4487 | Page
5. International Journal of Modern Engineering Research (IJMER)
www.ijmer.com Vol.2, Issue.6, Nov-Dec. 2012 pp-4484-4490 ISSN: 2249-6645
Screen 4 shows the Graphical Comparison of all the algorithms
Screen 5 shows the non-graphical comparison of all the algorithms
VII. COMPARISON OF PROPOSED ALGORITHM WITH OTHER CPU SCHEDULING
ALGORITHMS.
To compare the performance of the proposed scheduling algorithm it was implemented and compared with the
existing scheduling algorithm. GUI and CUI figures, shows the comparison between the proposed algorithm with existing
algorithms.
Example 2: Screen 6 takes different processes burst time and arrival time and priority values
www.ijmer.com 4488 | Page
6. International Journal of Modern Engineering Research (IJMER)
www.ijmer.com Vol.2, Issue.6, Nov-Dec. 2012 pp-4484-4490 ISSN: 2249-6645
Screen 7 shows the graphical representation of example 2
Screen 8 shows the non-graphical representation of example 2
Example 3: Screen 9 takes different processes burst time and arrival time and priority values
Screen 10 shows the graphical representation of example3
www.ijmer.com 4489 | Page
7. International Journal of Modern Engineering Research (IJMER)
www.ijmer.com Vol.2, Issue.6, Nov-Dec. 2012 pp-4484-4490 ISSN: 2249-6645
Screen 11 shows the non-graphical representation of example3
VIII. CONCLUSION
The paper presents a new CPU scheduling algorithm called A Novel Pre-emptive and Non Pre-emptive CPU
Scheduling Algorithm. Paper also contains simulation interface and its working, which interactively takes input from the
user and compares the process set against different algorithm pairs. The result of the simulation for different process sets
using different scheduling algorithms has been presented graphically in this piece of work. The last half of the paper
provides analytical result with each set of graph. From the above graphs and results from example 1, 2 and 3, it is clear that
proposed algorithm is more efficient than FCFS, Pre-emptive Priority and Non Pre-emptive Priority, Round Robin. And also
observed that proposed algorithm gives almost equal performance like a SJF Pre-emptive and Non Pre-emptive algorithm
REFERENCES
[1] Abraham Silberschatz, Peter Baer Galvin, Greg Gagne, “Operating System Concepts”, Sixth Edition.
[2] Milan Milenkovic, “Operating Systems Concepts and Design”, McGRAM-HILL, Computer Science Series, second edition.
[3] P. Balakrishna Prasad, “Operating Systems” Second Edition.
[4] A. Dhore “Opeating Systems”, Technical Publications.
[5] M. Dietel, “Operating Systems”, Pearson Education, Second Edition.
[6] http://en.wikipedia.org/wiki/Scheduling
[7] M Gary Nutt, “Operating systems – A Modern Perspective, Second Edition, Pearson Education, 2000.
www.ijmer.com 4490 | Page