Abstract
We consider a machine model in which load operations can be performed in parallel with arithmetic operations by two separate functional units. For this model, the evaluation of a set of expression trees is discussed. A dynamic programming algorithm to produce an approximate solution is described and analyzed. For binary trees its worse case cost is at most 9.1% worse than the optimal cost.
Cite
CITATION STYLE
Bernstein, D., Joffe, J. M., & Rodeh, M. (1987). Scheduling Arithmetic and load operations in parallel with no spilling. In Conference Record of the Annual ACM Symposium on Principles of Programming Languages (Vol. Part F130236, pp. 263–273). Association for Computing Machinery. https://doi.org/10.1145/41625.41649
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
