An empirical investigation of OR indexing

ABSTRACT

This paper considers OR indexing as a substitute for, or an optimization of, addition in an addressing mode for a high speed processor. OR indexing is evaluated in the context of existing address streams, using time based sampling, and through compiler modifications.

REFERENCES

• 1: {Avizienis} Algirdas Avizienis, <i>Signed-Digit Number Representations for Fast Parallel Arithmetic</i>, <b>IRE Transactions on Electronic Computers</b>, EC-10 #3, September 1961, pp. 389--400.
• 2: Donald E. Knuth, The art of computer programming, volume 1 (3rd ed.): fundamental algorithms, Addison Wesley Longman Publishing Co., Inc., Redwood City, CA, 1997
• 3: {Glew} Andy Glew, <i>ORed Indexing</i>, <b>EE497Hwu Project Report</b>, May 1988.
• 4: F. Chow , S. Correll , M. Himelstein , E. Killian , L. Weber, How many addressing modes are enough?, Proceedings of the second international conference on Architectual support for programming languages and operating systems, p.117-121, October 1987, Palo Alto, California, United States
• 5: Gordon B. Steven, A novel effective address calculation mechanism for RISC microprocessors, ACM SIGARCH Computer Architecture News, v.16 n.4, p.150-156, Sept. 1988 [doi>10.1145/54331.54344]
• 6: {Wulf} W. A. <i>Compilers and Computer Architecture</i>, <b>Computer</b>, IEEE Computer Society, July 1981 pp. 41--47.
• 7: William Allan Wulf , Richard K. Johnsson , Charles B. Weinstock , Steven O. Hobbs , Charles M. Geschke, The Design of an Optimizing Compiler, Elsevier Science Inc., New York, NY, 1975