4 A working project for High-concurrency B-tree source code in C
6 There are four major code sets in the standard btree source code:
8 btree2s.c Single Threaded/MultiProcess with latching supplied by advisory file locking. Works with network file systems. Only deletes leaf level pages.
10 btree2t.c Single Threaded/MultiProcess version that removes keys all the way back to an original empty btree.
12 threads2h.c Multi-Threaded/Multi-Process with latching implemented by a latch manager with pthreads/SRW latches in the first few btree pages.
14 threads2i.c Multi-Threaded/Multi-Process with latching implemented by a latch manager with test & set latches in the first few btree pages with thread yield system calls during contention.
16 threads2j.c Multi-Threaded/Multi-Process with latching implemented by a latch manager with test & set locks in the first few btree pages with Linux futex system calls during contention.
18 The Foster code set includes the same three types of latching:
20 Fosterbtreee.c Multi-Threaded/Single Process with latching implemented by a latch manager with pthreads/SRW latches in the first few btree pages.
22 Fosterbtreef.c Multi-Threaded/Multi-Process with latching implemented by a latch manager with test & set latches in the first few btree pages with thread yield system calls during contention.
24 Fosterbtreeg.c Multi-Threaded/Multi-Process with latching implemented by a latch manager with test & set locks in the first few btree pages with Linux futex system calls during contention.
26 Compilation is achieved on linux or Windows by:
28 gcc -D STANDALONE threads2h.c -lpthread
32 cl /Ox /D STANDALONE threads2h.c
34 Please see the project wiki page for documentation