Blurb::
Specify static scheduling in a peer partition when Dakota is run in parallel.
Description::
In \c static scheduling, all available evaluations are assigned to servers in 
a predetermined fashion. Each completed evaluation is replaced with one 
congruent modulo the evaluation concurrency. For example, with 6 servers, eval 
number 2 will be replaced by eval number 8.

Topics::	concurrency_and_parallelism
Examples::
Theory::
Faq::
See_Also::
