Chris Walshaw
 Teaching
 Research
 – JOSTLE
 – NetWorks
 – partition archive
 – publications
 Music
 Contact

Locations of visitors to this page

The Graph Partitioning Archive


NEWS: The Tenth DIMACS Implementation Challenge: Graph Partitioning and Graph Clustering has now finished. The Challenge book was published in 2013.


Welcome to the Graph Partitioning Archive. Hosted at the School of Computing & Mathematical Sciences, University of Greenwich, the archive consists of the best partitions found to date for a range of graphs and its aim is to provide a benchmark, against which partitioning algorithms can be tested, and a resource for experimentation.

The partition archive has been in operation since the year 2000 and includes results from most of the major graph partitioning software packages. Furthermore, researchers developing experimental partitioning algorithms regularly submit new partitions for possible inclusion. The software that has been used to produce partitions for the archive is listed below.

Most of the test graphs arise from typical partitioning applications, although the archive also includes results computed for a graph-colouring test suite [Wal04] contained in a separate annexe.

The archive was originally set up as part of a research project into very high quality partitions and authors wishing to refer to the partitioning archive should cite the paper [SWC04].

Acknowledgements: Initially the archive was set up using public domain software from a number of researchers including Bruce Hendrickson & Robert Leland (Sandia National Labs, USA), George Karypis & Vipin Kumar (Univ. Minnesota) and Stephen Barnard & Horst Simon (Cray Research Inc. / NASA Ames).

Subsequently, many researchers have submitted partitions including S. Popinet (NIWA Science, New Zealand); A. Kozhushkin (Program Systems Inst., Russia); R. Banos & C. Gil (Univ. Almeria, Spain); S. Wishko, A. Brandt & D. Ron (Weizmann Inst. Science, Israel); K. Lang & S. Rao (Yahoo! Research, USA); F. Comellas & E. Sapena (Univ. Pol. Catalunya, Spain); J. K. Martinsen & X.Cai (Univ. Oslo, Norway); J. Martin (Trinity College Dublin, Ireland); P. Chardaire, M. Barake & G. P. McKeown (Univ. East Anglia, UK); C.-E. Bichot (ENAC, Toulouse, France); H. Meyerhenke (Univ. Paderborn, Germany); C. Schulz (Univ. Karlsruhe, Germany); Mattias Hein (Univ. Saarland, Germany); Dale Wong; Ilya Safro (Argonne National Lab, USA); Jin-Kao Hao (Univ. Angers, France); Frank Schneider (Inform Software); Bruno Menegola (Federal Univ. Rio Grande do Sul, Brazil).


Contents


Problem definition

Let G = G(V,E) be an undirected graph of vertices V, with edges E. We assume that both vertices and edges can be weighted and that |v| denotes the weight of a vertex v and similarly for edges and sets of vertices and edges. However, it is often the case that vertices and edges are given unit weights, |v|=1 for all v in V and |e|=1 for all e in E and indeed so far this is true for all of the example graphs. A partition of the graph is a mapping of V into P disjoint subdomains S_p such that the union of S_p = V. The weight of a subdomain is just the sum of the weights of the vertices in the subdomain, |S_p| = sum |v| and the set of inter-subdomain or cut edges (i.e. edges cut by the partition) is denoted by E_c.

The usual objective of graph partitioning is to find a partition which evenly balances the vertex weight in each subdomain whilst minimising the total weight of cut edges or cut-weight, |E_c|. To evenly balance the vertex weight, the optimal subdomain weight is given by S_opt := ceil(|V|/P) (where the ceiling function ceil(x) returns the smallest integer greater than x). The graph partitioning problem can then be specified as: find a partition of G such that |E_c| is minimised subject to the constraint that |S_p| <= S_opt.

In fact it has been noted for some time that partition quality can often be improved if a certain amount of imbalance is allowed, [ST97]. The imbalance is defined as the maximum subdomain weight, S' = max |S_p|, divided by the optimal, S_opt. If we allow x% imbalance then the partitioning problem becomes: find a partition of G such that |E_c| is minimised subject to the constraint that |S_p| <= S_opt.(100+x)/100.

The graph partitioning problem arises in many applications such as VLSI circuit design, data mining and parallel computing. In the latter case the subdomains are mapped to processors and the cut-weight then approximates the total communication volume. However, there is some discussion about whether this is the most appropriate metric for partitioning, e.g. [HK00], and indeed it is unlikely that any one metric is appropriate. Currently in the archive, the quality of partitions is determined by cut-weight, however, there is no reason why it should not be extended to incorporate partitions which minimise different cost functions.

Back to top


Submissions

The archive welcomes submissions of partition files. Submitted partition files will be validated and added to the archive if they improve on a particular result. In this context improvement is:

  • having a lower cut-weight than the exisiting result whilst not exceeding the maximum subdomain weight; or
  • having the same cut-weight as an exisiting result but a smaller maximum subdomain weight; or
  • being a new result.
Files for submission should be made available on a web site or ftp site and a mail message indicating their presence sent to . If this is not possible the files may be mailed directly.

If there are several files to be submitted (more than 10) it is simplest if they are packaged up into a single file.

The files should conform to this archive's partition file naming convention and format:

  • The partition file naming convention is [graph name].[P].ptn, where P is the number of subdomains.
  • The format of the partition file is a list of |V| integers {p}, one per line, with 0 <= p < P and each integer, p, denotes the subdomain to which the corresponding vertex has been assigned (e.g. if the integer on line 200 of the file is 0 then, assuming vertex numbering starts at zero, vertex number 200 is in subdomain 0).

The easiest way for me to deal with them is if all the 0% results are put in a directory called 0, all the 1% results in a directory called 1, etc, and then all the directories compiled into a .tar.gz or .zip file.

Submitted files should also include some indication of how the partition was derived which, if a public domain software package, may be subject to verification. The archive reserves the right not to accepted submitted files (either for reasons of disk space or for other unspecified reasons).

Please note that updating the website with new partitions is not a high priority and so it make take a couple of months before I get a chance to do so. However, updates are always added in chronological order.

Back to top


Archived partitions

