Scatter storage techniques
Robert Morris · Communications of the ACM · 1968
The BXI, works like a TtX if the SEcond operand (in this ease 3) is odd; the BXH with an even second ~vrgument allows the increment and comparand to be in adjacent regist.ers, in this ease 4 aud 5.The Stl. subtraets register 5 from register 2. C is a fuI1 word comparison which sets the condition codE; this example could be modified for a halfword ~able by changing (3 to CH and "4" to "2" throughout the instructions above.BC branches (>~ eondition code 6, which is 0110 in binary--.-i.e., first opera.ndlow or first operand high.The timi~g iu this ~.xa.mpl< depend:, ~>~ d~<, ,~o~i(1.(3,~ the ),L>d ;~0, th~ (imiugs in microseeouds of the givm~ instructions arE: BXI,, ;;S; I;XH, 3SiS l{, 30:('.SO: BC, 15.ThE total is 151 nficrose('~u~d, \ si~!{]b' muii it@ i> struetion on the Mod ;gt) t~kes 2;~5 mi,.:roa'c(mds.(h~ ~ther models the situ0, iiOlt iS R)SS clear, bl, l[ iD, ttlt} (VeIlb ;~i legist five instructions ~re needed: multiply, ma.sk, BXtI ~0 TFUIA.C, and B(L Note that ~,> this machine ~ cam~ot "enclose" a BXH ~ithi~ :~ comparison tweau,;c ~h~: C instruetii:m does not skip, but merely >e{s thv co~dhiot~ code.Scatter Storage Techniques P~ OBERT 3;[ORRIS Be8 Te/epke~e Laboratories, 3iurra9 .Hill, N. Y. Scatter storage techniques as a method for implementing the symbol tables of assemblers ~and compilers are reviewed and a number of ways of using them more effectively ore presented.Many of the most useftA variants of ~e techniques are documented.
Cited by 179 works. doi:10.1145/362851.362882 Open-access PDF