Benchmarks
You may also want to:
Here, we collect solved instances of our portal's users. By allowing public publishing the results of your tasks,
they will automatically appear on the list.
All the computations are performed on the high-performance computer that is available at University of Ljubljana, Faculty of Mechanical Engineering.
There is an Intel Xeon X5670 (1536 hyper-cores) HPC cluster and an E5-2680 V3 (1008 hyper-cores) DP cluster, with IB QDR interconnection, 164 TB of LUSTRE storage,
4.6 TB RAM and with 24 TFlop/s performance.
|
Name
|
Function
|
Solution Type
|
Contributor
|
Nodes
|
Density
|
Solution
|
#Cores
|
Execution Time (s)
|
|
|
BiqBin task april 2021 (Inst. of Karate_club_sym_23 12 2020)
|
Stable set
|
Approximate
|
jpovh
|
0
|
0
|
|
48
|
0
|
|
|
BorutSS3 (Inst. of BorutSS3)
|
Stable set
|
Optimal
|
Borut
|
34
|
0.139
|
20
|
24
|
0.16
|
|
|
Compute max cut on graphs with opposite edge weights be100.10 (Graph_100_05_a)
Random graph on 100 nodes with density 0.05
|
Stable set
|
Optimal
|
jpovh
|
100
|
0.0489
|
43
|
48
|
3.71
|
|
|
Social_networks_karate (Inst. of Karate_club_sym_23 12 2020)
|
Stable set
|
Approximate
|
jpovh
|
0
|
0
|
|
48
|
0
|
|
|
Stable set experiment 2 (Inst. of Test stable set 21 2 2019)
|
Stable set
|
Optimal
|
jpovh
|
60
|
0.212
|
15
|
96
|
0.95
|
|
|
Stable set experiment 5 (Graph_100_05_a)
Random graph on 100 nodes with density 0.05
|
Stable set
|
Optimal
|
jpovh
|
100
|
0.0489
|
43
|
96
|
1.87
|
|
|
stable set test (Graph_100_05_a)
Random graph on 100 nodes with density 0.05
|
Stable set
|
Optimal
|
jpovh
|
100
|
0.0489
|
43
|
48
|
1.13
|
|
|
Test (Local Big)
|
Stable set
|
Optimal
|
Borut
|
200
|
0.395
|
13
|
96
|
1220
|
|