The MIIS Eprints Archive

Partitioning a call graph

Bisseling, Rob H. and Byrka, Jarosław and Cerav-Erbas, Selin and Gvozdenovíc, Nebojša and Lorenz, Mathias and Pendavingh, Rudi and Reeves, Colin and Röger, Matthias and Verhoeven, Arie (2005) Partitioning a call graph. [Study Group Report]



Splitting a large software system into smaller and more manageable units has become an important problem for many organizations. The basic structure of a software system is given by a directed graph with vertices representing the programs of the system and arcs representing calls from one program to another. Generating a good partitioning into smaller modules becomes a minimization problem for the number of programs being called by external programs. First, we formulate an equivalent integer linear programming problem with 0–1 variables. theoretically, with this approach the problem can be solved to optimality, but this becomes very costly with increasing size of the software system. Second, we formulate the problem as a hypergraph partitioning problem. This is a heuristic method using a multilevel strategy, but it turns out to be very fast and to deliver solutions that are close to optimal.

Item Type:Study Group Report
Problem Sectors:Information and communication technology
Study Groups:European Study Group with Industry > ESGI 52 (Amsterdam, Netherlands, Jan 31-Feb 4, 2005) (SWI 2005)
Company Name:Software Improvement Group
ID Code:87
Deposited By: Richard Booth
Deposited On:05 Feb 2007
Last Modified:29 May 2015 19:47

Repository Staff Only: item control page