| 利用Java高级别并发对象求解哲学家进餐问题 |
| |
| 引用本文： | 詹劲松.利用Java高级别并发对象求解哲学家进餐问题[J].佳木斯工学院学报,2013(6):905-907. |
| |
| 作者姓名： | 詹劲松 |
| |
| 作者单位： | 福建师范大学福清分校数学与计算机科学系,福建福清350300 |
| |
| 摘 要： | 介绍了利用Java高级别并发对象求解哲学家进餐问题死锁预防的一种方法，并和我们过去的方法进行了比较，结果表明新方法的效率有所提高．
|
| 关 键 词： | 高级别并发对象 哲学家进餐问题 死锁预防 |
A Solution for Dining -philosophers Problem with Java High Level Concurrency Objects |
| |
| Affiliation: | ZHAN Jin - song (Department of Mathematics and Computer Science, Fuqing Branch, Fujian Normal University, Fuqing 350300, China) |
| |
| Abstract: | currency objects efficiency of the A solution for deadlock prevention of dining - philosophers problem with Java high level con- was introduced. This solution was compared with our former solution. The result shows that the new solution is improved. |
| |
| Keywords: | high level concurrency object dining -philosophers problem deadlock prevention |
| 本文献已被 维普 等数据库收录！ |
