Multilevel algorithms are a successful class of optimisation techniques which address the mesh partitioning problem for distributing unstructured meshes onto parallel computers.
The Java implementation of the multilevel layout algorithm is distributed as an open-source Cytoscape plug-in, named Multilevel Layout, licensed with GNU GPLv2 license [ 34].
This new multilevel thresholding algorithm is called the firefly-based minimum cross entropy thresholding (FF-based MCET) algorithm.
A limitation of the current implementation of the multilevel layout algorithm is its relatively lengthy running times in the largest network graphs.
A detailed multilevel analysis of the hp-MGS algorithm is presented to obtain more insight into the theoretical performance of the algorithm.
The algorithm is based on a multilevel embedded parallelization approach, which includes five levels of parallelization.
The experimental results indicate that the proposed algorithm is superior to the other multilevel thresholding algorithms consistently.
Full adaptivity of the proposed algorithm is realized by combining embedded time discretization and multilevel finite element space discretization.
In addition, the tiling algorithm is utilized to increase the temporal data locality in multilevel caches and to balance the workload as evenly as possible in multicore environments.
