학술저널
This paper suggests the algorithm and data structure which enable us to da concurrent search, insertion and deletion using the concept of directory and S-lock (Shared lock), X-lock (Exclusive lock), D-lock(Date lock) in height belanced search tree.
ABSTRACT
Ⅰ. 서론
Ⅱ. CONCURRENT 알고리즘을 위한 자료구조
Ⅲ. LOCKING
Ⅳ. CONCURRENT 알고리즘
Ⅴ. CONCURRENT 알고리즘의 검증
Ⅵ. 결론
참고문헌
(0)
(0)