benchmarking/examples/sorting/plots.json at 369cf6c85afbed63b8a6fe8beaaeff839571c358 · feelpp/benchmarking · GitHub

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
{
    "contents": [
        {
            "type": "section",
            "title": "Description",
            "contents": [
                {
                    "type": "text",
                    "text": "This report analyzes the performance of different sorting algorithms (BubbleSort, InsertionSort, MergeSort) for various array sizes (N). We evaluate execution time and compare algorithmic complexity."
                },
                {
                    "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": "Execution Time (s)",
                            "testcases.hashcode": "Hash",
                            "result": ""
                        },
                        "column_order": ["result", "testcases.hashcode", "algorithm", "elements", "testcases.time_total","logs_link"]
                    },
                    "style": {
                        "column_align": { "result": "center" },
                        "column_width":{ "result":1,"logs_link":1},
                        "classnames": ["scrollable", "sortable"]
                    },
                    "filter": { "placeholder": "Filter testcases..." }
                }
            ]
        },
        {
            "type": "section",
            "title": "Performance Analysis",
            "contents": [
                {
                    "type": "section",
                    "title": "Execution Time vs Array Size",
                    "contents": [
                        {
                            "type": "plot",
                            "plot": {
                                "title": "Complexity",
                                "plot_types": ["scatter"],
                                "transformation": "performance",
                                "xaxis": { "parameter": "elements", "label": "N" },
                                "yaxis": { "label": "Execution time (s)" },
                                "color_axis": { "parameter": "algorithm", "label": "Algorithm" }
                            }
                        },
                        {
                            "type": "text",
                            "text": "This plot compares execution times for different sorting algorithms as the array size increases, highlighting differences in algorithmic complexity."
                        }
                    ]
                }
            ]
        }
    ]
}