| 基于Java多线程机制解决哲学家进餐问题的深入探究 |
| |
| 引用本文： | 李金忠,夏洁武.基于Java多线程机制解决哲学家进餐问题的深入探究[J].井冈山学院学报,2007,28(6):49-52. |
| |
| 作者姓名： | 李金忠 夏洁武 |
| |
| 作者单位： | 井冈山学院信息科学与传媒学院 江西吉安343009 |
| |
| 摘 要： | 简要阐述了操作系统中哲学家进餐这个经典同步问题,探讨了该问题的多种解决策略,并通过Java语言的多线程编程技术,给出了实现此问题相应解决策略的代码,有效地避免了饥饿和死锁现象的产生。
|
| 关 键 词： | 多线程 哲学家进餐问题 同步 死锁 饥饿 |
| 文章编号： | 1673-4718(2007)06-0049-04 |
| 修稿时间： | 2007年2月12日 |
A deep research for solving the dining philosophers problem based on the mechanism of multithreading in java |
| |
| LI Jin-zhong,XIA Jie-wu.A deep research for solving the dining philosophers problem based on the mechanism of multithreading in java[J].Journal of Jinggangshan University,2007,28(6):49-52. |
| |
| Authors: | LI Jin-zhong XIA Jie-wu |
| |
| Abstract: | The paper briefly states the classic synchronization problem of the dining philosophers in operating system.It proposes many strategic solutions of the problem,and offeres corresponding strategic solutions' code to implement this problem through programming technology of multithreading in java language,which effectively avoids producing phenomena of deadlock and starvation. |
| |
| Keywords: | multithreading the dining philosophers problem synchronized deadlock starvation |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
