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: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | en_US |
Published: |
1999
|
Online Access: | http://ndltd.ncl.edu.tw/handle/26538015162393547626 |
id |
ndltd-TW-087NCTU0392092 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-087NCTU03920922016-07-11T04:13:35Z http://ndltd.ncl.edu.tw/handle/26538015162393547626 Nonblocking Concurrent Binary Search Tree for Shared-Memory Multiprocessor 共享記憶體多處理機上非阻塞性的並行二元搜索樹演算法 Jung-Rong Huang 黃俊榮 碩士 國立交通大學 資訊工程系 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 contrast to the traditional lock-based algorithm, enjoys higher concurrency and fault-tolerance. In this thesis, we propose a nonblocking concurrent binary search tree algorithm. In order to maintain the data integrity in the course of concurrent insert and delete, we use the auxiliary node in the tree structure. The algorithm maintains binary search tree property without locking. Finally, we prove the correctness of our algorithms. Ting-Lu Huang 黃俊榮 1999 學位論文 ; thesis 39 en_US |
collection |
NDLTD |
language |
en_US |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 國立交通大學 === 資訊工程系 === 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 contrast to the traditional lock-based algorithm, enjoys higher concurrency and fault-tolerance. In this thesis, we propose a nonblocking concurrent binary search tree algorithm. In order to maintain the data integrity in the course of concurrent insert and delete, we use the auxiliary node in the tree structure. The algorithm maintains binary search tree property without locking. Finally, we prove the correctness of our algorithms.
|
author2 |
Ting-Lu Huang |
author_facet |
Ting-Lu Huang Jung-Rong Huang 黃俊榮 |
author |
Jung-Rong Huang 黃俊榮 |
spellingShingle |
Jung-Rong Huang 黃俊榮 Nonblocking Concurrent Binary Search Tree for Shared-Memory Multiprocessor |
author_sort |
Jung-Rong Huang |
title |
Nonblocking Concurrent Binary Search Tree for Shared-Memory Multiprocessor |
title_short |
Nonblocking Concurrent Binary Search Tree for Shared-Memory Multiprocessor |
title_full |
Nonblocking Concurrent Binary Search Tree for Shared-Memory Multiprocessor |
title_fullStr |
Nonblocking Concurrent Binary Search Tree for Shared-Memory Multiprocessor |
title_full_unstemmed |
Nonblocking Concurrent Binary Search Tree for Shared-Memory Multiprocessor |
title_sort |
nonblocking concurrent binary search tree for shared-memory multiprocessor |
publishDate |
1999 |
url |
http://ndltd.ncl.edu.tw/handle/26538015162393547626 |
work_keys_str_mv |
AT jungronghuang nonblockingconcurrentbinarysearchtreeforsharedmemorymultiprocessor AT huángjùnróng nonblockingconcurrentbinarysearchtreeforsharedmemorymultiprocessor AT jungronghuang gòngxiǎngjìyìtǐduōchùlǐjīshàngfēizǔsāixìngdebìngxíngèryuánsōusuǒshùyǎnsuànfǎ AT huángjùnróng gòngxiǎngjìyìtǐduōchùlǐjīshàngfēizǔsāixìngdebìngxíngèryuánsōusuǒshùyǎnsuànfǎ |
_version_ |
1718343396847779840 |