Scheduling Multiprocessor Tasks to Minimize Schedule Length

@article{Blazewicz1986SchedulingMT,
  title={Scheduling Multiprocessor Tasks to Minimize Schedule Length},
  author={Jacek Blazewicz and Mieczyslaw Drabowski and Jan Weglarz},
  journal={IEEE Transactions on Computers},
  year={1986},
  volume={C-35},
  pages={389-393}
}
The problem considered in this paper is the deterministic scheduling of tasks on a set of identical processors. However, the model presented differs from the classical one by the requirement that certain tasks need more than one processor at a time for their processing. This assumption is especially justified in some microprocessor applications and its impact on the complexity of minimizing schedule length is studied. First we concentrate on the problem of nonpreemptive scheduling. In this case… CONTINUE READING