X-Git-Url: https://pd.if.org/git/?a=blobdiff_plain;f=README.md;h=eff833d2f99b4deb9a551851ca971996b3b3340a;hb=ebec1715a3aeee151e4a6ba3cb0caa4fe3d21099;hp=54f9d2305a605afbff87b1449b1fbb409cf7a74a;hpb=df02ae76e0a3ef84bee95b9d4b7c767d9a6bb41a;p=btree diff --git a/README.md b/README.md index 54f9d23..eff833d 100644 --- a/README.md +++ b/README.md @@ -5,7 +5,7 @@ A working project for High-concurrency B-tree source code in C There are four major code sets in the standard btree source code: -btree2q.c Single Threaded/MultiProcess with latching supplied by advisory file locking. Works with network file systems. +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. threads2h.c Multi-Threaded/Multi-Process with latching implemented by a latch manager with pthreads/SRW latches in the first few btree pages. @@ -13,11 +13,11 @@ threads2i.c Multi-Threaded/Multi-Process with latching implemented by a latc 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. -The Foster set includes three types of latching: +The Foster code set includes the same three types of latching: Fosterbtreee.c Multi-Threaded/Single Process with latching implemented by a latch manager with pthreads/SRW latches in the first few btree pages. -Fosterbtreef.c Multi-Threaded/Multi-Process with latching implemented by a latch manager with test & set locks in the first few btree pages with thread yield system calls during contention. +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. 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.