MENÜ MENÜ
  • Sie verwenden einen veralteten Webbrowser, weshalb es zu Problemen mit der Darstellung kommen kann. Bei Problemen mit der Bestellabgabe können Sie gerne auch telefonisch bestellen unter: 01805 / 30 99 99 (0,14 €/Min., Mobil max. 0,42 €/Min.)

Mutual Exclusion Algorithms

Khurshid:Mutual Exclusion Algorithms
Autor: Aasim Khurshid
Verfügbarkeit: nur noch 3 lieferbar
Artikelnummer: 780273
ISBN / EAN: 9783659179389

Verfügbarkeit: sofort lieferbar

49,00
Inkl. MwSt. , zzgl. Versandkosten

Zusatzinformation

  • Autor:
  • Verlag: LAP Lambert Academic Publishing
  • ISBN / EAN: 9783659179389
  • Bindung: Taschenbuch

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.

0 Kundenmeinungen

Bitte schreiben Sie uns Ihre Meinung zu: Mutual Exclusion Algorithms

Sie könnten auch an folgenden Produkten interessiert sein