Simulation of Task Scheduling for Cluster Computing on one Two and three Processor Systems Using PVM.

Date of Submission

December 1998

Date of Award

Winter 12-12-1999

Institute Name (Publisher)

Indian Statistical Institute

Document Type

Master's Dissertation

Degree Name

Master of Technology

Subject Name

Computer Science

Department

Advance Computing and Microelectronics Unit (ACMU-Kolkata)

Supervisor

Sinha, Bhabani Prasad (ACMU-Kolkata; ISI)

Abstract (Summary of the Work)

With the increased global competition and noced for faster and efficient processing, a high demand for parallel computation is creatod. Even with the most sophisticated technology available so far, a parallel processing system usually involves a large investment. Also there is a need for efficient software support which makes parallel processing user-friendly.A recent trend is to use Cluster Computing which involves computing on a set of workstations, which are interconnected in the form of a high speod net. This type of network facilitates the access of available resources from different sites connected in the network.The present dissertatkon was mainly focussed on simularlon of interconnection patterns for a Heterogeneous Network of Workstations on single, double andtriple processors. To improve thinto which e efficiency of execution, optimum number of tasks a problem is to be divided, is identified for a given number of proccssors. All the tasks are distributed equally among the processors to ensure that all the processors comple excution at around the sume time for effective utilization of resources. Then taking the load ( mumber of ready processes ) on cach processor into consideration, the tasks are distributed among the processors, to further fasten the execution by giving more number of processes to the machine which has lesser load.PVM soltware enviroement was used to study various operations on matrices on different types of Einterconnection paterns. The interesting results observed during this study were reported

Comments

ProQuest Collection ID: http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqm&rft_dat=xri:pqdiss:28843276

Control Number

ISI-DISS-1998-57

Creative Commons License

Creative Commons Attribution 4.0 International License
This work is licensed under a Creative Commons Attribution 4.0 International License.

DOI

http://dspace.isical.ac.in:8080/jspui/handle/10263/6230

This document is currently not available here.

Share

COinS