X-Git-Url: https://pd.if.org/git/?p=btree;a=blobdiff_plain;f=README.md;h=9210f42f863d43b9dff0d8f3c203fcc826a4da2d;hp=eff833d2f99b4deb9a551851ca971996b3b3340a;hb=cefc823735d6a81c8e5a56b9ebeb61b9061f3ba3;hpb=0756819e460acb958eeb073f4d5ca9ddf66ec6c7 diff --git a/README.md b/README.md index eff833d..9210f42 100644 --- a/README.md +++ b/README.md @@ -5,13 +5,13 @@ A working project for High-concurrency B-tree source code in C There are four major code sets in the standard btree source code: -btree2s.c Single Threaded/MultiProcess version that removes keys all the way back to an original empty btree, placing removed nodes on a free list. +btree2s.c Single Threaded/MultiProcess version that removes keys all the way back to an original empty btree, placing removed nodes on a free list. Operates under either memory mapping or file I/O. Recommended btrees hosted on network file systems. -threads2h.c Multi-Threaded/Multi-Process with latching implemented by a latch manager with pthreads/SRW latches in the first few btree pages. +threads2h.c Multi-Threaded/Multi-Process with latching implemented by a latch manager with pthreads/SRW latches in the first few btree pages. Recommended for Windows. -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. +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. -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. +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. Recommended for linux. The Foster code set includes the same three types of latching: