David Bernstein, Michael Rodeh, et al.
Journal of Algorithms
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
David Bernstein, Michael Rodeh, et al.
Journal of Algorithms
Alon Itai, Michael Rodeh
FOCS 1984
Michael Rodeh, Vaughan R. Pratt, et al.
Journal of the ACM
David Bernstein, Michael Rodeh, et al.
Journal of Algorithms