Untitled Document
| |
|
| |
PERFORMANCE ANALYSIS OF SCHEDULING ALGORITHM IN SIMULATED PARALLE ENVIRONMENT |
| |
|
|
| |
|
International Conference on Infomration System, Computer Engineering & Application ( ICISCEA 2011 ) |
| |
|
© 2011 by OLS Journal - ISSN No : 2091-
0266 |
| |
|
Number 1 |
| |
|
Year of Publication : December Issue , 2011 |
| |
|
Authors : Gagandeep Singh, Ritu Bala, Bhavneet Singh |
| |
----------------------------------------------------------------------------------------------------------------------------------------------------------------------- |
| |
Citation |
Gagandeep Singh, Ritu Bala, Bhavneet Singh :PERFORMANCE ANALYSIS OF SCHEDULING ALGORITHM IN SIMULATED PARALLE ENVIRONMENT: OLS Journals Special Isssue onInfomration System, Computer Engineering & Application , 2011 , Published by : OLS Journals |
| |
----------------------------------------------------------------------------------------------------------------------------------------------------------------------- |
| |
Abstract |
|
| |
Performance analysis of Scheduling Algorithms in Simulated Parallel Environment is a Thesis made in Visual Basic.Net, which enables to make the system to 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. System to evaluate and compare the performance of various scheduling algorithms has been implemented. It 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.
This thesis is an effort to provide a GUI based simulated Parallel framework for the Performance analysis of Scheduling Algorithms in Simulated Parallel Environment. 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 intention behind this parallel simulation environment is the necessity to facilitate the research of parallel systems and performance measurement of scheduling algorithms in developing countries. |
| |
----------------------------------------------------------------------------------------------------------------------------------------------------------------------- |
| |
Keywords |
: |
| |
References : |
|
| |
-
Almasi, G.S. and A. Gottlieb (1989). Highly Parallel Computing. Benjamin-Cummings publishers, Redwood City, CA.
-
Hillis, W. Daniel and Steele, Guy L., Data Parallel Algorithms Communications of the ACM December 1986
-
Quinn Michael J, Parallel Programming in C with MPI and OpenMP McGraw-Hill Inc. 2004. ISBN 0-07-058201-7
-
IEEE Journal of Solid-State Circuits:"A Programmable 512 GOPS Stream Processor for Signal, Image, and Video Processing", Stanford University and Stream Processors, Inc.
-
Barney, Blaise. "Introduction to Parallel Computing". Lawrence Livermore National Laboratory.
-
http://www.llnl.gov/computing/tutorials/parallel_comp/. Retrieved 2007-11-09
-
Quinn Michael J, Parallel Programming in C with MPI and OpenMP McGraw-Hill Inc. 2004. ISBN 0-07-058201-7.
-
Albert Y.H. Zomaya, Parallel and distributed Computing Handbook, McGraw-Hill Series on Computing Engineering, New York (1996).
-
Ernst L. Leiss, Parallel and Vector Computing A practical Introduction, McGraw-Hill Series on Computer Engineering, New York (1995).
-
Vipin Kumar, Ananth Grama, Anshul Gupta, George Karypis, Introduction to Parallel Computing, Design and Analysis of Algorithms, Redwood City, CA, Benjmann / Cummings (1994).
|
| |
|
|
|
|
