On the Complexity of Scheduling Problems for Parallel/Pipelined Machines
IEEE Transactions on Computers
Parallel Ada on Alliant's FX/series
TRI-Ada '88 Proceedings of the conference on TRI-Ada '88
Parallel compilation of Ada units
TRI-Ada '88 Proceedings of the conference on TRI-Ada '88
Optimal scheduling of arithmetic operations in parallel with memory access (preliminary version)
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Critical Path Scheduling with Resource and Processor Constraints
Journal of the ACM (JACM)
Critical path scheduling of task systems with resource and processor constraints (Extended Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
Minimum execution time scheduling of task systems with resources has been the subject of several papers over the past few years. The model used for much of this work assumes that the resources associated with computer systems - readers, printers, disk drives - are not "continuous" resources. We present an alternative model of task systems with resources in which the resources are discrete. That is, there are a specific number of indivisible units of each resource and a task may require only integral numbers of those units. Several results involving the worst case performance of list scheduling and critical path scheduling with respect to this model are given. A new result on critical path scheduling of task systems with continuous resources is also given. Finally, a comparison will be made between corresponding bounds for the continuous and discrete models.