generated code timing template

	A	B	C	D	E	F	G
1	Enter in given number of processes and problem size in recorded execution time table. Fill in recorded execution time after running code.
2	The speedup table and corresponding graph are made as execution times are entered.
3	Additionally, the efficiency table and corresponding graph are also created as the execution table is filled in.
4
5	Machine:			Code:
6
7			Recorded Execution Time
8	number processes / problem size	8,000,000	16,000,000	32,000,000	64,000,000	128,000,000
9	1	1	1	1	1	1
10	2	1	1	1	1	1
11	4	1	1	1	1	1
12	8	1	1	1	1	1
13	12	1	1	1	1	1
14	16	1	1	1	1	1
15
16			Speedup
17	number processes / problem size	8,000,000	16,000,000	32,000,000	64,000,000	128,000,000	Ideal Speedup
18	1	1	1	1	1	1	1
19	2	1	1	1	1	1	2
20	4	1	1	1	1	1	4
21	8	1	1	1	1	1	8
22	12	1	1	1	1	1	12
23	16	1	1	1	1	1	16
24
25			Efficiency
26	number processes / problem size	8,000,000	16,000,000	32,000,000	64,000,000	128,000,000	Ideal Efficiency
27	1	1	1	1	1	1	1
28	2	0.5	0.5	0.5	0.5	0.5	1
29	4	0.25	0.25	0.25	0.25	0.25	1
30	8	0.125	0.125	0.125	0.125	0.125	1
31	12	0.08333333333	0.08333333333	0.08333333333	0.08333333333	0.08333333333	1
32	16	0.0625	0.0625	0.0625	0.0625	0.0625	1
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100