DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 2009 · 38 citations · 14 references
ComputingComputer EngineeringComputer ScienceAlgorithmsParallel AlgorithmsParallel ComputingData ParallelismParallel Algorithm DesignParallel ArchitecturesParallel Computer ArchitectureParallel Computing SystemsParallel Data StructuresDynamic PartitioningParallel Computing ArchitecturesParallel Graph AlgorithmsParallel Graph Data StructuresParallel Graph TraversalParallel PartitioningPartitioning
The Zoltan library is a toolkit of parallel combinatorial algorithms for unstructured and/or adaptive computations. In this paper, we briefly describe the most significant tools in Zoltan: dynamic partitioning, graph coloring and ordering. We also describe how to obtain, build, and use Zoltan in parallel applications.
14
A multilevel algorithm for partitioning graphs
Bruce Hendrickson, Robert W. Leland · 1995 · 1.1K citations
An overview of the Trilinos project
Michael A. Heroux, Roscoe Bartlett, Vicki E. Howle et al. · ACM Transactions on Mathematical Software · 2005 · 1.1K citations