From 4cd8014cd8010dbb38d7bb86ac1faee3f51d908c Mon Sep 17 00:00:00 2001 From: unknown Date: Tue, 25 Feb 2014 12:23:07 -0800 Subject: [PATCH] Introduce btree2t --- README.md | 8 +++++--- 1 file changed, 5 insertions(+), 3 deletions(-) diff --git a/README.md b/README.md index 97d02c4..856ec01 100644 --- a/README.md +++ b/README.md @@ -3,10 +3,12 @@ Btree-source-code A working project for High-concurrency B-tree source code in C -There are four major code sets in the standard btree source code: +There are five 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. Operates under either memory mapping or file I/O. Recommended btrees hosted on network file systems. +btree2t.c Single Threaded/MultiProcess version similar to btree2s except that fcntl locking has been replaced by test & set latches in the first few btree pages. Uses either memory mapping or file I/O. + 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. @@ -15,10 +17,10 @@ threads2j.c Multi-Threaded/Multi-Process with latching implemented by a latc Compilation is achieved on linux or Windows by: -gcc -D STANDALONE threads2h.c -lpthread -lrt +gcc -D STANDALONE threads2h.c -lpthread or cl /Ox /D STANDALONE threads2h.c -Please see the project wiki page for documentation +Please see the project wiki page for additional documentation -- 2.40.0