• ParaDisEO

  • Referenced in 43 articles [sw01948]
  • features including evolutionary algorithms (EA), local searches (LS), the most common parallel and distributed models...
  • EVPI

  • Referenced in 18 articles [sw02644]
  • parallel version of a sequential importance sampling solution algorithm based on local expected value ... possible realisations. It utilises the parallel nested Benders algorithm ... parallel version of an algorithm designed to calculate the local EVPI values for the nodes...
  • Nektar++

  • Referenced in 69 articles [sw11964]
  • nature of the local matrix generation stage coupled with the parallelization techniques developed ... graphical processing units (GPUs). We propose an algorithmic pipeline for mapping an elliptic finite element ... study was dictated by the computationally-heavy local matrix generation stage as well ... method amenable to the fine-grained parallelism of GPUs. We demonstrate that the HDG method...
  • UG

  • Referenced in 190 articles [sw04596]
  • adaptive local grid refinement on unstructured meshes, multigrid solvers and parallelization techniques ... hand as a tool for exploring new algorithms and, on the other hand, a whole...
  • voFoam

  • Referenced in 10 articles [sw26604]
  • geometrical Volume of Fluid algorithm on arbitrary unstructured meshes with local dynamic adaptive mesh refinement ... OpenFOAM. A new parallelized unsplit geometrical Volume of Fluid (VoF) algorithm with support for arbitrary ... unstructured meshes and dynamic local Adaptive Mesh Refinement (AMR), as well ... geometrical mapping algorithm executed as a part of the dynamic local AMR cycle. The method...
  • ParaSCIP

  • Referenced in 29 articles [sw06292]
  • nodes of the branching tree) locally. This makes the parallelization development independent of the SCIP ... development. Thus, ParaSCIP directly profits from any algorithmic progress in future versions of SCIP. Using...
  • PFFT

  • Referenced in 16 articles [sw07582]
  • parallel FFT framework that is based on a combination of local FFTs, local data permutations ... completely in place. Furthermore, we propose an algorithm to calculate pruned FFTs more efficiently...
  • OPTIMAS

  • Referenced in 17 articles [sw07605]
  • constrained optimization of aerodynamic shapes Massive parallelization is a crucial element of any successful optimization ... linked local data bases obtained by full Navier-Stokes computations. The algorithm is built upon ... multilevel embedded parallelization strategy, which efficiently makes use of computational power supplied by massively parallel...
  • ALPS

  • Referenced in 22 articles [sw08907]
  • serial or parallel numerical simulations by providing basic implementations of the important algorithms for quantum ... quantum Monte Carlo (QMC) using non-local updates, extended ensemble simulations, exact and full diagonalization ... porting a serial code onto a parallel, distributed memory machine. Major changes in release...
  • MALLBA

  • Referenced in 27 articles [sw00542]
  • resolution of combinatorial optimization problems using algorithmic skeletons implemented in C++. MALLBA offers three families ... MALLBA provides three different implementations: sequential, parallel for local area networks, and parallel for wide...
  • PaGMO/PyGMO

  • Referenced in 9 articles [sw05070]
  • PaGMO/PyGMO. Parallel Global Multiobjective Optimizer (and its Python alter ego PyGMO) offers a user-friendly ... wide array of global and local optimization algorithms and problems. The main purpose ... software is to provide a parallelization engine common to all algorithms through the ’generalized island...
  • SCASY

  • Referenced in 12 articles [sw03251]
  • combine recursion and blocking. We consider parallelization of algorithms for reduced matrix equations ... globally in a distributed memory paradigm, and locally on shared memory or multicore nodes ... front algorithms are considered to compute the solution to the reduced triangular systems. Parallelization...
  • AlgoWiki

  • Referenced in 5 articles [sw35786]
  • description of the algorithm: its parallel complexity, parallel structure, determinacy, data locality, performance and scalability...
  • SPEED

  • Referenced in 32 articles [sw08653]
  • spectral approximation, along with efficient and scalable algorithms, the code allows one to deal with ... polynomial degree distribution as well as a locally varying mesh size. Validation benchmarks are illustrated ... accuracy, stability, and performance features of the parallel kernel, whereas illustrative examples are discussed...
  • YalSAT

  • Referenced in 10 articles [sw31644]
  • ProbSAT, we reimplemented the ProbSAT algorithm in our new local search SAT solver YalSAT, which ... effectiveness. We were quite surprised that a local search solver was able to solve some ... YalSAT during one local search inprocessing phase in our parallel SAT solver Treengeling, which ... threads with local search enabled in a portfolio style manner in parallel to the main...
  • Algorithm 949

  • Referenced in 7 articles [sw17566]
  • Algorithm 949: MATLAB tools for HDG in three dimensions. In this article, we provide some ... elements are exclusively local and, as such, have been parallelized...
  • MFEM

  • Referenced in 32 articles [sw09043]
  • MFEM is a general, modular, parallel C++ library for finite element methods research and development ... building blocks for developing finite element algorithms in a manner similar to that of MATLAB ... triangular and tetrahedral meshes, local refinement (including in parallel). General element transformations, allowing for elements...
  • PyOP2

  • Referenced in 13 articles [sw14924]
  • Many numerical algorithms and scientific computations on unstructured meshes can be viewed as the independent ... application of a local operation everywhere on a mesh. This local operation is often called ... independent application lends itself naturally to parallel computation. An unstructured mesh can be described...
  • recsy

  • Referenced in 7 articles [sw04139]
  • combine recursion and blocking. We consider parallelization of algorithms for reduced matrix equations ... globally in a distributed memory paradigm, and locally on shared memory or multicore nodes ... front algorithms are considered to compute the solution to the reduced triangular systems. Parallelization...
  • clustvarsel

  • Referenced in 16 articles [sw07967]
  • based clustering which allows to find the (locally) optimal subset of variables in a dataset ... models. By default the algorithm uses a sequential search, but parallelization is also available...