An Deadlock-free Distributed Mutual Exclusion Algorithm For Sharing Diverse Resources
碩士 === 大同工學院 === 資訊工程研究所 === 81 === It is very important to keep data consistence, reduce task res- pond time and improve resource utilization in distributed system. Therefore, the distributed mutual exclusion is a very critical problem. Th...
Main Authors: | Fwu-Song Jih, 紀福松 |
---|---|
Other Authors: | Jin-Cherng Lin |
Format: | Others |
Language: | en_US |
Published: |
1993
|
Online Access: | http://ndltd.ncl.edu.tw/handle/70166155859186664962 |
Similar Items
-
Design of a Mutual Exclusion and Deadlock Algorithm in PCBSD – FreeBSD
by: Libertad Caicedo Acosta, et al.
Published: (2014-12-01) -
Priority Mutual Exclusion Algorithms for Shared-Memory Multiprocessor Systems
by: Yu-Cheng Lu, et al.
Published: (1994) -
Efficient Mutual Exclusion Algorithms for Shared-Memory Multiprocessor Systems
by: Shin-Chih Hsu, et al.
Published: (1995) -
Deadlock free algorithmic parallelism : analysis, implementation and performance
by: Simpson, D. P.
Published: (2003) -
A distributed algorithm for detecting generalized deadlocks
by: WANG,JIAN-WEN, et al.
Published: (1990)