David Bernstein, Shmuel Gal, et al.
Communications in Statistics. Part C: Stochastic Models
Paper
On the Complexity of Scheduling Problems for Parallel/Pipelined Machines
Abstract
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
Related
Conference paper
Dynamic memory disambiguation for array references
David Bernstein, Doron Cohen, et al.
MICRO 1994
David Bernstein, Izidor Gertner
ACM Transactions on Programming Languages and Systems (TOPLAS)
David Bernstein, Jeffrey M. Joffe, et al.
POPL 1987