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.
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.
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.
Kaiserstrae 12 76131 Karlsruhe, Germany Phone: +49 721 608-47414 Fax: +49 721 608-43658 E-mail: presse@kit.edu KIT University of the State of Baden-Wuerttemberg and National Research Center of the Helmholtz Association www.kit.edu Page 1 / 3
Graph to compute the air flow around an airplane wing: The four colors reflect the partitioning of the graph and, hence, the distribution of computation among four com- puters. (Graphics: Christian Schulz, KIT) Planning a trip from Berlin to Hamburg, simulating air flows around a new passenger airplane, or friendships on Facebook many computer applications model relationships between ob- jects by graphs (networks) in the sense of discrete mathemat- ics. An important method to manage complex computations on steadily growing networks is graph partitioning. The KIT com- puter scientists Professor Peter Sanders and Dr. Christian Schulz have now released the Karlsruhe High Quality Partition- er (KaHIP). The solutions produced by this tool presently are the best worldwide. By means of KaHIP, the modeled objects (nodes of the graph) are divided into blocks of about the same size, while the number of edg- es 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 Enhancing the Efficiency of Complex Computations The Karlsruhe Graph Partitioner KaHIP Wins over International Competitors
For further information, please contact:
Sebastian Schfer Department of Informatics Public Relations Phone: +49 721 608-44344 Fax: +49 721 608-4177 eMail: sebastian.schaefer@kit.edu Press Release No. 155 | ses | November 29, 2013
Page 2 / 3 Press Release No. 155 | ses | November 29, 2013
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 com- putation of flow properties of an airplane, frequently require more than one computer. In such a case, KaHIP can distribute computa- tions 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 Infor- matics, explains. KaHIP Open Source Within the framework of his PhD thesis at KIT, Christian Schulz de- veloped KaHIP together with Professor Peter Sanders. Already dur- ing 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 competi- tive. It scored most of the points in the 10 th DIMACS Implementation Challenge as well as the Walshaw Benchmark, in which graph parti- tioners from all over the world compete with each other. Based on our long-standing experience in the area of graph pro- cessing, 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 Informat- ics. Professor Sanders was granted several prizes for his work on algo- rithms 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/
Page 3 / 3 Press Release No. 155 | ses | November 29, 2013
Karlsruhe Institute of Technology (KIT) is a public corporation according to the legislation of the state of Baden-Wrttemberg. It fulfills the mission of a university and the mission of a na- tional research center of the Helmholtz Association. Research activities focus on energy, the natural and built environment as well as on society and technology and cover the whole range extending from fundamental aspects to application. With about 9000 employees, including nearly 6000 staff members in the science and education sector, and 24000 students, KIT is one of the biggest research and education institutions in Europe. Work of KIT is based on the knowledge triangle of research, teaching, and innovation.
This press release is available on the internet at http://www.kit.edu
The photo of printing quality may be downloaded under www.kit.edu or requested by mail to presse@kit.edu or phone +49 721 608-4 7414. The photo may be used in the context given above exclusively.
En8Rc-Iiig-10: Share Ideas Using Opinion-Marking Signals En8G-Iiig-3.6: Use Modals Appropriately. En8G-Iiig-12: Use Emphasis Markers For Persuasive Purposes