485 assigned 给IO 两周了还没消息正常吗？# EB23 - 劳工卡
d*w
1 楼
1. smart pointer implementation
2. thread safe hashmap, how to improve concurrency, I said to read/write
lock, use many locks to reduce 粒度, each lock cover one part of range of
buckets.
3. stack implementation, use array
4. insert node into linkedlist
5. LRU cache, getItem if not hit cache, should visit database to fetch that.
HashTable + DoubleLinkedlist
6. fib
7. implement spin lock, test and set 原语,
8. 32/64 alignment pading,
struct s{
char a;
int b;
void* c
long long d;
}
sizeof(s) in 32bit system and 64bit system. How to transfer struct if you do
not know which platform? consider remove the difference in 32bit or 64bit
9. compare mutex/semaphore, implement semaphore, diff wait/sleep
10. serialize tree and deserialize
11. get 3 smallest number in an array
12. OS concepts: how to do context switch? what does volatile mean? L1/L2
cache/memory structure; busy wait, notify. event driven.
13+ hadoop related.
2. thread safe hashmap, how to improve concurrency, I said to read/write
lock, use many locks to reduce 粒度, each lock cover one part of range of
buckets.
3. stack implementation, use array
4. insert node into linkedlist
5. LRU cache, getItem if not hit cache, should visit database to fetch that.
HashTable + DoubleLinkedlist
6. fib
7. implement spin lock, test and set 原语,
8. 32/64 alignment pading,
struct s{
char a;
int b;
void* c
long long d;
}
sizeof(s) in 32bit system and 64bit system. How to transfer struct if you do
not know which platform? consider remove the difference in 32bit or 64bit
9. compare mutex/semaphore, implement semaphore, diff wait/sleep
10. serialize tree and deserialize
11. get 3 smallest number in an array
12. OS concepts: how to do context switch? what does volatile mean? L1/L2
cache/memory structure; busy wait, notify. event driven.
13+ hadoop related.
