Cart (Loading....) | Create Account
Close category search window

On dynamic program relocation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)

In this survey we have limited ourselves to a general statement of the problem of dynamic relocation, and used this statement to describe a number of representative dynamic relocation techniques. This approach was used mainly to simplify the exposition. The problem statement is probably no more “general” than the composite of the techniques presented, and will undoubtedly require amending as experience with dynamic relocation is gained. For example, the two-level program structure may prove so useful in handling unwieldy arrays that it may be desirable to generalize it to n levels. The SYSTEM/~~O relocation technique described earlier has an obvious generalization for handling such structures, viz., partition the effective address into n parts, provide n types of tables, etc. All of the techniques described here share one important feature: they enable the user to work with an abstraction of the real computer which is operationally much simpler than the real computer. For example, the ATLAS main memory appears to the user to consist entirely of word-addressable, random-access storage, whereas in actuality it need consist of such storage only in part. Similarly, the main memory of the B5000 may be viewed as a “two-dimensional” memory whose addresses have two independent components) whereas in fact this memory is achieved with a conventional “one-dimensional” memory and an appropriate addressing technique. Such abstractions are coming to be known as virtual machines. The idea behind virtual machines is not new, being the essence of all programming systems which tend to mask the real computer from the programmer. As computer operation becomes more complex, the virtual machine concept will become increasingly important.

Note: The Institute of Electrical and Electronics Engineers, Incorporated is distributing this Article with permission of the International Business Machines Corporation (IBM) who is the exclusive owner. The recipient of this Article may not assign, sublicense, lease, rent or otherwise transfer, reproduce, prepare derivative works, publicly display or perform, or distribute the Article.  

Published in:

IBM Systems Journal  (Volume:4 ,  Issue: 3 )

Date of Publication:


Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.