恐龍八版exercises 6.1題
do
{
flag[i] = TRUE;
while(flag[j])
{
if(turn==j)
{
flag[i] = false;
while(turn == j) { };
flag[i] = true;
}
}
CS
turn = j;
flag[i] = false;
}while(TRUE);
這題要證mutual exclusion, progress, bound waiting都成立
請問這應該怎麼證?
謝謝
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 61.228.28.28