Anomalies in scheduling unit-time tasks.
Anomalies in scheduling unit-time tasks.
Memory-constrained task scheduling on a network of dual processors
Journal of the ACM (JACM)
Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming Computer Systems
Journal of the ACM (JACM)
Critical Path Scheduling with Resource and Processor Constraints
Journal of the ACM (JACM)
Deterministic Processor Scheduling
ACM Computing Surveys (CSUR)
An approach to optimization of horizontal microprograms
MICRO 7 Conference record of the 7th annual workshop on Microprogramming
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
Scheduling independent processors with different storage capacities
ACM '74 Proceedings of the 1974 annual conference - Volume 1
Scheduling tasks with critical sections
ACM '77 Proceedings of the 1977 annual conference
Toward Optimization of Horizontal Microprograms
IEEE Transactions on Computers
A Preliminary Evaluation of the Critical Path Method for Scheduling Tasks on Multiprocessor Systems
IEEE Transactions on Computers
| Hi-index | 0.01 |
A number of authors (of. [12],[6], [7],[3],[11],[4],[5],[9]) have recently been concerned with scheduling problems associated with a certain model of an abstract multiprocessing system (to be described in the next section) and, in particular, with bounds on the worst-case behavior of this system as a function of the way in which the inputs are allowed to vary. In this paper, we introduce an additional element of realism into the model by postulating the existence of a set of “resources” with the property that at no time may the system use more than some predetermined amount of each resource. With this extra constraint taken into consideration, we derive a number of bounds on the behavior of this augmented system. It will be seen that this investigation leads to several interesting results in graph theory and analysis.