On the Complexity of Scheduling Problems for Parallel/Pipelined Machines

  title={On the Complexity of Scheduling Problems for Parallel/Pipelined Machines},
  author={David Bernstein and Michael Rodeh and Izidor Gertner},
  journal={IEEE Trans. Computers},
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. 
45 Citations
8 References
Similar Papers


Publications citing this paper.
Showing 1-10 of 45 extracted citations


Publications referenced by this paper.
Showing 1-8 of 8 references

Scheduling processor bound systems,

  • D. K. Goyal
  • Proc. Sixth Texas Conf. Comput. Syst.,
  • 1977

and the D.Sc. degree in computer science from the TechnionIsrael Institute of Technology, Haifa

  • Science, Rehovot, Israel
  • He joined IBM Israel Scientific Center in
  • 1971

S’76-M’78) was born in Kaunas, U.S.S.R., on June 4, 1946. He received the Radio Engineer diploma (M.S.E.E.) from Kaunas Politechnical Institute, U.S.S.R

  • Technion. Izidor Gertner
  • 1968

He received the B.Sc. degree in mathematics and physics (with distinction) from the Hebrew University, Jerusalem, Israel

  • Michael Rodeh
  • 1949

Optimization and approximation in deterministic sequencing and scheduling : A survey

  • A. H. G. Rinnoy Kan
  • Discrete Optimization

Similar Papers

Loading similar papers…