Performance Analysis of Scheduling Algorithms in Simulated Parallel Environment

evaluate and compare the performance of various Scheduling Algorithms. Efficiency of scheduling algorithms is essential in order to attain optimal performance from parallel programming systems. The proposed work consider a connected set of workstations as a “pool of processors ” to analyze the performance of scheduling algorithms. Scheduling algorithms select the best possible subset of workstations for a task to minimize its completion time. Virtualization of parallelization environment is carried out with the help of simulated program, which simulates all components of actual processors so as to give best possible outcome. Such simulated framework will provide the stage for the young researchers to model and evaluate their scheduling policies on virtual parallel environment. The paper presents first come first serve, smallest job first and round robin scheduling approaches where general problem is analyzed and modeled for a simple scenario. The performance of proposed schemes is evaluated and benefits are highlighted in terms of Respons