bool flag[2] = {false};
int turn=0;
void P0 () //进程P0 {
while (1){
flag[0] = true;
turn = 0;
While (flag[1] && (turn == 0))//判断别人flag自己turn
临界区;
flag[0] = false;
}
}
void P1 () //进程P1 {
while (1){
flag[1] = true;
turn = 1;
While (flag[0] && (turn == 1))
临界区;
flag[1]=false;
}
}
Peterson算法-软件实现进程(线程互斥)
最新推荐文章于 2024-12-20 23:58:16 发布