Blurb::
Specify dynamic scheduling in a peer partition when Dakota is run in parallel.
Description::
In \c dynamic scheduling, evaluations are assigned to servers as earlier
evaluations complete. Dynamic scheduling is advantageous when evaluations
are of uneven duration.

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