0
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
Still curious? Ask our experts.
Chat with our AI personalities
Devin
Vivi
JordanAdd your answer:
Earn +20 pts
What is the difference between AES Rijndael symmetric algorithm encryption and a hash algorithm?
678
What is difference between lemma and algorithm?
A Method that used to be a comouter to soultion of promlems is called algorithm.
Difference between Bresenham and midpoint circle drawing algorithm?
what is difference between mid-point and bresenhams circle algorithm what is difference between mid-point and bresenhams circle algorithm bresenhams circle algorithm results in a much more smoother circle,comparred to midpoint circle algorithm..In mid point,decision parameter depends on previous decision parameter and corresponding pixels whereas in bresenham decision parameter only depends on previous decision parameter...
What is the difference between advanced encryption algorithm and encryption algorithm?
People have developed many encryption algorithms. One particular encryption algorithm is the Rijndael algorithm, usually called the AES or Advanced Encryption Standard.
What are the difference between greedy algorithm and dynamic programing?
A greedy algorithm is similar to a dynamic programming algorithm, but the difference is that solutions to the subproblems do not have to be known at each stage; instead a "greedy" choice can be made of what looks best for the moment.
