FazBrowse Wikipedia Viewer | Main Page |
Search Wikipedia:
|
Viewing: https://en.wikipedia.org/wiki/Program_lifecycle_phase

Program lifecycle phase

Contents
Use
    Describe binding time
    Parallel computing
References

A program lifecycle phase is a distinct period of time that is relevant to the operation of a computer program as it transitions from development to execution. Any distinct period in a program's life cycle in which the operational state of the program changes can be identified as a time. For example, compile time is when a program is compiled and link time is when a program is linked. Also, phases can often be divided into component phases. For example, build time might be divided into compile and link times, compile time into parse and code-generation times, and run time into initialization and normal-operation times.

A program tends to transition through phases in sequences, but often not from first to last and sometimes some are skipped. For example, when programming, a developer may repeatedly edit, build, and run a program without distributing or installing it. After programming is complete, then it may be distributed to and installed by a user.

Even though the term program lifecycle phase is less than notable, the times (phases) are well-known, commonly-used and notable. The collective term is used for this article for lack of a better term.

– including copying the machine code into executable memory and resolving dynamic linkages.
Run time
When the program is running. The central processing unit executes the program's machine code instructions.

Use

edit

Describe binding time

edit

Binding time describes whether an association between entities is fixed either before (early) or after (late) the program starts running. The phases described here provide a way to describe when the binding occurs more precisely. For example, an early binding might be made at design, compile or link time.

Parallel computing

edit

One of the key functions of parallel computing development is specializing the code to the host runtime environment. Such specialization cannot be performed before that environment is known. If the desire is for the same code to run on a variety of hardware platforms, then such specialization cannot happen during edit or compile phases. The earliest phase would be the distribution phase, if a system were put in place that gathers hardware information, then chooses an executable that is already specialized to that hardware or substantially similar hardware, or generates a specialized binary on the fly. Likewise, specialization could be performed at load time, by invoking a binary rewriting tool in combination with a tool that uses the control flow structure to generate a specialized form.

References

edit
{{cite book |last=Midkiff |first=Samuel P. |title=Automatic Parallelization: An Overview of Fundamental Compiler Techniques |series=Synthesis Lectures on Computer Architecture |publisher=Morgan & Claypool |year=2012 |isbn=978-1608458103 |url=https://picture.iczhiku.com/resource/eetop/WHIegQGuDqKyQmCc.pdf |access-date=12 November 2025}}</ref>\n<ref name=\"Tournavitis2009\">{{cite conference |last1=Tournavitis |first1=Georgios |last2=O’Boyle |first2=Michael |title=Towards a holistic approach to auto-parallelization |publisher=ACM |year=2009 |doi=10.1145/1543135.1542496 |url=https://dl.acm.org/doi/10.1145/1543135.1542496 |access-date=12 November 2025|url-access=subscription }}</ref>"}},"i":0}}]}'>
Levine, John R. (1999). Linkers and Loaders. Morgan Kaufmann. ISBN 978-1558604964.
  • ↑ "Linking (CS:APP lecture slides) — load-time vs run-time dynamic linking" (PDF). Carnegie Mellon University. 26 October 2023. Retrieved 12 November 2025.
  • ↑ Midkiff, Samuel P. (2012). Automatic Parallelization: An Overview of Fundamental Compiler Techniques (PDF). Synthesis Lectures on Computer Architecture. Morgan & Claypool. ISBN 978-1608458103. Retrieved 12 November 2025.
  • ↑ "LTO (Link Time Optimization)". GCC Internals Manual. Free Software Foundation. Retrieved 12 November 2025.
  • ↑

  • View original on Wikipedia | Back | FazBrowse Home