about summary refs log tree commit homepage
path: root/README
diff options
context:
space:
mode:
authorEric Wong <e@80x24.org>2015-12-13 02:33:18 +0000
committerEric Wong <e@80x24.org>2015-12-13 02:33:18 +0000
commitecba8611b666e5f3c01ca8c8ae6516090110f337 (patch)
treed654f4d87a4803101897627b132c1ae8caa474be /README
parent47894f3c42814f15b9a4d6a64dd828309e066bf6 (diff)
downloadyahns-ecba8611b666e5f3c01ca8c8ae6516090110f337.tar.gz
It's been there long enough and kqueue itself hasn't changed.  In
fact, IIRC the entire design of yahns (for another server in late
2011) probably came about because of the name "kqueue"...
Diffstat (limited to 'README')
-rw-r--r--README10
1 files changed, 5 insertions, 5 deletions
diff --git a/README b/README
index 1219a7e..56b466f 100644
--- a/README
+++ b/README
@@ -21,8 +21,8 @@ Features
 * supports streaming responses with lazy buffering for slow clients
 * optional streaming input for fast clients
 * able to host multiple applications with different settings
-* uses epoll to scale to many idle connections
-* abuses epoll as a load balancer between threads inside a process
+* uses epoll/kqueue to scale to many idle connections
+* abuses epoll/kqueue as a load balancer between threads within a process
 * optional multi-process support (in addition to threads)
 * fairly balances new clients between multiple processes (on Linux)
 
@@ -44,8 +44,8 @@ Supported Platforms
 
 yahns is developed primarily for modern GNU/Linux systems.
 
-We have experimental support kqueue on FreeBSD (and possibly OpenBSD and
-NetBSD).  Non-Free systems/dependencies will never be supported.
+We support kqueue on FreeBSD (and possibly OpenBSD and NetBSD).
+Non-Free systems/dependencies will never be supported.
 
 Supported Ruby implementations:
 * (Matz) Ruby 2.0.0 and later (we develop (and host our website) on trunk)
@@ -101,7 +101,7 @@ multiple threads.
 * two classes of long-lived, persistent threads
   1. blocking acceptors
   2. non-blocking event loop workers
-* epoll acts as a queue (by using one-shot notifications)
+* epoll (or kqueue) acts as a queue (by using one-shot notifications)
 * acceptors accept new clients and put them in the epoll "queue"
 * workers pull clients off the queue, rearming them to epoll on EAGAIN