Skip to content

GitLab

  • Menu
Projects Groups Snippets
    • Loading...
  • Help
    • Help
    • Support
    • Community forum
    • Submit feedback
    • Contribute to GitLab
  • Sign in
  • openfpm_pdata openfpm_pdata
  • Project information
    • Project information
    • Activity
    • Labels
    • Members
  • Repository
    • Repository
    • Files
    • Commits
    • Branches
    • Tags
    • Contributors
    • Graph
    • Compare
  • Issues 0
    • Issues 0
    • List
    • Boards
    • Service Desk
    • Milestones
  • Merge requests 0
    • Merge requests 0
  • CI/CD
    • CI/CD
    • Pipelines
    • Jobs
    • Schedules
  • Deployments
    • Deployments
    • Environments
    • Releases
  • Monitor
    • Monitor
    • Incidents
  • Analytics
    • Analytics
    • CI/CD
    • Repository
    • Value stream
  • Wiki
    • Wiki
  • Activity
  • Graph
  • Create a new issue
  • Jobs
  • Commits
  • Issue Boards
Collapse sidebar
  • Sbalzarini Lab
    • SSoftware
    • PParallel Computing
  • OpenFPM
  • openfpm_pdataopenfpm_pdata
  • Wiki
  • Decomposition

Decomposition · Changes

Page history
Updated Decomposition (markdown) authored Oct 06, 2015 by rundeck's avatar rundeck
Hide whitespace changes
Inline Side-by-side
Decomposition.md
View page @ ec8a8e43
......@@ -35,8 +35,8 @@ the communication cost (_Generate graph model_). The requirement of balanced com
minimal communication then translates to an optimization problem of
finding a graph partitioning where each group contains the same sum of
weights, and the sum of the cut edges is minimal (_Find optimal decomposition_). As final step
the decomposition can be post-process further more to be more optimal and based on factors not considered by the optimization process, like merging vertex, or merging sub-sub-domain, to create bigger sub-domains.
Even if a model decomposition it is not bind to a graph model it is true that until now it is the best approach in scientific computation
the decomposition can be post-process further more to be more optimal and based on factors not considered by the optimization process, like merging vertex (sub-sub-domain) to create bigger sub-domains.
Even if a model decomposition it is not bind to a graph model it is true that until now seem to be the best approach in scientific computation
* CartDecomposition [(doc)](CartDecomposition)[(API reference)](http://ppmcore.mpi-cbg.de/doxygen/openfpm_pdata/classCartDecomposition.html)
......
Clone repository
  • CartDecomposition
  • Decomposition
  • Directories
  • Examples
  • Home
  • Install
  • OpenFPM pdata advanced options
  • OpenFPM pdata examples
  • Update
  • grid dist id
  • Home