answersLogoWhite

0

AllQ&AStudy Guides
Best answer

Dekker algorithm has much more complex code with higher efficiency, while Peterson has simpler code. Imran

Dekker algorithm has also the disadvantage of being not expendable (maximum 2 processes mutual exclusion, while Peterson can be extended for more then 2 processes.

more info here:

http://en.wikipedia.org/wiki/Peterson%27s_algorithm#The_Algorithm_for_more_then_2_processes

This answer is:
Related answers

Dekker algorithm has much more complex code with higher efficiency, while Peterson has simpler code. Imran

Dekker algorithm has also the disadvantage of being not expendable (maximum 2 processes mutual exclusion, while Peterson can be extended for more then 2 processes.

more info here:

http://en.wikipedia.org/wiki/Peterson%27s_algorithm#The_Algorithm_for_more_then_2_processes

View page

Carl Dekker has written:

'Woman in marble' -- subject(s): Accessible book

View page

W. Dekker has written:

'Afwezigheid van God' -- subject(s): Hidden God

View page

Yes Petersons algo satisfies Mutual exclusion, Progress and bonded waiting and is more efficient than Dekker's algo.

View page

Adrianus J. Dekker has written:

'Electrical engineering materials' -- subject(s): Electric engineering, Materials

View page
Featured study guide

Let’s say you have 150x6 for example. What is a way to multiply those numbers without skip counting

What should you subtract to get 8

What is 90x2

➑️
See all cards
5.0
β˜†β˜…β˜†β˜…β˜†β˜…β˜†β˜…β˜†β˜…
1 Review
More study guides
4.38
β˜†β˜…β˜†β˜…β˜†β˜…β˜†β˜…β˜†β˜…
8 Reviews

β˜†β˜…β˜†β˜…β˜†β˜…β˜†β˜…β˜†β˜…
No Reviews
Search results