1. i + k AMR Algorithm Outline 1. Set the timestep for each node of level level. 2. Set up ghost cells for each node's grid. i j j + m i - g i + k + g j - g j + m + g

2. AMR Algorithm, continued 3. If running in a multi-processor mode: 3a. Redistribute level's computation duties across CPUs. 3b. Wait for each processor to become available before proceeding. processors nodes

3. AMR Algorithm, continued 4. If level+1 is not the maximum level, then: 4a. Perform error estimation across level. 4b. Create new child nodes for any nodes with high error estimations.

4. AMR Algorithm, continued 5. Find new maximum CFL for level. 6. If any new nodes have been created for level+1, then recursively call AMR() on level+1. level Level + 1 AMR()‏

5. AMR Algorithm, continued 7. Perform fine-resolution fixup on level. 8. Repeat steps 1 – 7 a number of times equal to the CoarsenRatio for this level.