1#@ *: DakotaConfig=HAVE_NPSOL
2#@ On Windows: 4-6 abort; refork?
3#@ *: DakotaConfig=UNIX
4#@ p0: MPIProcs=3
5#@ p1: MPIProcs=6
6#@ p2: MPIProcs=6
7#@ p3: MPIProcs=3
8#@ p4: MPIProcs=6
9#@ p5: MPIProcs=2
10#@ p6: MPIProcs=4
11#@ p7: MPIProcs=2
12#@ p8: MPIProcs=3
13#@ p9: MPIProcs=6
14#@ p10: MPIProcs=2
15
16# DAKOTA INPUT FILE - dakota_drivers.in
17
18# A multilevel parallel study with concurrency in analysis drivers.
19# For one level of parallelism (1 evaluation_server, serial analyses),
20# running on 3 processors is a good choice.  For two levels of
21# parallelism (1 evaluation_server, 2 processors_per_analysis), a total
22# of 6 processors works well.  And for three levels of parallelism,
23# 13, 19, 31, or 54 processors could be used for 2, 3, 5, or 9
24# evaluation_servers, where 13/19/31 use self-scheduling at the
25# iterator level and 54 uses static scheduling at the iterator level.
26
27# This tester fills out a test matrix of direct/fork/system interfaces
28# vs. synch/asynch local/message passing/hybrid modes.  For serial
29# executions (tests 0-6), the 4 combinations of synch/asynch
30# evaluations/analyses are tested for each of the interfaces for which
31# the combinations are supported.  For parallel executions, the direct
32# interface is tested in message-passing mode in tests p0-p2, the fork
33# interface is tested in message-passing mode in tests p3-p4 and in
34# hybrid mode in tests p5-p7, and the system interface is tested in
35# message-passing mode in tests p8-p9 and in hybrid mode in test p10.
36
37method,
38	npsol_sqp
39	  convergence_tolerance = 1.e-8
40
41variables,
42	continuous_design = 4
43	  initial_point       1.0 1.0 1.0 1.0
44
45interface,
46	direct 				    	    #s0,#p0,#p1,#p2
47#	fork 			   #s1,#s2,#s3,#s4,#p3,#p4,#p5,#p6,#p7
48#	system					#s5,#s6,#p8,#p9,#p10
49#	  asynchronous		      #s2,#s3,#s4,#s6,#p5,#p6,#p7,#p10
50#	    evaluation_concurrency = 5 	     #s2,#s4,#s6,#p5,#p7,#p10
51#	    evaluation_concurrency = 1 			    #s3,#p6
52#	    analysis_concurrency = 3		     #s3,#s4,#p6,#p7
53#	    analysis_concurrency = 1		    #s2,#s6,#p5,#p10
54	  analysis_drivers = 'text_book1' 'text_book2' 'text_book3'
55#	  analysis_components = 'M1' 'M2' 'M3'
56#	  evaluation_servers = 1		   #p0,#p1,#p3,#p8
57#	  evaluation_servers = 2		       #p2,#p4,#p9
58#	  evaluation_scheduling peer dynamic	       #p2,#p4,#p9
59#	  processors_per_analysis = 2	 	 	       #p1
60
61responses,
62	objective_functions = 1
63	nonlinear_inequality_constraints = 2
64	numerical_gradients
65	  method_source dakota
66	  interval_type central
67	  fd_gradient_step_size = 1.e-4
68	no_hessians
69