generated from feelpp/feelpp-project
-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathplots.json
More file actions
140 lines (140 loc) · 6.25 KB
/
plots.json
File metadata and controls
140 lines (140 loc) · 6.25 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
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
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
{
"contents": [
{
"type": "section",
"title": "Description",
"contents": [
{
"type": "text",
"text": "This report analyzes the performance of the parallel sum benchmark for different array sizes (N) and levels of task parallelism. We compare computation and communication times and evaluate how execution time and speedup evolve with increasing workloads."
},
{
"type": "section",
"title": "Session",
"contents": [
{
"type": "itemize",
"ref": "reframe_json",
"items": [
"Hostname: @{session_info.hostname}@",
"User: @{session_info.user}@",
"Time Start: @{session_info.time_start}@",
"Time End: @{session_info.time_end}@"
]
}
]
},
{
"type": "section",
"title": "Cases",
"contents": [
{
"type": "itemize",
"ref": "reframe_json",
"items": [
"Total: @{session_info.num_cases}@",
"Failures: @{session_info.num_failures}@",
"Runs: @{runs | length}@"
]
}
]
}
]
},
{
"type": "section",
"title": "Parametrization",
"contents": [
{
"type": "table",
"ref": "parameter_table",
"layout": {
"rename": {
"testcases.time_total": "Total Time (s)",
"testcases.hashcode": "Hash",
"result": "",
"logs_link":""
},
"column_order": ["result", "testcases.hashcode", "tasks", "elements", "testcases.time_total","logs_link"]
},
"filter": { "placeholder": "Filter testcases..." },
"style": {
"column_align": { "result": "center" },
"column_width":{ "result":1,"logs_link":1},
"classnames": ["scrollable", "sortable"]
}
}
]
},
{
"type": "section",
"title": "Performance Analysis",
"contents": [
{
"type": "section",
"title": "Execution Time vs Number of Tasks",
"contents": [
{
"type": "plot",
"plot": {
"title": "Absolute performance",
"plot_types": ["stacked_bar", "grouped_bar"],
"xaxis": { "parameter": "tasks", "label": "Number of tasks" },
"yaxis": { "label": "Execution time (s)" },
"color_axis": { "filter": { "computation_time": "Time" } },
"secondary_axis": { "parameter": "elements", "label": "N" }
}
},
{
"type": "text",
"text": "This plot shows the execution time breakdown as the number of tasks increases. It highlights parallel scaling behavior for different array sizes."
}
]
},
{
"type": "section",
"title": "Execution Time vs Problem Size (N)",
"contents": [
{
"type": "plot",
"plot": {
"title": "Absolute performance",
"plot_types": ["stacked_bar", "table"],
"xaxis": { "parameter": "elements", "label": "N" },
"yaxis": { "label": "Execution time (s)" },
"color_axis": { "filter": { "computation_time": "Time" } },
"secondary_axis": { "parameter": "tasks", "label": "Number of tasks" }
}
},
{
"type": "text",
"text": "This plot illustrates how execution time scales with array size N under different task counts. It helps identify compute bottlenecks and memory throughput constraints."
}
]
},
{
"type": "section",
"title": "Speedup Analysis",
"contents": [
{
"type": "plot",
"plot": {
"title": "Speedup",
"plot_types": ["scatter"],
"transformation": "speedup",
"xaxis": { "parameter": "tasks", "label": "Number of tasks" },
"yaxis": { "label": "Speedup" },
"color_axis": { "filter": { "computation_time": "Time" } },
"secondary_axis": { "parameter": "elements", "label": "N" }
}
},
{
"type": "text",
"text": "This speedup plot shows how effectively the computation accelerates when increasing task parallelism. It highlights the scaling behavior of the parallel sum benchmark."
}
]
}
]
}
]
}