Proceedings. 1998 International Conference on Parallel Architectures and Compilation Techniques (Cat. No.98EX192) (1998)
Oct. 12, 1998 to Oct. 18, 1998
Wolfram Amme , Friedrich Schiller University
Peter Braun , Friedrich Schiller University
Eberhard Zehendner , Friedrich Schiller University
Francois Thomasset , INRIA
Determination of data dependences is a task typically performed with high-level language source code in today's optimizing and parallelizing compilers. Very little work has been done in the field of data dependence analysis on assembly language code, but this area will be of growing importance, e.g. for increasing ILP. A central element of a data dependence analysis in this case is a method for memory reference disambiguation which decides whether two memory operations may/must access the same memory location. In this paper we describe a new approach for determination of data dependences in assembly code. Our method is based on a sophisticated algorithm for symbolic value propagation, and it can derive value-based dependences between memory operations instead of address-based dependences, only. We have integrated our method into the \salto\ system for assembly language optimization. Experimental results show that our approach greatly improves the accuracy of the dependence analysis in many cases.
ILP, data dependence analysis, memory disambiguation
W. Amme, E. Zehendner, F. Thomasset and P. Braun, "Data Dependence Analysis of Assembly Code," Proceedings. 1998 International Conference on Parallel Architectures and Compilation Techniques (Cat. No.98EX192)(PACT), Paris, France, 1998, pp. 340.