Browsing by Author "Shann, CH"

Now showing 1 - 2 of 2

A comment on "A circular list-based mutual exclusion scheme for large shared-memory multiprocessors"
(1998-04-01)
Huang, TL
;
Shann, CH
;
資訊工程學系
;
Department of Computer Science
The circular list-based mutual exclusion algorithm proposed by Fu and Tzeng [1] is subject to a race condition that leads to a deadlock under subtle situations. An execution sequence evidences the race, and a modified version is provided. The performance of the original algorithm remains unchanged.
A practical nonblocking queue algorithm using compare-and-swap
(2000)
Shann, CH
;
Huang, TL
;
Chen, C
;
資訊工程學系
;
Department of Computer Science
Many nonblocking algorithms have been proposed for shared queues. Previous studies indicate that link-based algorithms perform best. However, these algorithms have a memory management problem. a dequeued node can not be freed or reused without problem: handling. The problem is usually overloaded; one just assumes the existence of a lower level mechanism, which takes care of all the details of handling the problem. Employing such a mechanism incurs significant overheads, and consequently the link-based queues may not perform as well as claimed. A new nonblocking queue algorithm based on a finite array is proposed in this paper. Comparing with the link-based algorithms. the nerv algorithm provides the same degree of concurrency without being subject to the memory problem, hence suggests a good performance.