saltstack/salt
1
0
Fork 0
mirror of https://github.com/saltstack/salt.git synced 2025-04-17 10:10:20 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions 2

Update reactor docs with small formatting fixes

Browse source 
Follow up to PR #49214
This commit is contained in:
rallytime 2018-08-23 10:49:17 -04:00 • committed by Daniel Wozniak
parent 3f03dd65ba
commit 84987d1515
1 changed files with 6 additions and 6 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

12
doc/topics/reactor/index.rst
View file

@ -741,24 +741,24 @@ match minion IDs beginning with ``appsrv``).
Reactor Tuning for Large-Scale Installations
=================================================
============================================
The reactor uses a thread pool implementation that's contained inside
salt.utils.process.ThreadPool and It uses Python's stdlib Queue to enqueue
``salt.utils.process.ThreadPool``. It uses Python's stdlib Queue to enqueue
jobs which are picked up by standard Python threads. If the queue is full,
False is simply returned by the firing method on the thread pool.
``False`` is simply returned by the firing method on the thread pool.
As such, there are a few things to say about the selection of proper values
for the reactor.
For situations where it is expected that many long-running jobs might be
executed by the reactor, `reactor_worker_hwm` should be increased or even
set to 0 to bound it only by available memory. If set to zero, a close eye
executed by the reactor, ``reactor_worker_hwm`` should be increased or even
set to ``0`` to bound it only by available memory. If set to zero, a close eye
should be kept on memory consumption.
If many long-running jobs are expected and execution concurrency and
performance are a concern, you may also increase the value for
`reactor_worker_threads`. This will control the number of concurrent threads
``reactor_worker_threads``. This will control the number of concurrent threads
which are pulling jobs from the queue and executing them. Obviously, this
bears a relationship to the speed at which the queue itself will fill up.
The price to pay for this value is that each thread will contain a copy of