• Home
  • Search
  • Source Code Partitioning in Program Optimization
  • Cite Icon6
  • https://doi.org/10.1109/icpads.2011.125Copy DOI Icon

Source Code Partitioning in Program Optimization

  • Dec 1, 2011
  • Murat Bolat +3 more
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

Program analysis and program optimization seek to improve program performance. There are optimization techniques which are applied to various scopes such as a source file, function or basic block. Inter-procedural program optimization techniques have the scope of source file and analyze the interaction and relationship between different program functions. The techniques analyze the entire translation unit (typically a source file) and optimize the whole translation unit globally instead of just optimizing inside a function. Analyzing and optimizing an entire translation unit increases compilation time drastically because many factors need to be considered during analysis and optimization. The translation unit size can be quite large, containing many functions. Another issue is that functions in different translation units can be more closely related to each other than to the functions within their translation unit. The main goal of this research is grouping or partitioning of closely related program functions into the same translation unit. Our method profiles an application, determines relationship information between program functions and groups closely related functions together. The source code partitioner method improves the processing time of inter-procedural optimization techniques by applying it to a subset of program functions. Partitioning of program functions by analyzing profiling output shows dramatic decrease in compilation time of programs. Our results show we can improve the compiling time in all tested real world benchmarks.

Similar Papers
  • Book Chapter
  • Citations1

Extending OpenMP to Support Automated Function Specialization Across Translation Units

  • Jan 01, 2022
  • Giorgis Georgakoudis +3
  • Research Article
  • Citations15

Flow analysis of dynamic logic programs

  • Sep 01, 1989
  • The Journal of Logic Programming
  • Saumya K Debray
  • Book Chapter

C++ Compilers

  • Jan 01, 2023
  • Slobodan Dmitrović
  • Research Article
  • Citations1

Refactoring to Standard C++20 Modules

  • Nov 28, 2024
  • Journal of Software: Evolution and Process
  • Richárd Szalay +1
  • Research Article
  • Citations1792

CCFinder: a multilinguistic token-based code clone detection system for large scale source code

  • Jul 01, 2002
  • IEEE Transactions on Software Engineering
  • T Kamiya +2
  • Conference Article
  • Citations1

To unify or not to unify: a case study on unified builds (in WebKit)

  • Feb 16, 2019
  • Takafumi Kubota +2
  • Conference Article
  • Citations7

Incremental whole program optimization and compilation

  • Feb 01, 2017
  • Patrick W Sathyanathan +2
  • Research Article
  • Citations20

Simple and Effective Type Check Removal through Lazy Basic Block Versioning

  • Jan 01, 2015
  • DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
  • Maxime Chevalier-Boisvert +1
  • Supplementary Content
  • Citations2

Fine-grained code changes and bugs: Improving bug prediction

  • Jan 01, 2012
  • Zurich Open Repository and Archive (University of Zurich)
  • Emanuel Giger
  • Conference Article
  • Citations2

A multi-block scheme for searching source codes

  • Dec 01, 2010
  • Sheng-Kuei Hsu +1
  • Conference Article
  • Citations15

Automatic verification of object code against source code

  • Jun 17, 1996
  • S Subramanian +1
  • Book Chapter

Header and Source Files

  • Jan 01, 2021
  • Slobodan Dmitrović
  • Supplementary Content
  • Citations1

Improving information retrieval bug localisation using contextual heuristics

  • Jun 06, 2017
  • Open Research Online (The Open University)
  • Tezcan Dilshener
  • Book Chapter

Using Kolmogorov Complexity to Study the Coevolution of Header Files and Source Files of C-alike Programs

  • Jan 01, 2021
  • Liguo Yu
  • Research Article

Using Kolmogorov Complexity to Study the Coevolution of Header Files and Source Files of C-alike Programs

  • Apr 01, 2017
  • International Journal of Knowledge and Systems Science
  • Liguo Yu
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.