3 * Simplicity: Unicorn is a traditional UNIX prefork web server.
4 No threads are used at all, this makes applications easier to debug
5 and fix. When your application goes awry, a BOFH can just
6 "kill -9" the runaway worker process without worrying about tearing
7 all clients down, just one. Only UNIX-like systems supporting
8 fork() and file descriptor inheritance are supported.
10 * The Ragel+C HTTP parser is taken from Mongrel.
12 * All HTTP parsing and I/O is done much like Mongrel:
13 1. read/parse HTTP request headers in full
14 2. call Rack application
15 3. write HTTP response back to the client
17 * Like Mongrel, neither keepalive nor pipelining are supported.
18 These aren't needed since Unicorn is only designed to serve
19 fast, low-latency clients directly. Do one thing, do it well;
20 let nginx handle slow clients.
22 * Configuration is purely in Ruby and eval(). Ruby is less
23 ambiguous than YAML and lets lambdas for
24 before_fork/after_fork/before_exec hooks be defined inline. An
25 optional, separate config_file may be used to modify supported
26 configuration changes (and also gives you plenty of rope if you RTFS
29 * One master process spawns and reaps worker processes. The
30 Rack application itself is called only within the worker process (but
31 can be loaded within the master). A copy-on-write friendly garbage
32 collector like the one found in mainline Ruby 2.0.0 and later
33 can be used to minimize memory usage along with the "preload_app true"
34 directive (see Unicorn::Configurator).
36 * The number of worker processes should be scaled to the number of
37 CPUs, memory or even spindles you have. If you have an existing
38 Mongrel cluster on a single-threaded app, using the same amount of
39 processes should work. Let a full-HTTP-request-buffering reverse
40 proxy like nginx manage concurrency to thousands of slow clients for
41 you. Unicorn scaling should only be concerned about limits of your
44 * Load balancing between worker processes is done by the OS kernel.
45 All workers share a common set of listener sockets and does
46 non-blocking accept() on them. The kernel will decide which worker
47 process to give a socket to and workers will sleep if there is
50 * Since non-blocking accept() is used, there can be a thundering
51 herd when an occasional client connects when application
52 *is not busy*. The thundering herd problem should not affect
53 applications that are running all the time since worker processes
54 will only select()/accept() outside of the application dispatch.
56 * Additionally, thundering herds are much smaller than with
57 configurations using existing prefork servers. Process counts should
58 only be scaled to backend resources, _never_ to the number of expected
59 clients like is typical with blocking prefork servers. So while we've
60 seen instances of popular prefork servers configured to run many
61 hundreds of worker processes, Unicorn deployments are typically only
62 2-4 processes per-core.
64 * On-demand scaling of worker processes never happens automatically.
65 Again, Unicorn is concerned about scaling to backend limits and should
66 never configured in a fashion where it could be waiting on slow
67 clients. For extremely rare circumstances, we provide TTIN and TTOU
68 signal handlers to increment/decrement your process counts without
69 reloading. Think of it as driving a car with manual transmission:
70 you have a lot more control if you know what you're doing.
72 * Blocking I/O is used for clients. This allows a simpler code path
73 to be followed within the Ruby interpreter and fewer syscalls.
74 Applications that use threads continue to work if Unicorn
75 is only serving LAN or localhost clients.
77 * SIGKILL is used to terminate the timed-out workers from misbehaving apps
78 as reliably as possible on a UNIX system. The default timeout is a
79 generous 60 seconds (same default as in Mongrel).
81 * The poor performance of select() on large FD sets is avoided
82 as few file descriptors are used in each worker.
83 There should be no gain from moving to highly scalable but
84 unportable event notification solutions for watching few
87 * If the master process dies unexpectedly for any reason,
88 workers will notice within :timeout/2 seconds and follow
89 the master to its death.
91 * There is never any explicit real-time dependency or communication
92 between the worker processes nor to the master process.
93 Synchronization is handled entirely by the OS kernel and shared
94 resources are never accessed by the worker when it is servicing