用Dekker算法实现两个进程间的互斥

Use the Dekker algorithm to realize mutual exclusion between two processes

进程并发是操作系统设计中的基础性问题,而进程的互斥则是进程并发执行的最基本需求.笔者对用于实现互斥的Dekker算法进行了详细的分析,对算法进行了升级,提出了算法中存在的若干问题,提出了问题出现的根本原因,据此提出了解决问题的具体方案,并最终给出了一个改进的实现两个进程间互斥的算法.

process concurrence is the fundamental problem when the operating system is designed. process mutual exclusion is the most basic demand for enforce process concurrence. The thesis makes a particular analysis to Dekker algorithm and upgrades the algorithm. The paper finds several problems of the algorithm and analyzes the ultimate causes. At last the thesis proposes the scheme of solving problems and a correct algorithm for enforce process concurrence.