中山大学操作系统课件ch6.pptVIP

* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * 有两组并发进程：读者和写者，共享一个文件F，要求： 任意多个读者可以同时读文件； 一次只有一个写进程可以往文件中写； 写进程执行写操作前，则禁止任何读进程读文件； 读者 写者 一个文件 Readers-Writers Problem 问题：在计算机系统中当若干个并发进程都要访问某个共享文件时应区分是读还是写。 允许多个进程同时读文件（读－读允许）； 不允许在进程读文件时让另外一进程去写文件；有进程在写文件时不让另外一个进程去读该文件（“读-写”互斥）； 更不允许多个写进程同时写同一文件（“写-写”互斥）。 因此读-写进程之间关系为：“读-写”互斥、和“读-读”允许。 Readers-Writers Problem Readers-Writers Problem 读者优先：当存在读者时，写操作将被延迟，并且只要有一个读者活跃，随后而来的读者都将被允许访问文件。从而，导致了写进程长时间等待，并有可能出现写进程被饿死。 Readers-Writers Problem 实际的系统为写者优先：即当有进程在读文件时，如果有进程请求写，那么新的读进程被拒绝，待现有的读者完成读操作后，立即让写者运行，只有当无写者工作时，才让读者工作。 Readers-Writers Problem A data set is shared among a number of concurrent processes Readers – only read the data set; they do not perform any updates Writers – can both read and write. Problem – allow multiple readers to read at the same time. Only one single writer can access the shared data at the same time. Shared Data Data set Semaphore mutex initialized to 1. Semaphore db initialized to 1. Integer readerCount initialized to 0. Readers-Writers Problem wait(wrt); … writing is performed … signal(wrt); Writer Process wait(mutex); readcount++; if (readcount == 1) wait(wrt); signal(mutex); … reading is performed … wait(mutex); readcount--; if (readcount == 0) signal(wrt); signal(mutex): Reader Process Shared datasemaphore mutex, wrt;Initiallymutex = 1, wrt = 1, readcount = 0 Readers-Writers Problem Shared data Bowl of rice (data set) Semaphore chopStick [5] initialized to 1 Philosopher i: do { wait(chopstick[i]) wait(chopstick[(i+1) % 5]) … eat … signal(chopstick[i]); signal(chopstick[(i+1) % 5]); … think … } while (1); Dining-Philosophers Problem Solution to Dining Philosophers A high-level abstraction that provides a convenient and effective mechanism for process synchronization Only one process may be active within the monitor at a time monitor monitor-name { // shared variable declarations procedure P1 (…) { …. } …