▁to ▁become ▁critical . ▁ ▁Process es ▁without ▁priority ▁will ▁withdraw ▁their ▁intention ▁to ▁enter ▁the ▁critical ▁section ▁until ▁they ▁are ▁given ▁priority ▁again ▁( the ▁inner ▁while ▁loop ). ▁ ▁Process es ▁with ▁priority ▁will ▁break ▁from ▁the ▁while ▁loop ▁and ▁enter ▁their ▁critical ▁section . ▁ ▁De k ker ' s ▁algorithm ▁guarante es ▁mut ual ▁ex clusion , ▁freedom ▁from ▁dead lock , ▁and ▁freedom ▁from ▁star v ation . ▁Let ▁us ▁see ▁why ▁the ▁last ▁property ▁holds . ▁Suppose ▁p 0 ▁is ▁stuck ▁inside ▁the ▁" while ▁wants _ to _ enter [ 1 ]" ▁loop ▁forever . ▁There ▁is ▁freedom ▁from ▁dead lock , ▁so ▁eventually ▁p 1 ▁will ▁proceed ▁to ▁its ▁critical ▁section ▁and ▁set ▁turn ▁= ▁ 0 ▁( and ▁the ▁value ▁of ▁turn ▁will ▁remain ▁un changed ▁as ▁long ▁as ▁p 0 ▁doesn ' t ▁progress ). ▁Event ually ▁p 0 ▁will ▁break ▁out ▁of ▁the ▁inner ▁" while ▁turn ▁ ≠ ▁ 0 " ▁loop ▁( if ▁it ▁was ▁ever ▁stuck ▁on ▁it ). ▁After ▁that ▁it ▁will ▁set ▁wants _ to _ enter [ 0 ] ▁to ▁true ▁and ▁sett le ▁down ▁to ▁waiting ▁for ▁wants _ to _ enter [ 1 ] ▁to ▁become ▁false ▁( since ▁turn ▁= ▁ 0 , ▁it ▁will ▁never ▁do ▁the ▁actions ▁in ▁the ▁while ▁loop ). ▁The ▁next ▁time ▁p 1 ▁tries ▁to ▁enter ▁its ▁critical ▁section , ▁it ▁will ▁be ▁forced ▁to ▁execute ▁the ▁actions ▁in ▁its ▁" while ▁wants _ to _ enter