The best partitions found to date are listed in 4 tables corresponding to 0% imbalance (perfect balance), 1% imbalance, 3% imbalance and 5% imbalance. For each graph, partitions into 2, 4, 8, 16, 32 and 64 subdomains are given and have the format
C (S') [M]
where C is the cut-weight, S' is the weight of the largest subdomain and M is the method/software that produced the partition. The cut-weight also provides a link to the partition file (format as described above).

Back to top


Software

The software that produced the partitions is denoted as follows (listed more or less chronologically in the order that software was first developed and the results added to the archive)
AbbreviationSoftwareReference
GrdyFarhat's Greedy algorithm (as implemented within JOSTLE)[Far88]
RCBRecursive Coordinate Bisection (as implemented within JOSTLE)[Sim91]
MRSBBarnard & Simon's Multilevel Recursive Spectral Bisection[BS94]
Ch2.0CHACO - multilevel Kernighan-Lin (recursive bisection); version 2.0 (October 1995)[HL95]
pM4.0p-METIS - multilevel Kernighan-Lin (recursive bisection); available as part of METIS version 4.0 (September 1998)[KK98a]
kM4.0k-METIS - multilevel Kernighan-Lin (k-way); available as part of METIS version 4.0 (September 1998)[KK98b]
GTSStephane Popinet's multilevel implementation available as part of the GNU Triangulated Surface Library-
J2.2JOSTLE - multilevel Kernighan-Lin (k-way); version 2.2 (March 2000)[WC00]
iJiterated JOSTLE - iterated multilevel Kernighan-Lin (k-way)[Wal04]
JEJOSTLE Evolutionary - combined evolutionary/multilevel scheme[SWC04]
GrPartAlexander Kozhushkin's implementation of iterative multilevel Kernighan-Lin-
MLSATSMultiLevel refinated Mixed Simulated Annealing and Tabu Search[BGOM03]
AMGA bisection algorithm based on classical Algebraic MultiGrid from S. Wishko, A. Brandt and D. Ron-
MQIMax-flow Quotient-cut Improvement, a bisection algorithm from K. Lang & S. Rao, which uses many multiple tries and improves an initial partition provided by METIS[LR04]
SDPA semi-definite programming approach together with a max-flow algorithm from K. Lang & S. Rao-
mpM4.0Multiple runs (6561) of a randomised version of p-Metis; results provided by K. Lang & S. Rao-
AESANTS, a multiagent algorithm, from Francesc Comellas & Emili Sapena[CS05]
JKMSome new matching heuristics from Jan Kasper Martinsen & Xing Cai-
GCSVDGene Correlation with Singular Value Decomposition from Jacob Martin[Mar05]
PROBEA PROBE based heuristic from P. Chardaire, M. Barake, and G. P. McKeown[CBM07]
FFFusion Fission from Charles-Edmond Bichot-
NWNetWorks - a commercialised version of JOSTLE-
DiBaPDiffusion-Based Partitioning - a shape-optimising approach from Henning Meyerhenke, Stefan Schamberger, Burkhard Monien and Thomas Sauerwald[MMS08]
DWA confidential, commercial algorithm from Dale Wong-
KaPPaKaPPa - a new scalable high-quality multilevel partitioner from Manuel Holtgrewe, Peter Sanders and Christian Schulz[HSS09]
KasParKasPar - a new n-level multilevel partitioner from Vitaly Osipov and Peter Sanders[OS10]
KaFFPaKaFFPa - Karlsruhe Fast Flow Partitioner from Christian Schulz and Peter Sanders[SS10]
IPMNEIPMNE - Inverse Power Method for Nonlinear Eigenproblems from Matthias Hein and Thomas Bühler[HB10]
*+KFFP*+KFFP - uses KaFFPa from Christian Schulz and Peter Sanders to improve on existing results downloaded from this archive (including those already computed by KaFFPa)[SS10]
RCMGORelaxation-based coarsening and multiscale graph organization from D. Ron, I. Safro & A. Brandt[DSB11]
MMA01Initial version of a Multilevel Memetic Algorithm from Una Benlic & Jin-Kao Hao[BH10]
MMA02Improved version of a Multilevel Memetic Algorithm from Una Benlic & Jin-Kao Hao[BH11a]
MTSAA Multilevel Tabu Search Algorithm from Una Benlic & Jin-Kao Hao[BH11b]
IPMNE2IPMNE2 - a generalisation of the Inverse Power Method for Nonlinear Eigenproblems from Matthias Hein and Simon Setzer[HS11]
*+IPMNE2*+IPMNE2 - uses IPMNE2 from Matthias Hein and Simon Setzer to improve on existing results downloaded from this archive[HS11]
N/Anot available/recorded (probably JOSTLE Evolutionary)-
KaFFPaEKaFFPaE - Karlsruhe Fast Flow Partitioner Evolutionary from Christian Schulz and Peter Sanders[SS11]
FSMAGPAn implementation of MAGP from Frank Schneider-
KaBaPEKaBaPE - Karlsruhe Balanced Partitioner Evolutionary from Christian Schulz and Peter Sanders[SS12]
HYPALHYbrid k-way graph Partitioning ALgorithm from Bruno Menegola and Marcus Ritt (Federal University of Rio Grande do Sul, Brazil) - a hybrid GRASP with path-relinking and the multilevel algorithm of Osipov and Sanders (2010)-
KaBaPETKarlsruhe Balanced Partitioner Evolutionary incorporating Tabu search and the combine operator of MGAP from Christian Schulz and Peter Sanders[SS13]
Note that a certain amount of care needs to be taken with the attribution of a result to a particular method. For example the finan512 graph with P = 4 is attributed to CHACO 2.0 although an equivalent quality partition was also found by p-METIS, k-METIS, JOSTLE 2.2, JOSTLE Evolutionary, iterated JOSTLE and NetWorks. Attribution is thus given to the earliest method which found it but does not imply that an equivalent quality partition has not been found by a more recent method. The results were added into the archive in the order shown in the table (which is approximately the order in which the methods and software were developed). Furthermore, no account is taken of runtime in these tables; some of these codes may have taken many days to compute and evaluate multiple solutions, before arriving at the partitions shown, whilst others complete in fractions of a second.

Notes:

  • CHACO was run using the multilevel KL method with recursive bisection and a coarsening threshold of 200.
  • JOSTLE was run with the imbalance threshold set to 0%, 1%, 3% (default) and 5% (i.e. 4 different tests for each graph and value of P).
  • JOSTLE Evolutionary (JE) was run with the imbalance threshold set to 0% and 3% (i.e. 2 different tests for each graph and value of P). It was only tested in full on a subset of the graphs (add20, 3elt, uk, add32, whitaker3, crack, wing_nodal, fe_4elt2, vibrobox, 4elt, fe_sphere, cti, memplus, cs4, fe_pwt, bcsstk32, t60k, wing, brack2) although occasional JE attributions may be found for other graphs.

Back to top


References

BGOM03
R. Banos, C. Gil, J. Ortega, and F. G. Montoya. Multilevel Heuristic Algorithm for Graph Partitioning. In 3rd European Workshop on Evolutionary Computation in Combinatorial Optimization, volume 2611 of LNCS, pages 143-153. Springer, Berlin, 2003.

BH10
U. Benlic and J.-K. Hao. An Effective Multilevel Memetic Algorithm for Balanced Graph Partitioning. In Proc. 22nd IEEE Intl Conf. Tools with Artificial Intelligence, pages 121-128, 2010.

BH11a
U. Benlic and J.-K. Hao. A Multilevel Memetic Approach for Improving Graph k-Partitions. IEEE Trans. Evolutionary Computation, 2011. (to appear).

BH11b
U. Benlic and J.-K. Hao. An Effective Multilevel Tabu Search Approach for Balanced Graph Partitioning. Comput. Oper. Res., 38(7):1066-1075, 2011.

BS94
S. T. Barnard and H. D. Simon. A Fast Multilevel Implementation of Recursive Spectral Bisection for Partitioning Unstructured Problems. Concurrency: Practice & Experience, 6(2):101-117, 1994.

CBM07
P. Chardaire, M. Barake, and G. P. McKeown. A PROBE based heuristic for Graph Partitioning. (Submitted to IEEE Trans. Comp.), 2007.

CS05
F. Comellas and E. Sapena. A multiagent algorithm for graph partitioning. Tech. Rep. UPC-MA4-2005-05C-21, Univ. Politècnica de Catalunya, 2005.

Far88
C. Farhat. A Simple and Efficient Automatic FEM Domain Decomposer. Comput. & Structures, 28(5):579-602, 1988.

HB10
M. Hein and T. Bühler. An Inverse Power Method for Nonlinear Eigenproblems with Applications in 1-Spectral Clustering and Sparse PCA. Machine Learning Group, Saarland Univ., 2010.

HK00
B. Hendrickson and T. G. Kolda. Graph Partitioning Models for Parallel Computing. Parallel Comput., 26(12):1519-1534, 2000.

HL95
B. Hendrickson and R. Leland. A Multilevel Algorithm for Partitioning Graphs. In S. Karin, editor, Proc. Supercomputing '95, San Diego (CD-ROM). ACM Press, New York, 1995.

HS11
M. Hein and S. Setzer. Beyond Spectral Clustering - Tight Relaxations of Balanced Graph Cuts. (accepted for NIPS 2011), 2011.

HSS09
M. Holtgrewe, P. Sanders, and C. Schulz. Engineering a Scalable High Quality Graph Partitioner. Tech. Rep., 2009.

KK98a
G. Karypis and V. Kumar. A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs. SIAM J. Sci. Comput., 20(1):359-392, 1998.

KK98b
G. Karypis and V. Kumar. Multilevel k-way Partitioning Scheme for Irregular Graphs. J. Parallel Distrib. Comput., 48(1):96-129, 1998.

LR04
K. Lang and S. Rao. A flow-based method for improving the expansion or conductance of graph cuts. 2004.

Mar05
J. Martin. Subproblem Optimization by Gene Correlation with Singular Value Decomposition. In Proc. Genetic & Evolutionary Comput. Conf. (GECCO-2005). ACM, 2005.

MMS08
H. Meyerhenke, B. Monien, and T. Sauerwald. A new diffusion-based multilevel algorithm for computing graph partitions of very high quality. In Proc. 22nd IEEE Intl. Parallel & Distributed Processing Symp. (IPDPS'08), 2008. (To appear).

OS10
V. Osipov and P. Sanders. n-Level Graph Partitioning. Inst. Theoretische Informatik, Univ. Karlsruhe, 2010.

RSB11
D. Ron, I. Safro, and A. Brandt. Relaxation-based coarsening and multiscale graph organization. SIAM J. Multiscale Modeling Simulations, 9:407-423, 2011.

Sim91
H. D. Simon. Partitioning of Unstructured Problems for Parallel Processing. Computing Systems Engrg., 2:135-148, 1991.

SS10
P. Sanders and C. Schulz. Engineering Multilevel Graph Partitioning Algorithms. Inst. Theoretische Informatik, Univ. Karlsruhe, 2010.

SS11
P. Sanders and C. Schulz. Distributed Evolutionary Graph Partitioning. Inst. Theoretische Informatik, Univ. Karlsruhe, 2011.

SS12
P. Sanders and C. Schulz. Think Locally, Act Globally: Perfectly Balanced Graph Partitioning. Inst. Theoretische Informatik, Univ. Karlsruhe, 2012.

SS13
P. Sanders and C. Schulz. Think Locally, Act Globally: Highly Balanced Graph Partitioning. In Experimental Algorithms, volume 7933 of LNCS, pages 164-175. Springer, Berlin, 2013.

ST97
H. D. Simon and S.-H. Teng. How Good is Recursive Bisection? SIAM J. Sci. Comput., 18(5):1436-1445, 1997.

SWC04
A. J. Soper, C. Walshaw, and M. Cross. A Combined Evolutionary Search and Multilevel Optimisation Approach to Graph Partitioning. J. Global Optimization, 29(2):225-241, 2004.

Wal04
C. Walshaw. Multilevel Refinement for Combinatorial Optimisation Problems. Annals Oper. Res., 131:325-372, 2004.

WC00
C. Walshaw and M. Cross. Mesh Partitioning: a Multilevel Balancing and Refinement Algorithm. SIAM J. Sci. Comput., 22(1):63-80, 2000.

Back to top


Test Graphs

The test graphs are taken from various sources and listed in the table below. Graphs for which the original source is bracketted appear to be no longer available at that site. However all the graph files are also available from this site converted into a standard format. This format is the same as used by JOSTLE, CHACO & METIS and is described in the JOSTLE userguide.

graph |V| |E| original / alternative source
add20 2395 7462 www.cise.ufl.edu/research/sparse/matrices/Hamm/add20.html
data 2851 15093 staffweb.cms.gre.ac.uk/~c.walshaw/partition/archive/data/data.graph
3elt 4720 13722 (ftp://riacs.edu/pub/grids/3elt.grid.gz)
uk 4824 6837 staffweb.cms.gre.ac.uk/~c.walshaw/partition/archive/uk/uk.graph
add32 4960 9462 www.cise.ufl.edu/research/sparse/matrices/Hamm/add32.html
bcsstk33 8738 291583 www.cise.ufl.edu/research/sparse/matrices/HB/bcsstk33.html
whitaker3 9800 28989 (ftp://riacs.edu/pub/grids/whitaker3.grid.gz)
crack 10240 30380 www2.cs.uni-paderborn.de/fachbereich/AG/monien/RESEARCH/PART/GRAPHS/FEM2.tar
wing_nodal 10937 75488 staffweb.cms.gre.ac.uk/~c.walshaw/partition/archive/wing_nodal/wing_nodal.graph
fe_4elt2 11143 32818 wotug.org/parallel/libraries/communication/scotch/Graphs/fe_4elt2.src.gz
vibrobox 12328 165250 www.cise.ufl.edu/research/sparse/matrices/Cote/vibrobox.html
bcsstk29 13992 302748 www.cise.ufl.edu/research/sparse/matrices/HB/bcsstk29.html
4elt 15606 45878 www.cise.ufl.edu/research/sparse/matrices/Pothen/barth5.html
fe_sphere 16386 49152 wotug.org/parallel/libraries/communication/scotch/Graphs/fe_sphere.src.gz
cti 16840 48232 staffweb.cms.gre.ac.uk/~c.walshaw/partition/archive/cti/cti.graph
memplus 17758 54196 www.cise.ufl.edu/research/sparse/matrices/Hamm/memplus.html
cs4 22499 43858 staffweb.cms.gre.ac.uk/~c.walshaw/partition/archive/cs4/cs4.graph
bcsstk30 28924 1007284 www.cise.ufl.edu/research/sparse/matrices/HB/bcsstk30.html
bcsstk31 35588 572914 www.cise.ufl.edu/research/sparse/matrices/HB/bcsstk31.html
fe_pwt 36519 144794 wotug.org/parallel/libraries/communication/scotch/Graphs/fe_pwt.src.gz
bcsstk32 44609 985046 www.cise.ufl.edu/research/sparse/matrices/HB/bcsstk32.html
fe_body 45087 163734 wotug.org/parallel/libraries/communication/scotch/Graphs/fe_body.src.gz
t60k 60005 89440 staffweb.cms.gre.ac.uk/~c.walshaw/partition/archive/t60k/t60k.graph
wing 62032 121544 staffweb.cms.gre.ac.uk/~c.walshaw/partition/archive/wing/wing.graph
brack2 62631 366559 (ftp://riacs.edu/pub/grids/brack2.grid.gz)
finan512 74752 261120 www.cise.ufl.edu/research/sparse/matrices/Mulvey/finan512.html
fe_tooth 78136 452591 wotug.org/parallel/libraries/communication/scotch/Graphs/fe_tooth.src.gz
fe_rotor 99617 662431 wotug.org/parallel/libraries/communication/scotch/Graphs/fe_rotor.src.gz
598a 110971 741934 (ftp://ftp.cs.umn.edu/users/kumar/Graphs/598a.graph.gz)
fe_ocean 143437 409593 wotug.org/parallel/libraries/communication/scotch/Graphs/fe_ocean.src.gz
144 144649 1074393 (ftp://ftp.cs.umn.edu/users/kumar/Graphs/144.graph.gz)
wave 156317 1059331 (ftp://riacs.edu/pub/grids/wave.grid.gz)
m14b 214765 1679018 (ftp://ftp.cs.umn.edu/users/kumar/Graphs/m14b.graph.gz)
auto 448695 3314611 (ftp://ftp.cs.umn.edu/users/kumar/Graphs/auto.graph.gz)

Back to top


Results with up to 0% imbalance
S_max <= 1.00 x S_opt

graph 2 4 8 16 32 64
add20 596 (1198) [PROBE] 1154 (599) [*+IPMNE2] 1686 (300) [*+IPMNE2] 2047 (150) [*+IPMNE2] 2362 (75) [*+IPMNE2] 2959 (38) [KaBaPET]
data 189 (1426) [PROBE] 382 (713) [MMA02] 668 (357) [FSMAGP] 1127 (179) [FSMAGP] 1799 (90) [FSMAGP] 2839 (45) [FSMAGP]
3elt 90 (2360) [JE] 201 (1180) [JE] 345 (590) [FSMAGP] 573 (295) [FSMAGP] 960 (148) [FSMAGP] 1532 (74) [FSMAGP]
uk 19 (2412) [IPMNE] 41 (1206) [MMA01] 84 (603) [KaBaPE] 146 (302) [KaBaPE] 254 (151) [KaBaPE] 408 (76) [KaBaPE]
add32 11 (2480) [Ch2.0] 34 (1240) [FF] 67 (620) [FSMAGP] 118 (310) [FSMAGP] 213 (155) [FSMAGP] 485 (78) [KaBaPET]
bcsstk33 10171 (4369) [GCSVD] 21717 (2185) [FSMAGP] 34437 (1093) [FSMAGP] 54680 (547) [FSMAGP] 77414 (274) [FSMAGP] 107247 (137) [*+IPMNE2]
whitaker3 127 (4900) [JE] 381 (2450) [FSMAGP] 656 (1225) [KaBaPE] 1088 (613) [KaBaPET] 1668 (307) [KaBaPE] 2491 (154) [FSMAGP]
crack 184 (5120) [JE] 366 (2560) [MMA02] 679 (1280) [MMA02] 1088 (640) [KaBaPET] 1679 (320) [FSMAGP] 2541 (160) [KaBaPET]
wing_nodal 1707 (5469) [JE] 3575 (2735) [FSMAGP] 5435 (1368) [FSMAGP] 8334 (684) [FSMAGP] 11768 (342) [FSMAGP] 15775 (171) [FSMAGP]
fe_4elt2 130 (5572) [MRSB] 349 (2786) [JE] 607 (1393) [KaBaPE] 1007 (697) [KaBaPE] 1614 (349) [KaBaPE] 2478 (175) [FSMAGP]
vibrobox 10343 (6164) [JE] 18976 (3082) [FSMAGP] 24484 (1541) [FSMAGP] 31892 (771) [*+IPMNE2] 39477 (386) [FSMAGP] 46653 (193) [*+IPMNE2]
bcsstk29 2843 (6996) [mpM4.0] 8035 (3498) [FSMAGP] 13986 (1749) [*+IPMNE2] 21958 (875) [*+IPMNE2] 34968 (438) [*+IPMNE2] 55521 (219) [*+IPMNE2]
4elt 139 (7803) [JE] 326 (3902) [NW] 545 (1951) [MMA01] 934 (976) [FSMAGP] 1551 (488) [FSMAGP] 2566 (244) [KaBaPET]
fe_sphere 386 (8193) [JE] 768 (4097) [KaBaPE] 1156 (2049) [FSMAGP] 1714 (1025) [KaBaPET] 2490 (513) [KaBaPET] 3547 (257) [KaBaPET]
cti 334 (8420) [JE] 954 (4210) [MMA02] 1788 (2105) [FSMAGP] 2793 (1053) [FSMAGP] 4049 (527) [KaBaPET] 5630 (264) [*+IPMNE2]
memplus 5513 (8879) [PROBE] 9448 (4440) [*+IPMNE2] 11712 (2220) [*+IPMNE2] 12895 (1110) [*+IPMNE2] 13953 (555) [*+IPMNE2] 16223 (278) [*+IPMNE2]
cs4 369 (11250) [KaBaPE] 932 (5625) [*+IPMNE2] 1440 (2813) [KaBaPE] 2075 (1407) [KaBaPET] 2928 (704) [*+IPMNE2] 4027 (352) [KaBaPE]
bcsstk30 6394 (14462) [JE] 16651 (7231) [FSMAGP] 34846 (3616) [FSMAGP] 70440 (1808) [*+IPMNE2] 113443 (904) [*+IPMNE2] 171279 (452) [*+IPMNE2]
bcsstk31 2762 (17794) [PROBE] 7351 (8897) [KaBaPE] 13285 (4449) [*+IPMNE2] 23869 (2225) [*+IPMNE2] 37158 (1113) [KaBaPET] 57402 (557) [*+IPMNE2]
fe_pwt 340 (18260) [GrPart] 705 (9130) [FSMAGP] 1447 (4565) [FSMAGP] 2830 (2283) [*+IPMNE2] 5575 (1142) [KaBaPE] 8202 (571) [KaBaPET]
bcsstk32 4667 (22305) [JE] 9314 (11153) [KaBaPE] 20070 (5577) [*+IPMNE2] 36250 (2789) [*+IPMNE2] 60038 (1395) [*+IPMNE2] 90895 (698) [*+IPMNE2]
fe_body 262 (22544) [MQI] 599 (11272) [KaBaPE] 1033 (5636) [*+IPMNE2] 1736 (2818) [*+IPMNE2] 2846 (1409) [*+IPMNE2] 4801 (705) [*+IPMNE2]
t60k 79 (30003) [NW] 209 (15002) [KaBaPE] 456 (7501) [KaBaPE] 813 (3751) [KaBaPE] 1323 (1876) [*+IPMNE2] 2077 (938) [KaBaPE]
wing 789 (31016) [KaBaPE] 1623 (15508) [*+IPMNE2] 2504 (7754) [KaBaPE] 3876 (3877) [KaBaPET] 5594 (1939) [KaBaPE] 7625 (970) [*+IPMNE2]
brack2 731 (31316) [JE] 3084 (15658) [MMA02] 7140 (7829) [FSMAGP] 11644 (3915) [KaBaPE] 17387 (1958) [KaBaPET] 25808 (979) [FSMAGP]
finan512 162 (37376) [Ch2.0] 324 (18688) [Ch2.0] 648 (9344) [Ch2.0] 1296 (4672) [Ch2.0] 2592 (2336) [Ch2.0] 10560 (1168) [NW]
fe_tooth 3816 (39068) [FSMAGP] 6889 (19534) [KaBaPE] 11418 (9767) [KaBaPE] 17355 (4884) [KaBaPET] 24885 (2442) [FSMAGP] 34240 (1221) [FSMAGP]
fe_rotor 2098 (49809) [PROBE] 7222 (24905) [KaBaPE] 12841 (12453) [*+IPMNE2] 20391 (6227) [FSMAGP] 31141 (3114) [*+IPMNE2] 45687 (1557) [*+IPMNE2]
598a 2398 (55486) [PROBE] 8001 (27743) [FSMAGP] 15922 (13872) [FSMAGP] 25702 (6936) [KaBaPET] 38581 (3468) [*+IPMNE2] 56097 (1734) [*+IPMNE2]
fe_ocean 464 (71719) [PROBE] 1882 (35860) [FSMAGP] 4188 (17930) [KaBaPET] 7713 (8965) [FSMAGP] 12684 (4483) [*+IPMNE2] 20069 (2242) [*+IPMNE2]
144 6486 (72325) [IPMNE2] 15196 (36163) [*+IPMNE2] 25288 (18082) [KaBaPE] 37571 (9041) [FSMAGP] 55475 (4521) [*+IPMNE2] 77402 (2261) [*+IPMNE2]
wave 8677 (78159) [KaBaPE] 17241 (39080) [*+IPMNE2] 29198 (19540) [*+IPMNE2] 42646 (9770) [KaBaPET] 61108 (4885) [*+IPMNE2] 83994 (2443) [*+IPMNE2]
m14b 3836 (107383) [MQI] 13062 (53692) [*+IPMNE2] 25838 (26846) [*+IPMNE2] 42172 (13423) [*+IPMNE2] 65529 (6712) [*+IPMNE2] 96452 (3356) [*+IPMNE2]
auto 10103 (224348) [FSMAGP] 27094 (112174) [FSMAGP] 46014 (56087) [*+IPMNE2] 77418 (28044) [*+IPMNE2] 121944 (14022) [*+IPMNE2] 172973 (7011) [*+IPMNE2]

Back to top


Results with up to 1% imbalance
S_max <= 1.01 x S_opt

graph 2 4 8 16 32 64
add20 585 (1209) [HYPAL] 1147 (604) [HYPAL] 1685 (302) [HYPAL] 2042 (151) [*+IPMNE2] 2362 (75) [*+IPMNE2] 2959 (38) [KaBaPET]
data 188 (1438) [AMG] 376 (720) [FSMAGP] 656 (360) [KaFFPaE] 1121 (180) [FSMAGP] 1799 (90) [FSMAGP] 2839 (45) [FSMAGP]
3elt 89 (2382) [GrPart] 199 (1185) [NW] 340 (595) [KaFFPaE] 568 (297) [KaFFPaE] 953 (149) [KaBaPET] 1532 (74) [FSMAGP]
uk 19 (2412) [IPMNE] 40 (1215) [*+KFFP] 80 (607) [FSMAGP] 144 (303) [*+IPMNE2] 249 (152) [KaBaPE] 408 (76) [KaBaPE]
add32 10 (2481) [J2.2] 33 (1241) [JE] 66 (621) [FF] 117 (311) [JE] 212 (156) [JE] 485 (78) [KaBaPET]
bcsstk33 10097 (4412) [FF] 21338 (2206) [FSMAGP] 34175 (1103) [FSMAGP] 54505 (552) [FSMAGP] 77195 (276) [FSMAGP] 106927 (138) [*+IPMNE2]
whitaker3 126 (4908) [JE] 380 (2454) [NW] 654 (1237) [KaFFPaE] 1083 (619) [KaBaPET] 1667 (310) [KaBaPE] 2480 (155) [KaBaPET]
crack 183 (5137) [NW] 362 (2581) [FSMAGP] 676 (1291) [FSMAGP] 1081 (646) [FSMAGP] 1669 (323) [FSMAGP] 2523 (161) [FSMAGP]
wing_nodal 1695 (5520) [*+KFFP] 3559 (2762) [FSMAGP] 5401 (1381) [FSMAGP] 8302 (690) [FSMAGP] 11733 (345) [FSMAGP] 15736 (172) [FSMAGP]
fe_4elt2 130 (5572) [MRSB] 349 (2786) [JE] 603 (1406) [KaFFPaE] 1000 (703) [KaBaPE] 1608 (352) [KaBaPE] 2472 (176) [FSMAGP]
vibrobox 10310 (6184) [JE] 18943 (3112) [FSMAGP] 24422 (1556) [KaFFPaE] 31764 (778) [*+IPMNE2] 39413 (389) [*+IPMNE2] 46541 (194) [FSMAGP]
bcsstk29 2818 (7008) [GrPart] 8029 (3528) [*+KFFP] 13891 (1764) [FSMAGP] 21694 (882) [FSMAGP] 34699 (442) [*+IPMNE2] 55102 (221) [*+IPMNE2]
4elt 138 (7844) [GrPart] 320 (3939) [*+KFFP] 532 (1970) [KaFFPaE] 927 (984) [FSMAGP] 1535 (492) [KaBaPET] 2547 (246) [KaBaPET]
fe_sphere 386 (8193) [JE] 766 (4130) [KaFFPa] 1152 (2060) [JE] 1708 (1034) [FSMAGP] 2479 (518) [FSMAGP] 3534 (259) [FSMAGP]
cti 318 (8480) [JE] 944 (4248) [NW] 1746 (2126) [FSMAGP] 2763 (1063) [KaBaPET] 3997 (532) [KaBaPET] 5594 (266) [FSMAGP]
memplus 5457 (8967) [HYPAL] 9385 (4484) [*+IPMNE2] 11672 (2242) [*+IPMNE2] 12873 (1121) [*+IPMNE2] 13933 (560) [*+IPMNE2] 16110 (280) [*+IPMNE2]
cs4 366 (11325) [KaFFPa] 925 (5674) [*+IPMNE2] 1434 (2837) [*+IPMNE2] 2061 (1421) [*+IPMNE2] 2903 (711) [KaBaPE] 3982 (355) [KaBaPE]
bcsstk30 6335 (14603) [GrPart] 16583 (7303) [FSMAGP] 34565 (3652) [FSMAGP] 69915 (1826) [KaBaPE] 112901 (913) [*+IPMNE2] 170346 (456) [*+IPMNE2]
bcsstk31 2699 (17970) [KaFFPa] 7272 (8985) [*+IPMNE2] 13141 (4493) [*+IPMNE2] 23376 (2247) [*+IPMNE2] 37077 (1124) [KaBaPET] 57025 (562) [*+IPMNE2]
fe_pwt 340 (18260) [GrPart] 704 (9190) [KasPar] 1432 (4610) [FSMAGP] 2797 (2304) [FSMAGP] 5514 (1153) [KaBaPE] 8130 (576) [KaBaPET]
bcsstk32 4667 (22305) [JE] 9181 (11261) [KaBaPET] 19624 (5632) [*+IPMNE2] 35617 (2816) [*+IPMNE2] 59504 (1408) [KaBaPET] 89905 (704) [*+IPMNE2]
fe_body 262 (22544) [MQI] 598 (11274) [*+IPMNE2] 1023 (5692) [KaBaPE] 1714 (2834) [*+IPMNE2] 2756 (1423) [*+IPMNE2] 4709 (712) [*+IPMNE2]
t60k 75 (30288) [KaFFPa] 208 (15067) [*+KFFP] 454 (7564) [*+KFFP] 805 (3786) [*+IPMNE2] 1313 (1894) [KaBaPE] 2062 (947) [KaBaPE]
wing 784 (31320) [*+KFFP] 1610 (15609) [*+IPMNE2] 2474 (7828) [*+IPMNE2] 3857 (3913) [*+IPMNE2] 5577 (1954) [*+IPMNE2] 7586 (978) [*+IPMNE2]
brack2 708 (31614) [GrPart] 3013 (15813) [KaFFPa] 7029 (7907) [FSMAGP] 11492 (3954) [FSMAGP] 17128 (1977) [KaBaPET] 25607 (988) [*+IPMNE2]
finan512 162 (37376) [Ch2.0] 324 (18688) [Ch2.0] 648 (9344) [Ch2.0] 1296 (4672) [Ch2.0] 2592 (2336) [Ch2.0] 10560 (1168) [NW]
fe_tooth 3814 (39455) [FSMAGP] 6844 (19714) [*+IPMNE2] 11358 (9864) [KaBaPET] 17265 (4932) [KaBaPE] 24804 (2466) [KaBaPET] 34170 (1233) [*+IPMNE2]
fe_rotor 2031 (50306) [KaFFPa] 7158 (25150) [KaBaPET] 12616 (12576) [*+IPMNE2] 20152 (6289) [*+IPMNE2] 30982 (3145) [*+IPMNE2] 45321 (1572) [*+IPMNE2]
598a 2388 (55856) [MQI] 7948 (28017) [*+IPMNE2] 15831 (14007) [*+IPMNE2] 25624 (7005) [KaBaPE] 38422 (3502) [*+IPMNE2] 55882 (1751) [*+IPMNE2]
fe_ocean 387 (72425) [GrPart] 1813 (36217) [FSMAGP] 4063 (18106) [*+IPMNE2] 7616 (9054) [*+IPMNE2] 12524 (4527) [*+IPMNE2] 19852 (2264) [*+IPMNE2]
144 6478 (72985) [IPMNE2] 15140 (36451) [*+IPMNE2] 25232 (18260) [*+IPMNE2] 37347 (9129) [*+IPMNE2] 55277 (4566) [*+IPMNE2] 76980 (2283) [*+IPMNE2]
wave 8657 (78940) [KaBaPE] 16747 (39469) [*+IPMNE2] 28758 (19735) [KaBaPE] 42354 (9867) [KaBaPE] 60625 (4933) [*+IPMNE2] 83466 (2467) [*+IPMNE2]
m14b 3826 (107831) [MQI] 12973 (54228) [KaFFPaE] 25627 (27106) [*+IPMNE2] 42080 (13556) [*+IPMNE2] 64697 (6779) [*+IPMNE2] 96169 (3389) [*+IPMNE2]
auto 9949 (226588) [KaFFPaE] 26614 (113294) [*+IPMNE2] 45429 (56647) [*+IPMNE2] 76539 (28324) [*+IPMNE2] 120489 (14162) [*+IPMNE2] 171880 (7081) [KaBaPE]

Back to top


Results with up to 3% imbalance
S_max <= 1.03 x S_opt

graph 2 4 8 16 32 64
add20 560 (1233) [IPMNE2] 1134 (616) [HYPAL] 1673 (308) [HYPAL] 2030 (154) [KaBaPET] 2346 (77) [KaBaPET] 2923 (39) [KaBaPET]
data 185 (1460) [KaFFPa] 369 (734) [KaFFPa] 638 (367) [*+KFFP] 1088 (184) [FSMAGP] 1768 (92) [FSMAGP] 2783 (46) [FSMAGP]
3elt 87 (2398) [JE] 198 (1213) [NW] 334 (607) [KaFFPaE] 561 (303) [KaFFPaE] 944 (152) [FSMAGP] 1512 (76) [FSMAGP]
uk 18 (2455) [JE] 39 (1238) [*+KFFP] 78 (617) [*+IPMNE2] 139 (310) [*+IPMNE2] 240 (155) [KaFFPaE] 397 (78) [KaBaPE]
add32 10 (2481) [J2.2] 33 (1241) [JE] 66 (621) [FF] 117 (311) [JE] 212 (156) [JE] 476 (80) [*+IPMNE2]
bcsstk33 10064 (4419) [AMG] 20762 (2250) [FSMAGP] 34065 (1125) [FSMAGP] 54354 (563) [FSMAGP] 76749 (282) [*+IPMNE2] 105765 (141) [*+IPMNE2]
whitaker3 126 (4908) [JE] 378 (2510) [NW] 649 (1261) [KaBaPE] 1073 (631) [KaBaPET] 1653 (316) [KaBaPET] 2459 (158) [FSMAGP]
crack 182 (5187) [NW] 360 (2606) [NW] 671 (1317) [KaFFPaE] 1070 (659) [KaBaPET] 1656 (329) [KaBaPET] 2490 (164) [KaBaPET]
wing_nodal 1678 (5631) [FSMAGP] 3534 (2816) [FSMAGP] 5360 (1408) [FSMAGP] 8244 (704) [FSMAGP] 11632 (352) [FSMAGP] 15613 (176) [FSMAGP]
fe_4elt2 130 (5572) [MRSB] 341 (2863) [FSMAGP] 595 (1433) [*+IPMNE2] 990 (717) [KaBaPE] 1593 (359) [KaBaPE] 2435 (180) [FSMAGP]
vibrobox 10310 (6184) [JE] 18736 (3174) [KaFFPaE] 24153 (1587) [KaBaPE] 31443 (794) [*+IPMNE2] 39201 (397) [FSMAGP] 46298 (198) [*+IPMNE2]
bcsstk29 2818 (7008) [GrPart] 7971 (3600) [KaFFPaE] 13710 (1801) [*+IPMNE2] 21258 (901) [FSMAGP] 33831 (451) [KaBaPET] 54479 (225) [*+IPMNE2]
4elt 137 (8003) [NW] 319 (3951) [NW] 522 (2009) [KaFFPaE] 901 (1005) [KaBaPET] 1519 (502) [KaBaPE] 2512 (251) [KaBaPET]
fe_sphere 384 (8289) [JE] 764 (4194) [FSMAGP] 1152 (2060) [JE] 1696 (1055) [FSMAGP] 2462 (528) [KaBaPET] 3506 (264) [KaBaPET]
cti 318 (8480) [JE] 916 (4336) [KaFFPa] 1714 (2164) [*+KFFP] 2727 (1084) [KaBaPET] 3944 (542) [KaBaPET] 5524 (271) [FSMAGP]
memplus 5353 (9145) [*+KFFP] 9309 (4573) [*+IPMNE2] 11586 (2286) [*+IPMNE2] 12835 (1143) [*+IPMNE2] 13904 (571) [*+IPMNE2] 15953 (286) [*+IPMNE2]
cs4 360 (11544) [KaFFPa] 917 (5790) [*+IPMNE2] 1424 (2894) [*+IPMNE2] 2043 (1449) [KaBaPET] 2885 (725) [KaBaPE] 3980 (359) [*+IPMNE2]
bcsstk30 6251 (14679) [JE] 16372 (7447) [KaBaPE] 34137 (3715) [FSMAGP] 69386 (1862) [KaBaPET] 110687 (931) [*+IPMNE2] 168274 (465) [*+IPMNE2]
bcsstk31 2676 (18086) [IPMNE2] 7148 (9163) [*+IPMNE2] 12962 (4582) [*+IPMNE2] 22956 (2291) [KaBaPET] 36587 (1146) [*+IPMNE2] 56038 (573) [*+IPMNE2]
fe_pwt 340 (18260) [GrPart] 700 (9370) [KaFFPaE] 1410 (4700) [KaFFPaE] 2754 (2351) [FSMAGP] 5403 (1176) [KaBaPE] 8036 (588) [FSMAGP]
bcsstk32 4667 (22305) [JE] 8725 (11487) [KaFFPaE] 19485 (5716) [*+IPMNE2] 34875 (2872) [KaBaPET] 58740 (1436) [*+IPMNE2] 89512 (718) [*+IPMNE2]
fe_body 262 (22544) [MQI] 598 (11274) [*+IPMNE2] 1016 (5787) [*+IPMNE2] 1693 (2902) [KaBaPET] 2709 (1451) [KaBaPE] 4523 (726) [*+IPMNE2]
t60k 71 (30744) [*+KFFP] 203 (15372) [*+KFFP] 449 (7635) [*+IPMNE2] 792 (3862) [KaBaPET] 1302 (1932) [KaBaPE] 2036 (966) [KaBaPE]
wing 773 (31928) [*+KFFP] 1593 (15956) [*+IPMNE2] 2451 (7976) [*+IPMNE2] 3784 (3993) [KaBaPE] 5559 (1993) [*+IPMNE2] 7560 (997) [*+IPMNE2]
brack2 684 (32168) [JE] 2834 (16126) [KaFFPa] 6781 (8063) [KaBaPE] 11256 (4032) [*+IPMNE2] 16982 (2016) [KaBaPET] 25363 (1008) [*+IPMNE2]
finan512 162 (37376) [Ch2.0] 324 (18688) [Ch2.0] 648 (9344) [Ch2.0] 1296 (4672) [Ch2.0] 2592 (2336) [Ch2.0] 10560 (1168) [NW]
fe_tooth 3788 (40233) [IPMNE2] 6756 (20120) [KaBaPE] 11241 (10060) [KaBaPE] 17108 (5030) [KaBaPE] 24625 (2515) [*+IPMNE2] 33795 (1257) [*+IPMNE2]
fe_rotor 1959 (51044) [IPMNE2] 7050 (25652) [KaBaPE] 12445 (12824) [*+IPMNE2] 19867 (6413) [KaBaPET] 30587 (3207) [KaBaPET] 44822 (1603) [*+IPMNE2]
598a 2367 (56705) [MQI] 7816 (28573) [*+IPMNE2] 15613 (14287) [KaFFPaE] 25380 (7144) [*+IPMNE2] 38105 (3572) [*+IPMNE2] 55364 (1786) [*+IPMNE2]
fe_ocean 311 (73322) [GrPart] 1693 (36802) [FSMAGP] 3920 (18449) [KaFFPaE] 7405 (9233) [FSMAGP] 12288 (4617) [*+IPMNE2] 19518 (2309) [*+IPMNE2]
144 6432 (74491) [IPMNE2] 15064 (37244) [*+IPMNE2] 24905 (18624) [*+IPMNE2] 37003 (9312) [KaBaPET] 54806 (4656) [*+IPMNE2] 76557 (2328) [*+IPMNE2]
wave 8591 (80502) [KaFFPaE] 16638 (40251) [*+IPMNE2] 28494 (20126) [KaBaPE] 42139 (10063) [*+IPMNE2] 60356 (5031) [*+IPMNE2] 82811 (2516) [*+IPMNE2]
m14b 3823 (108879) [MQI] 12948 (54847) [*+IPMNE2] 25390 (27650) [KaFFPaE] 41778 (13823) [*+IPMNE2] 64364 (6913) [*+IPMNE2] 95587 (3456) [*+IPMNE2]
auto 9673 (231074) [KaFFPaE] 25789 (115538) [KaFFPaE] 44732 (57769) [*+IPMNE2] 75679 (28883) [*+IPMNE2] 119132 (14442) [*+IPMNE2] 170314 (7221) [*+IPMNE2]

Back to top


Results with up to 5% imbalance
S_max <= 1.05 x S_opt

graph 2 4 8 16 32 64
add20 536 (1256) [IPMNE2] 1120 (628) [*+IPMNE2] 1657 (314) [HYPAL] 2028 (157) [*+IPMNE2] 2342 (78) [KaBaPET] 2923 (39) [KaBaPET]
data 181 (1497) [SDP] 363 (745) [KaFFPa] 628 (374) [NW] 1076 (187) [FSMAGP] 1743 (94) [FSMAGP] 2747 (47) [KaBaPET]
3elt 87 (2398) [JE] 197 (1237) [NW] 329 (619) [KaFFPaE] 557 (309) [KaFFPaE] 930 (155) [FSMAGP] 1498 (77) [KaBaPET]
uk 18 (2455) [JE] 39 (1238) [*+KFFP] 75 (633) [KaFFPaE] 137 (315) [*+IPMNE2] 236 (158) [KaBaPE] 394 (79) [KaBaPE]
add32 10 (2481) [J2.2] 33 (1241) [JE] 63 (650) [KasPar] 117 (311) [JE] 212 (156) [JE] 476 (80) [*+IPMNE2]
bcsstk33 9914 (4554) [iJ] 20158 (2294) [FSMAGP] 33908 (1147) [FSMAGP] 54119 (574) [FSMAGP] 76079 (287) [*+IPMNE2] 105338 (143) [*+IPMNE2]
whitaker3 126 (4908) [JE] 376 (2546) [FSMAGP] 644 (1283) [*+IPMNE2] 1068 (643) [KaBaPET] 1632 (322) [KaBaPET] 2438 (161) [KaBaPET]
crack 182 (5187) [NW] 360 (2606) [NW] 666 (1343) [KaFFPaE] 1063 (671) [FSMAGP] 1655 (335) [*+KFFP] 2490 (164) [KaBaPET]
wing_nodal 1668 (5742) [SDP] 3520 (2869) [FSMAGP] 5339 (1436) [FSMAGP] 8160 (718) [FSMAGP] 11536 (359) [FSMAGP] 15515 (179) [FSMAGP]
fe_4elt2 130 (5572) [MRSB] 335 (2918) [FSMAGP] 578 (1462) [KaFFPaE] 979 (731) [FSMAGP] 1571 (366) [*+IPMNE2] 2415 (183) [KaBaPET]
vibrobox 10310 (6184) [JE] 18690 (3235) [FSMAGP] 23924 (1618) [KaFFPaE] 31232 (809) [*+IPMNE2] 38848 (405) [*+IPMNE2] 46094 (202) [*+IPMNE2]
bcsstk29 2818 (7008) [GrPart] 7925 (3672) [KaFFPaE] 13540 (1830) [KaFFPaE] 20924 (918) [NW] 33451 (459) [KaBaPET] 53981 (229) [*+IPMNE2]
4elt 137 (8003) [NW] 315 (4090) [NW] 515 (2047) [FSMAGP] 887 (1024) [KaBaPE] 1493 (512) [KaBaPET] 2485 (256) [KaBaPET]
fe_sphere 384 (8289) [JE] 762 (4257) [*+KFFP] 1152 (2060) [JE] 1678 (1076) [FSMAGP] 2427 (536) [FSMAGP] 3456 (269) [FSMAGP]
cti 318 (8480) [JE] 889 (4416) [FSMAGP] 1684 (2200) [*+KFFP] 2701 (1101) [KaBaPET] 3911 (553) [KaBaPET] 5473 (277) [KaBaPET]
memplus 5263 (9322) [HYPAL] 9292 (4661) [KaFFPaE] 11543 (2330) [*+KFFP] 12799 (1165) [*+IPMNE2] 13877 (582) [*+IPMNE2] 15877 (291) [*+IPMNE2]
cs4 353 (11811) [KaFFPa] 908 (5906) [KaBaPE] 1420 (2946) [*+IPMNE2] 2043 (1449) [KaBaPET] 2859 (739) [*+IPMNE2] 3962 (369) [KaBaPE]
bcsstk30 6251 (14679) [JE] 16165 (7590) [FSMAGP] 34068 (3796) [FSMAGP] 68787 (1898) [*+IPMNE2] 109548 (949) [*+IPMNE2] 167049 (474) [*+IPMNE2]
bcsstk31 2662 (18683) [HYPAL] 7082 (9336) [*+IPMNE2] 12843 (4671) [*+IPMNE2] 22859 (2336) [*+IPMNE2] 36383 (1168) [KaBaPET] 55396 (584) [*+IPMNE2]
fe_pwt 340 (18260) [GrPart] 700 (9370) [KaFFPaE] 1405 (4744) [FSMAGP] 2737 (2396) [FSMAGP] 5306 (1199) [KaBaPE] 7959 (599) [FSMAGP]
bcsstk32 4622 (23319) [KasPar] 8441 (11706) [KaFFPa] 18955 (5855) [*+IPMNE2] 34374 (2928) [KaBaPE] 58352 (1464) [*+IPMNE2] 88598 (732) [*+IPMNE2]
fe_body 262 (22544) [MQI] 588 (11835) [*+KFFP] 1012 (5916) [*+IPMNE2] 1683 (2958) [KaBaPE] 2678 (1479) [*+IPMNE2] 4501 (740) [*+IPMNE2]
t60k 65 (31437) [SDP] 195 (15719) [*+KFFP] 441 (7874) [*+IPMNE2] 787 (3938) [KaBaPE] 1291 (1969) [KaBaPE] 2015 (984) [*+IPMNE2]
wing 770 (32511) [*+KFFP] 1590 (16053) [*+IPMNE2] 2440 (8114) [*+IPMNE2] 3775 (4068) [*+IPMNE2] 5513 (2035) [*+IPMNE2] 7534 (1018) [*+IPMNE2]
brack2 660 (32600) [SDP] 2731 (16438) [KaFFPa] 6592 (8219) [KaFFPaE] 11055 (4110) [KaBaPET] 16765 (2055) [KaBaPET] 25108 (1027) [FSMAGP]
finan512 162 (37376) [Ch2.0] 324 (18688) [Ch2.0] 648 (9344) [Ch2.0] 1296 (4672) [Ch2.0] 2592 (2336) [Ch2.0] 10560 (1168) [NW]
fe_tooth 3773 (40567) [SDP] 6687 (20508) [*+IPMNE2] 11151 (10253) [*+IPMNE2] 16985 (5128) [*+IPMNE2] 24274 (2564) [*+IPMNE2] 33403 (1282) [*+IPMNE2]
fe_rotor 1940 (52284) [KaFFPa] 6779 (26150) [KaBaPET] 12309 (13069) [*+IPMNE2] 19680 (6537) [KaFFPaE] 30356 (3268) [KaFFPaE] 44381 (1634) [*+IPMNE2]
598a 2336 (57855) [MQI] 7724 (29128) [*+IPMNE2] 15413 (14565) [*+IPMNE2] 25198 (7282) [*+IPMNE2] 37644 (3641) [*+IPMNE2] 54684 (1820) [FSMAGP]
fe_ocean 311 (73322) [GrPart] 1686 (37274) [KaFFPa] 3886 (18811) [KaBaPE] 7338 (9413) [FSMAGP] 12034 (4707) [*+IPMNE2] 19394 (2351) [*+IPMNE2]
144 6345 (75941) [FSMAGP] 14982 (37902) [*+IPMNE2] 24179 (18986) [*+IPMNE2] 36608 (9493) [*+IPMNE2] 54168 (4747) [*+IPMNE2] 75777 (2374) [*+IPMNE2]
wave 8524 (82064) [KaFFPaE] 16531 (40963) [*+IPMNE2] 28489 (20183) [*+IPMNE2] 42025 (10258) [*+IPMNE2] 59611 (5129) [*+IPMNE2] 82006 (2565) [*+IPMNE2]
m14b 3802 (112532) [MQI] 12859 (56371) [*+IPMNE2] 25126 (28182) [*+IPMNE2] 41098 (14094) [*+IPMNE2] 63411 (7047) [*+IPMNE2] 94140 (3523) [*+IPMNE2]
auto 9450 (235532) [MQI] 25271 (117782) [KaFFPaE] 44206 (58891) [KaFFPaE] 74272 (29443) [*+IPMNE2] 119004 (14720) [*+IPMNE2] 169290 (7361) [*+IPMNE2]

Back to top


Maintained by