### Python 实现哲学家就餐问题 #### 方案一：使用 `threading` 和 `Lock` 通过引入锁机制来防止多个线程同时访问共享资源，从而避免死锁的发生。 ```python import threading import time import random class Philosopher(threading.Thread): running = True def __init__(self, index, forkOnLeft, forkOnRight): threading.Thread.__init__(self) self.index = index self.forkOnLeft = forkOnLeft self.forkOnRight = forkOnRight def run(self): while self.running: time.sleep(random.uniform(3, 13)) print(f'Philosopher {self.index} is hungry.') eat(self) def eat(philosopher: Philosopher): fork1, fork2 = philosopher.forkOnLeft, philosopher.forkOnRight while philosopher.running: fork1.acquire(True) locked = fork2.acquire(False) if locked: break fork1.release() print(f'Philosopher {philosopher.index} swaps forks') fork1, fork2 = fork2, fork1 else: return philosopher.dining() fork2.release() fork1.release() def dining(philosopher: Philosopher): print(f'Philosopher {philosopher.index} starts eating.') time.sleep(random.uniform(1, 10)) print(f'Philosopher {philosopher.index} finishes eating and leaves to think.') forks = [threading.Lock() for n in range(5)] philosophers= [Philosopher(i, forks[i%5], forks[(i+1)%5]) \ for i in range(5)] random.seed(1298746) Philosopher.running = True for p in philosophers: p.start() time.sleep(100) Philosopher.running = False print("Now we're finishing.") ``` [^1] 此代码创建了一个模拟环境，在这个环境中五个哲学家尝试获取左右两边的筷子（即锁），只有当两个锁都被成功获得时才会进入用餐状态；否则会释放已经拿到的一个锁，并交换顺序再次尝试。这有效地减少了发生死锁的可能性。 #### 方案二：奇偶数策略 另一种常见的解决方案是采用奇偶数策略，让编号为奇数的哲学家用左手边的筷子先于右手边的，而偶数则相反。这种方法能够确保至少有一个哲学家总是能顺利拿取到两根筷子而不造成循环等待。 ```python from threading import Thread, Lock import time num_philosophers = 5 chopsticks = [Lock() for _ in range(num_philosophers)] def philosopher(id): while True: think(id) if id % 2 == 0: first_chopstick = chopsticks[id] second_chopstick = chopsticks[(id + 1) % num_philosophers] else: first_chopstick = chopsticks[(id + 1) % num_philosophers] second_chopstick = chopsticks[id] with first_chopstick: with second_chopstick: eat(id) def think(id): print(f"Philosopher{id}: Thinking...") time.sleep(1) def eat(id): print(f"Philosopher{id}: Eating...") threads = [] for i in range(num_philosophers): t = Thread(target=philosopher, args=(i,)) threads.append(t) t.start() for thread in threads: thread.join() ``` [^2] 在这个版本里，每个哲学家的行为被定义在一个无限循环内——先是思考再试图进食。对于奇数编号者来说，他们会优先取得左侧的筷子然后再去争取右侧的那个；反之亦然。这样的安排打破了可能形成的环形依赖链表结构，进而预防了潜在的死锁定态。