JOSTLE

JOSTLE graph partitioning software. JOSTLE is a software package designed to partition unstructed meshes (for example, finite element or finite volume meshes) for use on distributed memory parallel computers. It can also be used to repartition and load-balance existing partitions (such as those deriving from adaptive refined meshes). It achieves this by modelling the mesh as an undirected graph and then using state-of-the-art graph partitioning techniques. The code is extremely fast and provides high quality multilevel partitioning and diffusive load-balancing in both serial & parallel. Since its first release in 1995, JOSTLE has gained a worldwide user community of around 150 licensed sites. Although some are no longer current, it has been licensed by groups based at Los Alamos, Argonne & Sandia National Labs (all in the USA), NASA, and in Universities across the world (specifically the USA, Canada, Brazil, Austria, Belgium, Czech Republic, Finland, France, Germany, Greece, Holland, Italy, Poland, Russia, Spain, Sweden, Switzerland, Turkey, Israel, Oman, India, Japan, Singapore & Taiwan). JOSTLE has recently been commercialised and is available under the name of NetWorks.


References in zbMATH (referenced in 25 articles )

Showing results 1 to 20 of 25.
Sorted by year (citations)

1 2 next

  1. Delling, Daniel; Fleischman, Daniel; Goldberg, Andrew V.; Razenshteyn, Ilya; Werneck, Renato F.: An exact combinatorial algorithm for minimum graph bisection (2015)
  2. Vecharynski, Eugene; Saad, Yousef; Sosonkina, Masha: Graph partitioning using matrix values for preconditioning symmetric positive definite systems (2014)
  3. Bolten, Matthias; Friedhoff, Stephanie; Frommer, Andreas; Heming, Matthias; Kahl, Karsten: Algebraic multigrid methods for Laplacians of graphs (2011)
  4. Taylor, Alan; Vass, J.Keith; Higham, Desmond J.: Discovering bipartite substructure in directed networks (2011)
  5. Gogolenko, Sergiy Y.; Svjatnyj, Volodymyr: Architecture aware parallelization of solvers for PDE systems on geometrical graphs (2009)
  6. Rama Mohan Rao, A.: Parallel mesh-partitioning algorithms for generating shape optimised partitions using evolutionary computing (2009)
  7. Meyerhenke, Henning: Disturbed diffusive processes for solving partitioning problems on graphs (2008)
  8. Bichot, Charles-Edmond: A new method, the fusion fission, for the relaxed $k$-way graph partitioning problem, and comparisons with some multilevel algorithms (2007)
  9. Behrens, Jörn: Adaptive atmospheric modeling. Key techniques in grid generation, data structures, and numerical operations with applications (2006)
  10. Lan, Zhiling; Taylor, Valerie E.; Li, Yawei: DistDLB: improving cosmology SAMR simulations on distributed computing systems through hierarchical load balancing (2006)
  11. Teresco, James D.; Devine, Karen D.; Flaherty, Joseph E.: Partitioning and dynamic load balancing for the numerical solution of partial differential equations (2006)
  12. Devine, Karen D.; Boman, Erik G.; Heaphy, Robert T.; Hendrickson, Bruce A.; Teresco, James D.; Faik, Jamal; Flaherty, Joseph E.; Gervasio, Luis G.: New challenges in dynamic load balancing (2005)
  13. Felner, Ariel: Finding optimal solutions to the graph partitioning problem with heuristic search (2005)
  14. Lan, Zhiling; Taylor, Valerie E.: Dynamic load balancing of SAMR applications (2005)
  15. Douglas, Craig C.; Haase, Gundolf; Langer, Ulrich: A tutorial on elliptic PDE solvers and their parallelization (2003)
  16. Korošec, Peter; Šilc, Jurij; Robič, Borut: A multilevel ant-colony optimization algorithm for mesh partitioning (2003)
  17. Wu, J.-S.; Tseng, K.-C.; Yang, T.-J.: Parallel implementation of DSMC using unstructured mesh (2003)
  18. Ivanyi, P.; Topping, B.H.V.: A new graph representation for cable-membrane structures (2002)
  19. Lan, Zhiling; Taylor, Valerie E.; Bryan, Greg: A novel dynamic load balancing scheme for parallel systems. (2002)
  20. Mackerle, Jaroslav: 2D and 3D finite element meshing and remeshing. A bibliography (1990-2001) (2001)

1 2 next