| | 34 | |
| | 35 | [[BR]] |
| | 36 | == Resolution Tests == |
| | 37 | The idea here is a bit different than adjusting data file parameters to see what works best. Here, I am simply lowering the number of levels while keeping the number of processors constant. This is to see how having a larger root grid might help performance when running on many processors. |
| | 38 | |
| | 39 | There is density gradient refinement to level 3, and cooling time threshold refinement to level 7 (based on fiducial run). qTolerance changes for each run to keep this consistent. For example, the level 6 run has |
| | 40 | {{{ |
| | 41 | qTolerance = .25, .40, 1d30, 1d30, ... |
| | 42 | }}} |
| | 43 | so that there is the same refinement criteria at the same effective resolution. For level 5... |
| | 44 | {{{ |
| | 45 | qTolerance = .40, 1d30, 1d30, 1d30, ... |
| | 46 | }}} |
| | 47 | The level 4 and level 3 runs have the same qTolerance... |
| | 48 | {{{ |
| | 49 | qTolerance = 1d30, 1d30, 1d30, 1d30, ... |
| | 50 | }}} |
| | 51 | [[BR]] |
| | 52 | |
| | 53 | ||= =||= Fiducial =||= 6 AMR =||= 5 AMR =||= 4 AMR =||= 3 AMR =|| |
| | 54 | ||= % root steps restarted =||= =||= =||= =||= =||= =|| |
| | 55 | ||= Time to frame 1 =||= =||= =||= =||= =||= =|| |
| | 56 | ||= Last frame =||= =||= =||= =||= =||= =|| |
| | 57 | ||= Time for last frame =||= =||= =||= =||= =||= =|| |
| | 58 | ||= Est. time to completion =||= =||= =||= =||= =||= =|| |
| | 59 | ||= Number of processors =||= 1008 =||= 1008 =||= 1008 =||= 1008 =||= 1008 =|| |
| | 60 | ||= Location =||= kraken =||= kraken =||= kraken =||= kraken =||= kraken =|| |
| | 61 | ||= Other deviations from Fiducial =||= N/A =||= qTolerance (see above) =||= qTolerance (see above) =||= qTolerance (see above) =||= qTolerance (see above) =|| |
| | 62 | ||= Last Frame / movie link =||= =||= =||= =||= =||= =|| |
