DocumentCode :
2635043
Title :
Notice of Violation of IEEE Publication Principles
Algorithm for the GME Problem in Real-Time Distributed Systems Based on Token
Author :
Zhang Hu
Author_Institution :
Sch. of Inf. Eng., Anhui Univ. Finance & Econ., Anhui
fYear :
2008
fDate :
18-20 June 2008
Firstpage :
206
Lastpage :
206
Abstract :
Notice of Violation of IEEE Publication Principles

"Algorithm for the GME Problem in Real-Time Distributed Systems Based on Token,"
by Zhang Hu,
in the Proceedings of the 3rd International Conference on Innovative Computing Information and Control, 2008 (ICICIC \´08) pp. 206-206, 18-20 June 2008

After careful and considered review of the content and authorship of this paper by a duly constituted expert committee, this paper has been found to be in violation of IEEE\´s Publication Principles.

This paper is a duplication of the original text from the paper cited below. The original text was copied without attribution (including appropriate references to the original author(s) and/or paper title) and without permission.

Due to the nature of this violation, reasonable effort should be made to remove all past references to this paper, and future references should be made to the following article:

"A Distributed Group Mutual Exclusion Algorithm for Soft Real Time Systems"
by Abhishek Swaroop, and Awadhesh Kumar Singh
in World Academy of Science, Engineering and Technology vol 26, December 2007 pp. 138-143 WASET

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 algor- thm has also been included in the paper.
Keywords :
message passing; program verification; real-time systems; GME problem; Token; dynamic request set; message passing distributed systems; mutual exclusion problems; priority queue; real-time distributed systems; Algorithm design and analysis; Complexity theory; Concurrent computing; Distributed computing; Heuristic algorithms; Message passing; Real time systems;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Innovative Computing Information and Control, 2008. ICICIC '08. 3rd International Conference on
Conference_Location :
Dalian, Liaoning
Print_ISBN :
978-0-7695-3161-8
Type :
conf
DOI :
10.1109/ICICIC.2008.124
Filename :
4603395
Link To Document :
بازگشت