- Timestamp:
-
08/19/12 15:59:40 (12 years ago)
- Author:
-
Zhongwei Yao
- Comment:
-
/* Comparison between one-rbtree and one-rbtree per-thread approach */
Legend:
- Unmodified
- Added
- Removed
- Modified
-
v5
|
v6
|
|
64 | 64 | RBTree_Control: 24 Bytes |
65 | 65 | POSIX_Keys_Control: 20 Bytes |
| 66 | If take the size of these structure on Sparc as an example, the result is: |
| 67 | space of one rbtree approach: |
| 68 | S1 = m * 20 + m * t * 36+ t * 12 |
| 69 | space of one-rbtree per-thread: |
| 70 | S2 = m * 20 + m * t * 24 + t * 24 |
| 71 | and '''S1 - S2 = 12 * t * ( m - 1)'''. The one-rbtree approach needs more memory. However, both approaches need '''O( m * t )''' memory. |