The GME problem is an interesting generalization of the mutual exclusion problems. A few solutions of the GME problem have been studied for message passing distributed systems. However, none of these solutions is totally suitable for the real-time distributed systems. In this paper, we propose a new algorithm for the GME problem in the real-time distributed systems based on Token. The algorithm uses the concepts of priority queue, dynamic request set and the process state. The algorithm uses the approach in which first come first serve in selecting the next session type between the same priority levels and satisfies the concurrent occupancy property. The algorithm allows all n processors to be inside their CS provided they request for the same session. The performance analysis and correctness proof of the algorithm has also been included in the paper.
展开▼
