OS经典进程同步问题

生产者消费者问题

---

int in, out;
item buffer[n];
semaphore mutex = 1, empty = n, full = 0;

void producer()//生产者
{
	while(true)
	{
		wait(empty);//判断是否可以往里放
		wait(mutex);//互斥信号量,进入缓冲区其它不能进入 
		buffer[in] = nextp;//往里写 
		in = (in + 1) % n;
		signal(mutex);
		signal(full); 
	} 
}

void consumer()//消费者
{
	while(true)
	{
		wait(full);//判断是否可以取
		wait(mutex);//互斥信号量,进入缓冲区其它不能进入 
		nextc = buffer[out];//取 
		out = (out + 1) % n;
		signal(mutex);
		signal(empty); 
	}
}

哲学家进餐问题

---

semaphore chopstick[5] = {1, 1, 1, 1, 1};//临界资源构成信号量数组 
semaphore mutex = 1;

void philosopher(int i)
{
	while(true)
	{
		think();//思考 
		wait(mutex);//互斥信号量，对取左侧和右侧筷子进行保护 
		wait(chopstick[i]);
		wait(chopstick[(i + 1) % n]);
		signal(mutex);
		eat();
		signal(chopstick[i]);
		signal(chopstick[(i + 1) % n]);
		think();
	}
}

读者写者问题

---

semaphore rmutex = 1, wmutex = 1;
int readcount = 0;

void reader()
{
	while(true)
	{
		wait(rmutex);//读进程间进行互斥 
		if(readcount == 0) wait(wmutex);//第一个读进程负责"加锁" 
		readcount ++;
		signal(rmutex);
		
		wait(rmutex);
		readcount --;
		if(readcount == 0) signal(wmutex);//最后一个读进程负责"解锁" 
		signal(rmutex);
	}
}

void writer()
{
	while(true)
	{
		wait(wmutex);
		//写操作...
		signal(wmutex);
	}
}