Are there any compelling performance reasons to choose static linking over dynamic linking or vice versa in certain situations? I’ve heard or read the following, but I don’t know enough on the subject to vouch for its veracity.
1) The difference in runtime performance between static linking and dynamic linking is usually negligible.
2) (1) is not true if using a profiling compiler that uses profile data to optimize program hotpaths because with static linking, the compiler can optimize both your code and the library code. With dynamic linking only your code can be optimized. If most of the time is spent running library code, this can make a big difference. Otherwise, (1) still applies.
16 Answers
- Dynamic linking can reduce total resource consumption (if more than one process shares the same library (including the version in “the same”, of course)). I believe this is the argument that drives its presence in most environments. Here “resources” include disk space, RAM, and cache space. Of course, if your dynamic linker is insufficiently flexible there is a risk of DLL hell.
- Dynamic linking means that bug fixes and upgrades to libraries propagate to improve your product without requiring you to ship anything.
- Plugins always call for dynamic linking.
- Static linking, means that you can know the code will run in very limited environments (early in the boot process, or in rescue mode).
- Static linking can make binaries easier to distribute to diverse user environments (at the cost of sending a larger and more resource-hungry program).
- Static linking may allow slightly faster startup times, but this depends to some degree on both the size and complexity of your program and on the details of the OS’s loading strategy.
Some edits to include the very relevant suggestions in the comments and in other answers. I’d like to note that the way you break on this depends a lot on what environment you plan to run in. Minimal embedded systems may not have enough resources to support dynamic linking. Slightly larger small systems may well support dynamic linking because their memory is small enough to make the RAM savings from dynamic linking very attractive. Full-blown consumer PCs have, as Mark notes, enormous resources, and you can probably let the convenience issues drive your thinking on this matter.
To address the performance and efficiency issues: it depends.
Classically, dynamic libraries require some kind of glue layer which often means double dispatch or an extra layer of indirection in function addressing and can cost a little speed (but is the function calling time actually a big part of your running time???).
However, if you are running multiple processes which all call the same library a lot, you can end up saving cache lines (and thus winning on running performance) when using dynamic linking relative to using static linking. (Unless modern OS’s are smart enough to notice identical segments in statically linked binaries. Seems hard, does anyone know?)
Another issue: loading time. You pay loading costs at some point. When you pay this cost depends on how the OS works as well as what linking you use. Maybe you’d rather put off paying it until you know you need it.
Note that static-vs-dynamic linking is traditionally not an optimization issue, because they both involve separate compilation down to object files. However, this is not required: a compiler can in principle, “compile” “static libraries” to a digested AST form initially, and “link” them by adding those ASTs to the ones generated for the main code, thus empowering global optimization. None of the systems I use do this, so I can’t comment on how well it works.
The way to answer performance questions is always by testing (and use a test environment as much like the deployment environment as possible).