?url_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Adc&rft.relation=http%3A%2F%2Fmiis.maths.ox.ac.uk%2Fmiis%2F87%2F&rft.title=Partitioning+a+call+graph&rft.creator=Bisseling%2C+Rob+H.&rft.creator=Byrka%2C+Jaros%C5%82aw&rft.creator=Cerav-Erbas%2C+Selin&rft.creator=Gvozdenov%C3%ADc%2C+Neboj%C5%A1a&rft.creator=Lorenz%2C+Mathias&rft.creator=Pendavingh%2C+Rudi&rft.creator=Reeves%2C+Colin&rft.creator=R%C3%B6ger%2C+Matthias&rft.creator=Verhoeven%2C+Arie&rft.subject=Information+and+communication+technology&rft.description=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%2C+we+formulate+an+equivalent+integer+linear+programming+problem+with+0%E2%80%931+variables.+theoretically%2C+with+this+approach+the+problem+can+be+solved+to+optimality%2C+but+this+becomes+very+costly+with+increasing+size+of+the+software+system.+Second%2C+we+formulate+the+problem+as+a+hypergraph+partitioning+problem.+This+is+a+heuristic+method+using+a+multilevel+strategy%2C+but+it+turns+out+to+be+very+fast+and+to+deliver+solutions+that+are+close+to+optimal.&rft.date=2005-02-04&rft.type=Study+Group+Report&rft.type=NonPeerReviewed&rft.format=application%2Fpdf&rft.language=en&rft.identifier=http%3A%2F%2Fmiis.maths.ox.ac.uk%2Fmiis%2F87%2F1%2Fcallgraph.pdf&rft.identifier=++Bisseling%2C+Rob+H.+and+Byrka%2C+Jaros%C5%82aw+and+Cerav-Erbas%2C+Selin+and+Gvozdenov%C3%ADc%2C+Neboj%C5%A1a+and+Lorenz%2C+Mathias+and+Pendavingh%2C+Rudi+and+Reeves%2C+Colin+and+R%C3%B6ger%2C+Matthias+and+Verhoeven%2C+Arie++(2005)+Partitioning+a+call+graph.++%5BStudy+Group+Report%5D+++++