Suche   Â
Enhancing the Efficiency of Complex Computations
ID: 990457
hancing the Efficiency of Complex Computations
By means of KaHIP, the modeled objects (nodes of the graph) are divided into blocks of about the same size, while the number of edges between the blocks are minimized. In this way, route planners, for instance, can be accelerated: The transport network stored in the route planner is partitioned. When planning a specific route, e.g. from Berlin to Hamburg, large parts of the transport network can be neglected, as they are of no relevance. In this way, a partitioning tool like KaHIP can accelerate the computation of a route by several factors.
Complex computations with very detailed graphs, such as the computation of flow properties of an airplane, frequently require more than one computer. In such a case, KaHIP can distribute computations in a reasonable manner and ensures efficient, simultaneous computations on several computers. The determining factor is the number of edges that have to be cut in a graph. "Computation speed increases with a decreasing number of edges that have to be cut. Our system solves the graph partitioning problem by cutting about three times less edges than comparable tools on the market,? Dr. Christian Schulz, scientist at the KIT Institute of Theoretical Informatics, explains.
KaHIP - Open Source
Within the framework of his PhD thesis at KIT, Christian Schulz developed KaHIP together with Professor Peter Sanders. Already during the development phase the tool received high interest in science and industry. KaHIP is now available as open source program. In international comparison, KaHIP has already proven to be competitive. It scored most of the points in the 10th DIMACS Implementation Challenge as well as the Walshaw Benchmark, in which graph partitioners from all over the world compete with each other.
"Based on our long-standing experience in the area of graph processing, we are now able to offer KaHIP, a tool that supplies the best solution quality worldwide for a number of applications,? says Professor Peter Sanders of the KIT Institute of Theoretical Informatics.
Professor Sanders was granted several prizes for his work on algorithms for graph processing. Among them were the State Research Award and the Google Focused Research Award in 2012 as well as the Gottfried Wilhelm Leibniz Prize in 2011.
For more information on KaHIP, click: http://algo2.iti.kit.edu/documents/kahip/
Karlsruher Institut für Technologie
Kaiserstraße 12
76131 Karlsruhe
Deutschland
Telefon: +49 721 608-0
Telefax: +49 721 608-44290
Mail: info@kit.edu
URL: http://www.kit.edu/index.php
(pressrelations) - iciency of Complex Computations
By means of KaHIP, the modeled objects (nodes of the graph) are divided into blocks of about the same size, while the number of edges between the blocks are minimized. In this way, route planners, for instance, can be accelerated: The transport network stored in the route planner is partitioned. When planning a specific route, e.g. from Berlin to Hamburg, large parts of the transport network can be neglected, as they are of no relevance. In this way, a partitioning tool like KaHIP can accelerate the computation of a route by several factors.
Complex computations with very detailed graphs, such as the computation of flow properties of an airplane, frequently require more than one computer. In such a case, KaHIP can distribute computations in a reasonable manner and ensures efficient, simultaneous computations on several computers. The determining factor is the number of edges that have to be cut in a graph. "Computation speed increases with a decreasing number of edges that have to be cut. Our system solves the graph partitioning problem by cutting about three times less edges than comparable tools on the market,? Dr. Christian Schulz, scientist at the KIT Institute of Theoretical Informatics, explains.
KaHIP - Open Source
Within the framework of his PhD thesis at KIT, Christian Schulz developed KaHIP together with Professor Peter Sanders. Already during the development phase the tool received high interest in science and industry. KaHIP is now available as open source program. In international comparison, KaHIP has already proven to be competitive. It scored most of the points in the 10th DIMACS Implementation Challenge as well as the Walshaw Benchmark, in which graph partitioners from all over the world compete with each other.
"Based on our long-standing experience in the area of graph processing, we are now able to offer KaHIP, a tool that supplies the best solution quality worldwide for a number of applications,? says Professor Peter Sanders of the KIT Institute of Theoretical Informatics.
Professor Sanders was granted several prizes for his work on algorithms for graph processing. Among them were the State Research Award and the Google Focused Research Award in 2012 as well as the Gottfried Wilhelm Leibniz Prize in 2011.
For more information on KaHIP, click: http://algo2.iti.kit.edu/documents/kahip/
Karlsruher Institut für Technologie
Kaiserstraße 12
76131 Karlsruhe
Deutschland
Telefon: +49 721 608-0
Telefax: +49 721 608-44290
Mail: info(at)kit.edu
URL: http://www.kit.edu/index.php
PresseKontakt / Agentur:
Karlsruher Institut für Technologie
Kaiserstraße 12
76131 Karlsruhe
Deutschland
Telefon: +49 721 608-0
Telefax: +49 721 608-44290
Mail: info(at)kit.edu
URL: http://www.kit.edu/index.php
  
  
  
Datum: 29.11.2013 - 12:31 Uhr
Sprache: Deutsch
News-ID 990457
Anzahl Zeichen: 5999
pressrelations.de – ihr Partner für die Veröffentlichung von Pressemitteilungen und Presseterminen, Medienbeobachtung und Medienresonanzanalysen
Diese Pressemitteilung wurde bisher 0 mal aufgerufen.
Die Pressemitteilung mit dem Titel:
"Enhancing the Efficiency of Complex Computations"
steht unter der journalistisch-redaktionellen Verantwortung von
Karlsruher Institut für Technologie (Nachricht senden)
Beachten Sie bitte die weiteren Informationen zum Haftungsauschluß (gemäß TMG - TeleMedianGesetz) und dem Datenschutz (gemäß der DSGVO).