Skip to main content
USENIX
  • Conferences
  • Students
Sign in

connect with us


  •  Twitter
  •  Facebook
  •  LinkedIn
  •  Google+
  •  YouTube

twitter

Tweets by @usenix

usenix conference policies

  • Event Code of Conduct
  • Conference Network Policy
  • Statement on Environmental Responsibility Policy

You are here

Home ยป Optimizing the Performance of Dynamically-Linked Programs
Tweet

connect with us

Optimizing the Performance of Dynamically-Linked Programs

Authors: 

W. Wilson Ho, Wei-Chau Chang, Lilian H. Leung, Silicon Graphics Computer Systems

Abstract: 

Dynamically-linked programs in general do not perform as well as statically-linked programs. This paper identifies three main areas that account for the performance loss. First, symbols are referenced indirectly and thus extra instructions are required. Second, the overhead in run-time symbol resolution is significant. Third, poor locality of functions in shared libraries and data structures maintained by the run-time linker may result in poor memory utilization. This paper presents new optimization techniques we developed that address these three areas and significantly improve the performance of dynamically-linked programs. Also, we provide measurements of the performance improvement achieved. Most importantly, we show that all desirable features of shared libraries can be achieved without sacrificing performance.

W. Wilson Ho, Silicon Graphics Computer Systems

Wei-Chau Chang, Silicon Graphics Computer Systems

Lilian H. Leung, Silicon Graphics Computer Systems

BibTeX
@inproceedings {260470,
author = {W. Wilson Ho and Wei-Chau Chang and Lilian H. Leung},
title = {Optimizing the Performance of {Dynamically-Linked} Programs},
booktitle = {USENIX 1995 Technical Conference (USENIX 1995 Technical Conference)},
year = {1995},
address = {New Orleans, LA},
url = {https://www.usenix.org/conference/usenix-1995-technical-conference/optimizing-performance-dynamically-linked-programs},
publisher = {USENIX Association},
month = jan
}
Download

Links

Paper: 
http://usenix.org/publications/library/proceedings/neworl/full_papers/ho.ps
  • Log in or    Register to post comments

© USENIX

  • Privacy Policy
  • Contact Us