This website requires Javascript to function properly. Please go to the setting of your web browser and enable Javascript for this website.
×
Loading...
Close
Home
Share
hold 叉子是 exclusive lock,
**🐪
先到先得,而且有queue排队等待。得到一个叉子的Lock 后再等下一个叉子的lock,用完放下 (release lock). 后台有进程监视deadlock 杀掉其中一个,这是数据库的解决方案。五个哲学家是个例可以有更优化的算法。我这么理解对吗?另外这跟离散数学有关系吗
Full Story:
https://en.wikipedia.org/wiki/Dining_philosophers_problem
(#15572409@0)
Last Updated: 2023-7-26
Sign in and Reply
Share
Report
Replies, comments and Discussions:
离散数学和线性代数这两门课我是逃课过来的,现在一点印象没有了,哪位好心人给我补补课做IT没这俩门课我损失了什么?
枫下论坛主坛
/
工作学习
/
学科技术