Relocation (computing): Difference between revisions

Revision as of 18:56, 28 January 2022

Revision as of 10:31, 31 July 2022

Line 70:

== Further reading ==

* {{cite book |title=11/34 Memory Management Basic Logic test |author-first=Glenn |author-last=Johnson |publisher=[[Digital Equipment Corporation]] (DEC) |date=1975-12-21 |orig-date=1975-11-13 |id=MAINDEC-11-DFKTA-A-D |url=https://archive.org/stream/bitsavers_decpdp11xxAINDEC11DFKTAAD1134MEMORYMANAGEMENTBASIC_2477046/MAINDEC-11-DFKTA-A-D_1134_MEMORY_MANAGEMENT_BASIC_LOGIC_Dec75 |access-date=2017-08-19}}

* {{cite journalmagazine |title=A Proposed Microprocessor Software Standard |author-first1=Peter G. |author-last1=Formaniak |author-first2=David |author-last2=Leitch |series=Technical Forum |journalmagazine=[[BYTE]] - the Smallsmall Systemssystems Journaljournal |publisher=[[Byte Publications, Inc.]] |publication-place=Peterborough, New Hampshire, USA |volume=2 |number=7 |date=July 1977 |id=ark:/13960/t32245485 |pages=34, 62–63 |url=https://archive.org/details/byte-magazine-1977-07/page/n35/mode/1up |access-date=2021-12-06}} (3 pages) (NB. Describes a [[Mostek hex format|relocatable hex format]] by [[Mostek]].)

* {{cite journalmagazine |title=Relocatable Object Code Formats |author-first1=Carol Anne |author-last1=Ogdin |author-first2=Neil |author-last2=Colvin |author-first3=Tom |author-last3=Pittman |author-first4=Philip |author-last4=Tubb |series=Technical Forum |journalmagazine=[[BYTE]] - the Smallsmall Systemssystems Journaljournal |publisher=[[Byte Publications, Inc.]] |publication-place=Peterborough, New Hampshire, USA |volume=2 |number=11 |date=November 1977 |id=ark:/13960/t59c88b4h, ark:/13960/t3kw76j24 |pages=198–205 |url=https://archive.org/details/byte-magazine-1977-11-rescan/page/n199/mode/1up |access-date=2021-12-06}} (8 pages) (NB. Describes a [[Technical Design Labs Relocable Object Module Format|relocatable hex format]] by [[Technical Design Labs|TDL]].)

* {{cite journal |author-first=Gary Arlen |author-last=Kildall |author-link=Gary Arlen Kildall |title=A simple technique for static relocation of absolute machine code |journal=[[Dr. Dobb's Journal of Computer Calisthenics & Orthodontia]] |publisher=[[People's Computer Company]] |volume=3 |issue=2 |id=#22<!-- |number=22 --> ark:/13960/t8hf1g21p |date=February 1978 |orig-date=<!-- November -->1976 |pages=10–13<!-- in the issue --> (66–69<!-- in the volume -->) |isbn=0-8104-5490-4<!-- of the volume --> |url=https://archive.org/details/dr_dobbs_journal_vol_03/page/n67/mode/1up |access-date=2017-08-19}} [https://web.archive.org/web/20170819141800/http://www.retrotechnology.com/dri/d_dri_refs.html][https://web.archive.org/web/20170819173516/http://archive.computerhistory.org/resources/access/text/2016/12/102762506-05-01-acc.pdf][https://archive.today/20170909091943/https://groups.google.com/forum/%23!msg/comp.os.cpm/TLHgIi16yTo/gupNB1ai8UQJ#!topic/comp.os.cpm/TLHgIi16yTo]. Originally presented at: {{cite conference |title=Conference Record: Tenth Annual Asilomar Conference on Circuits, Systems and Computers: Papers Presented November 22–24, 1976 |editor-first=Harold A. |editor-last=Titus |chapter=A Simple Technique for Static Relocation of Absolute Machine Code |author-first=Gary Arlen |author-last=Kildall |journal=Asilomar Conference on Signals, Systems & Computers |author-link=Gary Arlen Kildall |<!-- written-at -->___location=[[Naval Postgraduate School]], Monterey, California, USA |publisher=Western Periodicals Company |publication-place=Asilomar Hotel and Conference Grounds, Pacific Grove, California, USA |date=1977 |orig-date=22–24 November 1976 |issn=1058-6393 |pages=420–424 |url=https://books.google.com/books?id=cyBGAQAAIAAJ&q=relocation |access-date=2021-12-06}} (609 pages). (This "resize" method, named ''page boundary relocation'', could be applied statically to a [[CP/M-80]] disk image using {{ill|MOVCPM|pl|MOVCPM (CP/M)}} in order to maximize the [[Transient Program Area|TPA]] for programs to run. It was also utilized dynamically by the CP/M debugger [[Dynamic Debugging Tool]] (DDT) to [[self-relocation|relocate itself]] into higher memory. The same approach was independently developed by [[Bruce H. Van Natta]] of [[IMS Associates]] to produce relocatable [[PL/M]] code. As ''paragraph boundary relocation'', [[Self-relocation#Ref-Paul-2002-Drivers|another variant]] of this method was later utilized by dynamically [[high memory area|HMA]] self-relocating [[Terminate-and-Stay-Resident|TSR]]s like [[KEYB (DOS command)|KEYB]], [[SHARE (DOS command)|SHARE]], and [[NLSFUNC (DOS command)|NLSFUNC]] under [[DR DOS&nbsp;6.0]] and higher. A much more sophisticated and [[byte alignment|byte-level granular]] method based on a somewhat similar approach was independently conceived and implemented by Matthias R. Paul and Axel C. Frinke for their [[dynamic dead-code elimination]] to dynamically minimize the runtime footprint of resident drivers and TSRs (like FreeKEYB).)

* {{cite news |title=unknown |editor-first=Sol |editor-last=Libes |publisher=Libes Inc. |publication-place=Mountainside, New Jersey, USA |newspaper=[[S-100 Micro Systems]] |volume=1 |date=1980–1981 |issue= |page=54 |url=https://books.google.com/books?id=vEosAQAAIAAJ&q=page+boundary+relocation |access-date=2021-12-06}}