Graph Partitioning Methods for Scientific Computing Applications
Synopsis
Algorithms that find good partitionings of highly unstructured graphs are critical in developing efficient solutions for a wide range of problems in many application areas on both serial and parallel computers. These graphs arise from many diverse areas such as scientific computing, engineering, operations research, optimization, data mining, geographical information systems, VLSI design, parallel processing, and task scheduling. Depending on the application, the graph can model different quantities. The goal of the project is to focus on developing multilevel graph partitioning algorithms for solving complex problems. This work falls under the interdisciplinary area of enabling technologies. In this area efficient and robust algorithms are built that facilitate the use of computers by other researchers who deal with the actual applications that are run on High Performance Computing platforms.
Contact person
Dr. Irene Moulitsas, email: i [dot] moulitsa [at] cyi [dot] ac [dot] cy
Tel. +357 22208612

The Project is co-financed by the European Regional Development Fund and the Republic of Cyprus through the Research Promotion Foundation.

