进程同步经典问题_同步的经典问题

最新推荐文章于 2024-02-04 20:29:32 发布

cunfen6312

最新推荐文章于 2024-02-04 20:29:32 发布

阅读量201

点赞数

文章标签： python linux java 操作系统机器学习

版权

进程同步经典问题

In this tutorial we will discuss about various classic problem of synchronization.

在本教程中，我们将讨论各种经典的同步问题。

Semaphore can be used in other synchronization problems besides Mutual Exclusion.

信号量可用于互斥之外的其他同步问题中。

Below are some of the classical problem depicting flaws of process synchronaization in systems where cooperating processes are present.

以下是一些经典问题，它们描述了存在协作流程的系统中流程同步的缺陷。

We will discuss the following three problems:

我们将讨论以下三个问题：

This problem is generalised in terms of the Producer Consumer problem, where a finite buffer pool is used to exchange messages between producer and consumer processes.
这个问题是根据生产者消费者问题来概括的，在该问题中 ， 有限的缓冲池用于在生产者和消费者进程之间交换消息。
Because the buffer pool has a maximum size, this problem is often called the Bounded buffer problem.

因为缓冲池具有最大大小，所以此问题通常称为有界缓冲区问题 。
Solution to this problem is, creating two counting semaphores "full" and "empty" to keep track of the current number of full and empty buffers respectively.
解决此问题的方法是，创建两个计数信号量“ full”和“ empty”以分别跟踪当前的缓冲区数量。

The dining philosopher's problem involves the allocation of limited resources to a group of processes in a deadlock-free and starvation-free manner.
饮食哲学家的问题涉及以无死锁和无饥饿的方式将有限的资源分配给一组进程。
There are five philosophers sitting around a table, in which there are five chopsticks/forks kept beside them and a bowl of rice in the centre, When a philosopher wants to eat, he uses two chopsticks - one from their left and one from their right. When a philosopher wants to think, he keeps down both chopsticks at their original place.
桌子周围有五位哲学家，旁边放着五把筷子/叉子，中间有一碗饭。当一位哲学家想吃饭时，他用两把筷子-一只在左边，另一只在右边。。当一个哲学家想思考的时候，他把两把筷子都放在原来的地方。

In this problem there are some processes(called readers) that only read the shared data, and never change it, and there are other processes(called writers) who may change the data in addition to reading, or instead of reading it.
在这个问题中，有一些进程(称为readers )仅读取共享数据，而从不更改它，还有其他进程(称为writers )除了读取或代替读取数据之外，还可能更改数据。
There are various type of readers-writers problem, most centred on relative priorities of readers and writers.
存在各种类型的读者-作家问题，其中大多数集中在读者和作家的相对优先级上。