Linking programs in a single address space

Authors:
Luke Deller;Gernot Heiser
Affiliations:
School of Computer Science & Engineering, University of New South Wales, Sydney, Australia;School of Computer Science & Engineering, University of New South Wales, Sydney, Australia
Venue:
ATEC '99 Proceedings of the annual conference on USENIX Annual Technical Conference
Year:
1999

Citing 6
Cited 1

Object operations benchmark

ACM Transactions on Database Systems (TODS)
Sharing and protection in a single-address-space operating system

ACM Transactions on Computer Systems (TOCS) - Special issue on computer architecture
The Mungi single-address-space operating system

Software—Practice & Experience - Special issue on multiprocessor operating systems
Inside MacIntosh

Inside MacIntosh
Security and protection of data in the IBM System/38

ISCA '80 Proceedings of the 7th annual symposium on Computer Architecture
Evaluation of a distributed single address space operating system

ICDCS '96 Proceedings of the 16th International Conference on Distributed Computing Systems (ICDCS '96)

Performance characterization of prelinking and preloadingfor embedded systems

EMSOFT '07 Proceedings of the 7th ACM & IEEE international conference on Embedded software

Quantified Score

Hi-index	0.00

Visualization

Abstract

Linking and loading are the final steps in preparing a program for execution. This paper assesses issues concerning dynamic and static linking in traditional as well as single-address-space operating systems (SASOS). Related loading issues are also addressed. We present the dynamic linking model implemented in the Mungi SASOS and discuss its strengths and limitations. Benchmarking shows that dynamic linking in a SASOS carries significantly less overhead than dynamic linking in SGI's Irix operating system. The same performance advantages could be achieved in Unix systems, if they reserved a portion of the address space for dynamically linked libraries, and ensured that each library is always mapped at the same address.