Ruixiong Tian, Zhe Xiang, et al.
Qinghua Daxue Xuebao/Journal of Tsinghua University
A machine model in which load operations can be performed in parallel with arithmetic operations by two separate functional units is considered. For this model, the evaluation of a set of expression trees is discussed. A dynamic programming algorithm for producing an approximate solution is described and analyzed. For binary trees its worse-case cost is at most min (1.091, 1 + (2 log n)/n) times the optimal cost.
Ruixiong Tian, Zhe Xiang, et al.
Qinghua Daxue Xuebao/Journal of Tsinghua University
Robert E. Donovan
INTERSPEECH - Eurospeech 2001
Yigal Hoffner, Simon Field, et al.
EDOC 2004
S. Sattanathan, N.C. Narendra, et al.
CONTEXT 2005