일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
1 | 2 | |||||
3 | 4 | 5 | 6 | 7 | 8 | 9 |
10 | 11 | 12 | 13 | 14 | 15 | 16 |
17 | 18 | 19 | 20 | 21 | 22 | 23 |
24 | 25 | 26 | 27 | 28 | 29 | 30 |
31 |
- Symbol
- FreeBSD
- 컴퓨터 강좌
- DBMS
- 한빛미디어
- 긴옵션
- 전처리기
- OS 커널
- SQLite
- newSQL
- DBMS 개발
- Windows via c/c++
- 약어
- bash
- 포인터
- Programming
- Pointer
- 함수포인터
- TiKV
- 포인터변수
- TiDB
- 커널
- UNIX
- Golang
- kernel
- 구조와 원리
- UNIX Internals
- go
- getopts
- Preprocessor
- Today
- Total
목록개발자 이야기/Algorithms (2)
sonumb
출처: http://15418.courses.cs.cmu.edu/spring2013/article/46 Implementing Lock-free Stacks and Linked ListsBy kverrier, acappiello, malsup, and bourneBlocking vs. Non-blockingThe primary difference between blocking and non-blocking algorithms is which threads are able to make progress in the code execution. In a blocking model, a single thread is allowed to prevent all other threads from making any..
1. The records in the sorted input file are arranged into buckets (leaf nodes) which are 70% full. 2. Create the first node of the parent-of-leaf level in memory. Read in the first sorted leaf. Put the address of this leaf in the parent in memory. 3. Read in another sorted leaf. Put its lowest key value in the node at the lowest level which is not yet 70% full. If all nodes in the index are 70% ..