Please use this identifier to cite or link to this item: http://hdl.handle.net/10603/17294
Title: Delay optimal mutual exclusion algorithms in distributed systems
Researcher: Gupta, Sangita
Guide(s): Saxena, P.C
Keywords: distributed systems
Delay optimal mutual exclusion
algorithms
Upload Date: 10-Mar-2014
University: Jawaharlal Nehru University
Completed Date: 1998
Abstract: Driven by technological advances as well as user needs, the field of distributed newlinecomputing is a natural evolution in computing history. With the distribution of control newlineover many widely seperated sites, the problem of deadlocks, resource allocation, mutual newlineexclusion etc., become much more complicated and require quite a different approach to newlinesolve them than in the traditional Centralised Systems. The problem of mutual exclusion newlinein a Distributed System becomes very complex because at a given site there is only a newlinepartial view of the total system and the ordering of events at any specific site is only newlinetemporal due to lack of global clock. Due to the lack of consistency in viewing the newlinesystem by different sites, it is necessary to communicate with all the sites in the system newlinebefore a site decides to enter the Critical Section (CS). This problem becomes further newlinecomplex due to unpredictable communication delays, site or communication link failures. newlineThis thesis deals with the development of Delay-Optimal mutual exclusion algorithms in newlinedistributed systems. newlineThe effect of varying the degree of connectivity of the network topology on logical newlinestructure token based mutual exclusion algorithms is studied and a detailed performance newlinecomparison is done. A new delay optimal token based algorithm is presented. A newlineperformance comparison is made with existing token based algorithms and shown how newlinethe proposed algorithm acheives lower time delay. Further, two existing algorithms are newlinemodified to achieve better delay performance. Priority serialization discipline like newlineShortest Job First (SJF) leads to improvement in response time ( Delay) as compared to newlineFCFS serialization. Therefore, a general scheme for inserting priority serialization in newlinetoken and tree based algorithms is developed. A new Broadcast based - Token based newlinealgorithm is also proposed which supports priority serialization.
Pagination: p.
URI: http://hdl.handle.net/10603/17294
Appears in Departments:School of Computer and System Science

Files in This Item:
File Description SizeFormat 
01_title.pdfAttached File56.78 kBAdobe PDFView/Open
02_certificate.pdf78.23 kBAdobe PDFView/Open
03_dedication.pdf92.76 kBAdobe PDFView/Open
04_acknowledgements.pdf114.19 kBAdobe PDFView/Open
05_abstract.pdf86.88 kBAdobe PDFView/Open
06_contents.pdf145.62 kBAdobe PDFView/Open
07_chapter 1.pdf788.82 kBAdobe PDFView/Open
08_chapter 2.pdf737.79 kBAdobe PDFView/Open
09_chapter 3.pdf1.19 MBAdobe PDFView/Open
10_chapter 4.pdf1.02 MBAdobe PDFView/Open
11_chapter 5.pdf203.32 kBAdobe PDFView/Open
12_bibliography.pdf427.77 kBAdobe PDFView/Open
13_appendices.pdf335.53 kBAdobe PDFView/Open


Items in Shodhganga are protected by copyright, with all rights reserved, unless otherwise indicated.