The table below gives the data for 36 runs that form the basis of our analysis of scaling of time, speed, efficiency and overhead as a function of number of elements N and/or number of processors P. The data in this table is portrayed in self-explanatory plots that are both available as five figures contained within a Microsoft Word Document (Scaling_Plots.doc) and as the five figures with these self explanatory filenames, all in the same directory as this data file: Walltime_vs_N.tif Walltime_vs_P.tif Speedup_vs_P.tif Eficiency_vs_P.tif Overhead_vs_P.tif In the table, idn is the number of elements each slave has and iremain is the number of elements the master has. As the table shows, all were run for 100 time steps, whereas the 150000 element, 256 processor First Code Improvment Milestone run was run for 5000 time steps. nprocs elements #time walltime idn iremain steps 1 712 100 00:01:13 0 712 2 712 100 00:01:01 357 355 4 712 100 00:00:48 179 175 8 712 100 00:00:41 90 82 16 712 100 00:00:41 45 37 32 712 100 00:00:48 22 30 64 712 100 00:01:11 11 19 128 712 100 00:01:39 5 77 256 712 100 00:01:45 2 202 1 5292 100 00:11:33 0 5392 2 5292 100 00:08:58 2697 2695 4 5292 100 00:05:56 1349 1345 8 5292 100 00:03:48 675 667 16 5292 100 00:02:07 338 322 32 5292 100 00:01:34 169 153 64 5292 100 00:01:42 85 37 128 5292 100 00:02:28 42 58 256 5292 100 00:03:53 21 37 1 15000 100 00:32:12 0 15000 2 15000 100 00:29:57 7501 7499 4 15000 100 00:15:00 3751 3747 8 15000 100 00:09:51 1876 1868 16 15000 100 00:05:17 938 930 32 15000 100 00:02:56 469 461 64 15000 100 00:02:18 235 195 128 15000 100 00:02:37 118 14 256 15000 100 00:04:24 58 210 1 150000 100 07:57:47 0 150000 2 150000 100 07:41:56 75001 74999 4 150000 100 04:02:22 37501 37497 8 150000 100 02:01:39 18751 18743 16 150000 100 01:17:24 9376 9360 32 150000 100 00:38:39 4688 4672 64 150000 100 00:20:48 2344 2328 128 150000 100 00:12:12 1172 1156 256 150000 100 00:09:27 586 570