One Article Review
| Source |  CodingSec |
|---|---|
| Identifiant | 3709 |
| Date de publication | 2016-07-06 18:00:20 (vue: 2016-07-06 18:00:20) |
| Titre | What is peterson’s algorithm?? How does it provide mutual exclusion?? |
| Texte | Problem: Given 2 process i and j, you need to write a program that can guarantee mutual exclusion between the two without any additional hardware support. Solution: There can be multiple ways to solve this problem, but most of them require additional hardware support. The simplest and the most popular way to do this is by using Peterson Algorithm for mutual Exclusion. It was developed by Peterson in 1981 though the initial work in this direction by done by Theodorus Jozef Dekker who came up with Dekker's algorithm in 1960, which was later refined by Peterson and came to be |
| Envoyé | Oui |
| Condensat | 1960 1981 additional algorithm any appeared between but came can coding dekker developed direction does done exclusion first given guarantee hardware how initial jozef later most multiple mutual need peterson peterson’s popular post problem problem: process program provide refined require security simplest solution: solve support them theodorus though two using way ways what which who without work write |
| Tags | |
| Stories | |
| Notes | |
| Move | 
|
L'article ne semble pas avoir été repris aprés sa publication.
L'article ne semble pas avoir été repris sur un précédent.