Nadav Eiron, Michael Rodeh, et al.
ACM Journal of Experimental Algorithmics
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
Nadav Eiron, Michael Rodeh, et al.
ACM Journal of Experimental Algorithmics
David Bernstein, Izidor Gertner
ACM Transactions on Programming Languages and Systems (TOPLAS)
Nurit Dor, Michael Rodeh, et al.
PLDI 2003
Michael Rodeh
Journal of Computer and System Sciences