Nonblocking Concurrent Binary Search Tree for Shared-Memory Multiprocessor
碩士 === 國立交通大學 === 資訊工程系 === 87 === Binary search tree is often used in operating system, database system and graph algorithm. Nonblocking algorithm guarantees that some process will complete its operation within a finite number of steps in the system. The nonblocking algorithm, in contras...
Main Authors: | Jung-Rong Huang, 黃俊榮 |
---|---|
Other Authors: | Ting-Lu Huang |
Format: | Others |
Language: | en_US |
Published: |
1999
|
Online Access: | http://ndltd.ncl.edu.tw/handle/26538015162393547626 |
Similar Items
-
Nonblocking Memory Refresh
by: Nguyen, Kate Vy Hoang
Published: (2018) -
System Evaluation of A Concurrency Control Mechanism for Distributed Shared Memory Multiprocessors
by: Chan-Long Huang, et al.
Published: (2000) -
Performance Study of Concurrent Search Trees and Hash Algorithms on Multiprocessors Systems
by: Demuynck, Marie-Anne
Published: (1996) -
Lock-Free Concurrent Tree Structures for Multiprocessor Systems
by: Li, Hsin Chi, et al. -
A nonblocking algorithm for array-based shared queue using compare&swap
by: Dong-Jung Wu, et al.
Published: (1999)