• Subscribe

Making complex computations more efficient

Image courtesy Christian Schulz, KIT.

Researchers at the Karlsruhe Institute of Technology have developed open-source software capable of significantly speeding up complex computations.

Graphs are used by many computer applications to model relationships between objects and 'graph partitioning' is an important method used to manage complex computations on steadily growing networks.

The Karlsruhe High Quality Partitioner (KaHIP) was developed by Peter Sanders and Christian Schulz. It enables modeled objects (nodes of the graph) to be divided into blocks of about the same size, while the number of edges between the blocks is minimized.

"Computation speed increases with a decreasing number of edges that have to be cut," says Schulz. "Our system solves the graph partitioning problem by cutting about three times less edges than comparable tools on the market."

The above graph shows how the software can be used to model air flow around an airplane wing. The four colors reflect the partitioning of the graph and, hence, the distribution of computation among four computers.

Join the conversation

Do you have story ideas or something to contribute? Let us know!

Copyright © 2019 Science Node ™  |  Privacy Notice  |  Sitemap

Disclaimer: While Science Node ™ does its best to provide complete and up-to-date information, it does not warrant that the information is error-free and disclaims all liability with respect to results from the use of the information.

Republish

We encourage you to republish this article online and in print, it’s free under our creative commons attribution license, but please follow some simple guidelines:
  1. You have to credit our authors.
  2. You have to credit ScienceNode.org — where possible include our logo with a link back to the original article.
  3. You can simply run the first few lines of the article and then add: “Read the full article on ScienceNode.org” containing a link back to the original article.
  4. The easiest way to get the article on your site is to embed the code below.