X-Git-Url: https://pd.if.org/git/?a=blobdiff_plain;f=README.md;h=691c7b7710e00b0c72fd5712c4046f6330e1a46b;hb=92bcd68650c17e718efccdc2cad16ea353991f1a;hp=37383fc1e66481ead5d43fc85b40c6a0e438b3a3;hpb=81d755dfab3eb03bf41b888a1e64629c3e396854;p=btree

diff --git a/README.md b/README.md
index 37383fc..691c7b7 100644
--- a/README.md
+++ b/README.md
@@ -6,14 +6,20 @@ A working project for High-concurrency B-tree source code in C
 There are three major code sets in the btree source code:
 
 btree2q.c       Single Threaded/MultiProcess with latching supplied by advisory file locking.  Works with network file systems.
+
 threads2h.c     Multi-Threaded/Multi-Process with latching implemented with test & set locks in the btree pages.
 
+threads2i.c     Multi-Threaded/Multi-Process with latching implemented with test & set locks in the btree pages with Linux futex system calls for contention.
+
 The Foster set includes three types of latching:
 
 Fosterbtreee.c  Multi-Threaded/Single Process with latches hosted by the buffer pool manager
+
 Fosterbtreef.c  Multi-Threaded/Multi-Process with latches hosted by a latch manager using the first few pages of the btree.
+
 Fosterbtreeg.c  Multi-Threaded/Multi-Process with latches implemented with test & set locks in the btree pages.
 
+
 Compilation is achieved on linux or Windows by:
 
 gcc -D STANDALONE threads2h.c -lpthread