Design and Implementation of Distributed Mutual Exclusion Lock Counter Algorithm


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 7, No. 4, pp. 1227-1235, Apr. 2000
10.3745/KIPSTE.2000.7.4.1227,   PDF Download:

Abstract

In this paper, we propose new concepts that the distributed counter value with the distributed EC system identify each user who users the distributed system. The web user should register his/her own user ID in the cyber shopping mall system. Instead of registration, this paper proposes the proprietary mechanism that is distributing counter. The counter assigns the distinguished number to each client. The distributed lock algorithm is used for mutual assignment of the counter to each client. The proposed algorithm is the best solution in the distributed environment system such as cyber shopping mall. If a user should register his/her own ID in every EC system, he/she may not try to use these uncomfortable systems. The mutual counter is used to identify each client. All of these features are designed and implemented on Windows NT web server. Also these features were experiments with 5 clients for 300 times. According to the experiments, clients have their own mutual counter value. The proposed algorithm will be more efficient in internet application environment. Moreover, it will improve the number of internet users.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
S. J. Jang, "Design and Implementation of Distributed Mutual Exclusion Lock Counter Algorithm," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 7, no. 4, pp. 1227-1235, 2000. DOI: 10.3745/KIPSTE.2000.7.4.1227.

[ACM Style]
Seung Ju Jang. 2000. Design and Implementation of Distributed Mutual Exclusion Lock Counter Algorithm. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 7, 4, (2000), 1227-1235. DOI: 10.3745/KIPSTE.2000.7.4.1227.