Aasim Khurshid

Mutual Exclusion Algorithms

Research, Simulation & Provision of an efficient algorithm

• Broschiertes Buch

Produktbeschreibung

Multiprocessing systems are programmed cleanly using Critical sections. When a process desires to access some shared data it first gets mutual exclusive access to critical sections for reliable outcome as processes may possibly manipulate the data. This work investigates how critical section problem can be solved easily and efficiently for multiprocessing and distributed systems. This report presents an algorithm that can solve the problem in single processing, multiprocessing and distributed systems efficiently with minimal changes. For distributed systems we introduce message passing service while keeping rest of the mechanism same works faster than many other algorithms for distributed systems. The algorithm compares its efficiency with bakery s algorithm and performs much better with the liberty of introduction of multiple critical sections for dissimilar shared data. Due to this multiple processes can execute in different critical sections concurrently.

Produktdetails

• Verlag: LAP Lambert Academic Publishing
• Aufl.
• Seitenzahl: 68
• Erscheinungstermin: 9. Juli 2012
• Englisch
• Abmessung: 220mm x 150mm x 5mm
• Gewicht: 119g
• ISBN-13: 9783659179389
• ISBN-10: 3659179388
• Artikelnr.: 36133446

Autorenporträt

Aasim khurshid holds a degree of MS in software engineering from University of Engineering and Technology, Taxila Pakistan. He completed his bachelor in Computer software engineering in 2008 from NWFP University of Engineering & Technology, Peshawar, Pakistan. Currently working as Lecturer in computer science in Computer science department of Govt.