408
文章平均质量分 51
* 3
这个作者很懒,什么都没留下…
展开
-
【待解决疑惑】wd OS 2.3 进程同步 大题24(19年真题)
书上的解法是用碗的数量来做互斥信号量,最多n-1个人等待拿筷子,即使都拿起来了一根筷子,还剩下一根筷子会使得他们可以吃饭。semaphore bowl = min(n - 1, m);semaphore chopsticks[n] = {1};CoBeginPhilosopher_i() { while(1) { think; P(bowl); P(chopsticks[i]); P(chopsticks[(i + 1) % n]); eat; V(chopsticks[原创 2021-09-17 15:04:15 · 68 阅读 · 0 评论 -
408wd os 2.3 进程同步 notes
笔记而已do { entry section; critical section; exit section; remainder section;} while(true)同步空闲让进忙则等待有限等待让权等待软件实现方法单标志法P0:while(turn != 0);critical section;turn = 1;remainder section;P1:while(turn != 1);critical section;turn = 0.原创 2021-09-16 18:29:26 · 98 阅读 · 0 评论