[ 0 ]" ▁loop . ▁In ▁particular , ▁it ▁will ▁eventually ▁set ▁wants _ to _ enter [ 1 ] ▁to ▁false ▁and ▁get ▁stuck ▁in ▁the ▁" while ▁turn ▁ ≠ ▁ 1 " ▁loop ▁( since ▁turn ▁remains ▁ 0 ). ▁The ▁next ▁time ▁control ▁passes ▁to ▁p 0 , ▁it ▁will ▁exit ▁the ▁" while ▁wants _ to _ enter [ 1 ]" ▁loop ▁and ▁enter ▁its ▁critical ▁section . ▁ ▁If ▁the ▁algorithm ▁were ▁modified ▁by ▁performing ▁the ▁actions ▁in ▁the ▁" while ▁wants _ to _ enter [ 1 ]" ▁loop ▁without ▁checking ▁if ▁turn ▁= ▁ 0 , ▁then ▁there ▁is ▁a ▁possibility ▁of ▁star v ation . ▁Thus ▁all ▁the ▁steps ▁in ▁the ▁algorithm ▁are ▁necessary . ▁ ▁Notes ▁ ▁One ▁advantage ▁of ▁this ▁algorithm ▁is ▁that ▁it ▁doesn ' t ▁require ▁special ▁test - and - set ▁( atomic ▁read / mod ify / write ) ▁instructions ▁and ▁is ▁therefore ▁highly ▁port able ▁between ▁languages ▁and ▁machine ▁architect ures . ▁ ▁One ▁dis adv antage ▁is ▁that ▁it ▁is ▁limited ▁to ▁two ▁processes ▁and ▁makes ▁use ▁of ▁busy ▁waiting ▁instead ▁of ▁process ▁susp ension . ▁ ▁( The ▁use ▁of ▁busy ▁waiting ▁suggests ▁that ▁processes ▁should ▁spend ▁a ▁minimum ▁amount ▁of ▁time ▁inside ▁the ▁critical ▁section .) ▁ ▁Modern ▁operating ▁systems ▁provide ▁mut ual ▁ex clusion ▁primit ives ▁that ▁are ▁more ▁general ▁and ▁flexible ▁than ▁De k ker ' s ▁algorithm . ▁ ▁However , ▁in ▁the ▁absence ▁of ▁actual ▁cont ention ▁between ▁the ▁two