Nissim Franeez, Michael Rodeh
FOCS 1980
We consider a machine model with two functional units, each can be either sequential or pipelined. The complexity of optimal scheduling for a set of expressions on such machines is investigated. We review some previous NP-completeness results, and present several new ones. For one restricted case, a polynomial time algorithm is described and analyzed. © 1989 IEEE
Nissim Franeez, Michael Rodeh
FOCS 1980
Michael Rodeh, Mooly Sagiv
Journal of the ACM
Alon Itai, Michael Rodeh
STOC 1977
David Bernstein, Doron Cohen, et al.
MICRO 1994