cs431
cs431 copied to clipboard
kaist-cp
Implement a concurrent lock-free hash table. - Read [this manual](https://github.com/kaist-cp/cs431/blob/main/homework/README.md) for general advice on homework. - [Documentation & Tips](https://github.com/kaist-cp/cs431/blob/main/homework/doc/hash_table.md). - Use [skeleton code](https://github.com/kaist-cp/cs431/tree/main/homework/src/hash_table) as a starting point, and fill out...
Implement concurrent set data structures with sorted singly linked list using fine-grained lock-coupling. - Read [this manual](https://github.com/kaist-cp/cs431/blob/main/homework/README.md) for general advice on homework. - [Documentation & Tips](https://github.com/kaist-cp/cs431/blob/main/homework/doc/list_set.md). - Use [skeleton code](https://github.com/kaist-cp/cs431/tree/main/homework/src/list_set)...
In today's lecture, we talked about the reason Linux uses linked lists for managing threads, instead of using arrays (with bitmaps indicating each element's state). The main reason seems to...
We're releasing previous exam problems, following the general policy of KAIST SoC to prevent selling and buying exam materials. | | midterm | final | |-----------|---------------------------------------|---------------------------------------| | 2021 fall |...
## Opening I'm trying to understand the reason why hazard pointers require exactly two `SeqCst` orderings. While thinking about this, I wanted to fully understand the guarantees of `SeqCst` atomic...
Related issue: #971 This change may greatly reduce the difficulty of the BoC homework.
First of all, thanks to all CS431 course instructors for providing such good learning materials about Concurrent Programming. ## Pitfall When I implement BoC runtime, I wrote this code snip....
Related issue: #971