A Statistical Study of the Performance of a Task Scheduling Algorithm

Authors:
A. F. Bashir;V. Susarla;K. Vairavan
Affiliations:
Department of Electrical Engineering and Computer Science, University of Wisconsin;-;-
Venue:
IEEE Transactions on Computers
Year:
1983

Citing 3
Cited 3

Polynomial complete scheduling problems

SOSP '73 Proceedings of the fourth ACM symposium on Operating system principles
A Preliminary Evaluation of the Critical Path Method for Scheduling Tasks on Multiprocessor Systems

IEEE Transactions on Computers
Sequential stopping rules for the regenerative method of simulation

IBM Journal of Research and Development

Integration of sensing and computing in an intelligent decision support system for homeland security defense

Pervasive and Mobile Computing
Optimizing end-to-end performance of data-intensive computing pipelines in heterogeneous network environments

Journal of Parallel and Distributed Computing
Latency modeling and minimization for large-scale scientific workflows in distributed network environments

Proceedings of the 44th Annual Simulation Symposium

Quantified Score

Hi-index	14.98

Visualization

Abstract

In this note we report the results of an experimental investigation on the performance of the very simple level scheduling algorithm for unit time task systems. Although the problem of the construction of optimal k-processor schedules for unit time tasks is NP-complete, the experimental study suggests that this efficient linear time algorithm can produce optimal schedules most of the time in the sense that the probability of producing an optimal schedule using this efficient linear time algorithm is at least 0.9 for over 700 cases randomly constructed in our experiment.