• Home
  • Search
  • Investigate Methods to Decrease Compilation Time-AX-Program Code Group Computer Science R& D Project
  • https://doi.org/10.2172/15004130Copy DOI Icon

Investigate Methods to Decrease Compilation Time-AX-Program Code Group Computer Science R& D Project

  • Jun 11, 2003
  • T Cottom
Show More
  • Abstract
  • Literature Map
  • Similar Papers
Abstract

Large simulation codes can take on the order of hours to compile from scratch. In Kull, which uses generic programming techniques, a significant portion of the time is spent generating and compiling template instantiations. I would like to investigate methods that would decrease the overall compilation time for large codes. These would be methods which could then be applied, hopefully, as standard practice to any large code. Success is measured by the overall decrease in wall clock time a developer spends waiting for an executable. Analyzing the make system of a slow to build project can benefit all developers on the project. Taking the time to analyze the number of processors used over the life of the build and restructuring the system to maximize the parallelization can significantly reduce build times. Distributing the build across multiple machines with the same configuration can increase the number of available processors for building and can help evenly balance the load. Becoming familiar with compiler options can have its benefits as well. The time improvements of the sum can be significant. Initial compilation time for Kull on OSF1 was {approx} 3 hours. Final time on OSF1 after completion is 16 minutes. Initial compilation time for Kull on AIX was {approx} 2 hours. Final time on AIX after completion is 25 minutes. Developers now spend 3 hours less waiting for a Kull executable on OSF1, and 2 hours less on AIX platforms. In the eyes of many Kull code developers, the project was a huge success.

Similar Papers
  • Research Article
  • Citations4

A shelf-based Lagrangian relaxation algorithm to schedule parallelizable tasks

  • Jan 01, 2001
  • IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans
  • J.D Monte +1
  • Conference Article
  • Citations29

Data parallel programming in an adaptive environment

  • Apr 25, 1995
  • G Edjlali +3
  • PDF
  • Research Article
  • Citations18

Run‐Time and Compiler Support for Programming in Adaptive Parallel Environments

  • Mar 26, 1996
  • Scientific Programming
  • Guy Edjlali +4
  • Research Article
  • Citations54

A scalable scheduling scheme for functional parallelism on distributed memory multiprocessor systems

  • Apr 01, 1995
  • IEEE Transactions on Parallel and Distributed Systems
  • S Pande +2
  • Book Chapter

8 - Shared-Memory SIMD Computers

  • Jan 01, 1985
  • Parallel Sorting Algorithms
  • Selim G Akl
  • Conference Article
  • Citations3

A parallel compiler scheduler

  • Nov 13, 2002
  • M Solar +1
  • Research Article
  • Citations6

Linear and nonlinear finite element analysis on multiprocessor computer systems

  • May 01, 1988
  • Communications in Applied Numerical Methods
  • Edward L Wilson +1
  • Research Article
  • Citations62

Bi-Objective Optimization of Data-Parallel Applications on Homogeneous Multicore Clusters for Performance and Energy

  • Feb 01, 2018
  • IEEE Transactions on Computers
  • Ravindranath Reddy Manumachu +1
  • Research Article
  • Citations1

An Algorithm for Identification of Regulatory Signals in Unaligned DNA Sequences, Its Testing and Parallel Implementation

  • Jan 01, 2003
  • In Silico Biology: Journal of Biological Systems Modeling and Multi-Scale Simulation
  • Ludmila V Danilova +2
  • Research Article
  • Citations14

Co-scheduling algorithms for high-throughput workload execution

  • Aug 30, 2015
  • Journal of Scheduling
  • Guillaume Aupy +4
  • Research Article
  • Citations304

On exploiting task duplication in parallel program scheduling

  • Jan 01, 1998
  • IEEE Transactions on Parallel and Distributed Systems
  • Ishfaq Ahmad +1
  • Research Article
  • Citations52

Scheduling in and out forests in the presence of communication delays

  • Jan 01, 1996
  • IEEE Transactions on Parallel and Distributed Systems
  • T.A Varvarigou +3
  • Research Article
  • Citations11

Fast parallel algorithm for distance transform

  • Jul 01, 2003
  • IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans
  • A Datta +1
  • Research Article
  • Citations4

A Computation+Communication Load Balanced Loop Partitioning Method for Distributed Memory Systems

  • Sep 01, 1999
  • Journal of Parallel and Distributed Computing
  • Santosh Pande +1
  • Research Article
  • Citations5

Efficient diagonalization of oversized matrices on a distributed-memory multiprocessor

  • Dec 01, 1990
  • Annals of Operations Research
  • Haesun Park
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.