An Efficient Mutual Exclusion Algorithm for Hypercube Multicomputers


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 3, No. 5, pp. 1207-1214, Sep. 1996
10.3745/KIPSTE.1996.3.5.1207,   PDF Download:

Abstract

We present an efficient decentralized, symmetric mutual exclusion algorithm for the hypercube architecture. The algorithm is based on the technique which embeds a mesh into a hypercube. We compare the performance of our algorithm with that of Gupta et al.,s algorithm. As a result of performance comparison, the minimum round-trip delay is equal to that of Gupta et al''s algorithm, the average blocking delay is a little longer than that of Gupta et al.''s algorithm, and the number of messages per access to critical resource is fewer than that of Gupta et al.''s algorithm.


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]
B. I. Han, "An Efficient Mutual Exclusion Algorithm for Hypercube Multicomputers," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 3, no. 5, pp. 1207-1214, 1996. DOI: 10.3745/KIPSTE.1996.3.5.1207.

[ACM Style]
Bae Ihn Han. 1996. An Efficient Mutual Exclusion Algorithm for Hypercube Multicomputers. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 3, 5, (1996), 1207-1214. DOI: 10.3745/KIPSTE.1996.3.5.1207.