Please use this identifier to cite or link to this item:
http://hdl.handle.net/10603/228266
Title: | Development of Some Load Distribution Algorithm in Distributed Processing System |
Researcher: | Gupta Ruchi |
Guide(s): | YadavPradeep Kumar |
Keywords: | Distributed computing, Task Allocation, Module distribution, Execution Cost, Communication Cost, Task Size, Fuzzy Logic, Load balancing, Task Clustering, Router, Switch, Fault tree Analysis, Serial connection, IP Address, System Reliable, Ethernet, System reliability, Greedy Algorithm, Processing time, Fault Tolerance, Optimal Time, Network. Engineering and Technology,Computer Science,Computer Science Information Systems |
University: | Uttarakhand Technical University |
Completed Date: | 26-9-2017 |
Abstract: | First Chapter of the thesis is devoted to the basic know, how and development stages of DPS includes an introduction part and the techniques available for Load Distribution, with their performances, approached comparatively. A full survey of different work allocation approaches available in the literature is reported in Chapter 2. Chapter 3 aims at developing a task allocation policy for balance utilization of available resources in distributed computing environment. The purpose of the problem is to set a new processor with a set of m module to obtain an optimum consumption of available processors. We would be assigned to reduce execution costs and the odds of reducing communication and make the best use of the total throughput and the system has been adjusted well to load all the processors that this way in control. In Chapter 4, we presented a fuzzy based clustering method for performance emulation distributed processing system. The membership function is formulated which lies between 0 1, then we categorized the processor and task in four categories, based on their membership values by using the MATLAB, MAMDANI inference engine. In Chapter 5, Provide a system consisting of a set of processors connected with the router and switch. Thus, whatever the complexity of a distributed system must be a reliable transmission. The genuineness of the system is established through its simulation on Boson Netsim followed by FTA for reliability evaluation. In Chapter 6, using locally optimal choice method for the task allocation model in distributed computing. The current problem reduces the total process time of a distributed system in excess of allocation of the jobs of many processors of the system. The algorithm based on a start time and end of task on each processor, which represents the ideal computation time of execution of tasks on processors and that affected by the ITCC. Chapter 7 concludes the thesis and propose other issues which require further investigation and potential research expansion. newline newline newline |
Pagination: | 144 Pages |
URI: | http://hdl.handle.net/10603/228266 |
Appears in Departments: | Department of Computer Science and Engineering |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
01-title page.pdf | Attached File | 86.73 kB | Adobe PDF | View/Open |
02 - certificate.pdf | 196.41 kB | Adobe PDF | View/Open | |
03- table of contents.pdf | 25.61 kB | Adobe PDF | View/Open | |
04- list of tables.pdf | 77.95 kB | Adobe PDF | View/Open | |
05-list of figures.pdf | 81.62 kB | Adobe PDF | View/Open | |
06-acknowledgement.pdf | 51.3 kB | Adobe PDF | View/Open | |
07-chapter 1.pdf | 726.45 kB | Adobe PDF | View/Open | |
08 - chapter 2.pdf | 295.67 kB | Adobe PDF | View/Open | |
09 - chapter 3.pdf | 557.16 kB | Adobe PDF | View/Open | |
10- chapter 4.pdf | 443.02 kB | Adobe PDF | View/Open | |
11- chapter 5.pdf | 535.1 kB | Adobe PDF | View/Open | |
12 - chapter 6.pdf | 540.25 kB | Adobe PDF | View/Open | |
13 - chapter 7.pdf | 99.65 kB | Adobe PDF | View/Open | |
14- publication.pdf | 139.75 kB | Adobe PDF | View/Open | |
15- reference.pdf | 183.06 kB | Adobe PDF | View/Open |
Items in Shodhganga are licensed under Creative Commons Licence Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0).
Altmetric Badge: