Abstract
An infinite stream of independent jobs composed of sets of dependent tasks, which are being fed into a uniprocessor computer system with nonpreemptible resources is considered. A joint approach is presented, to optimization of a given system performance measure, namely mean flow time of jobs, and the solution of the system performance failure problems, namely the determinacy of the set of tasks, deadlock and permanent blocking. For deadlock avoidance the approach is applied which radically reduces overhead involved without losing the benefit of improved resource utilization.
Chapter PDF
Similar content being viewed by others
References
Baer, J.L., A survey of some theoretical aspects of multiprocessing, Computing Surveys vol. 5, No 1, 1973.
Bernstein, A.J., Analysis of programs for parallel processing, IEEE Trans. Comp. vol EC-15, 1966, No 5.
Cellary, W., On resource allocation policies in uniprocessor systems with nonpreemptible resources, MTA SZTAKI Tanulmanyok 69, 1977.
Cellary, W., Resource allocation strategies in computer systems with nonpreemptible resources, Foundations of Control Engineering, vol. 2, No 3, 1977.
Cellary, W., Task scheduling in systems with nonpreemptible resources, in: H. Beilner and E. Gelenbe, Medelling and Performance Evaluation of Computer Systems, /Proc. of the III International Symposium/, North Holland Publishing Co., 1977.
Coffman, E.G., Jr., M.J. Elphick, A. Shoshani, System deadlocks, Computing Surveys vol. 2, No 3, 1971.
Coffman, E.G., Jr., P.J. Denning, Operating Systems Theory, Prentice Hall, Englewood Cliffs, N.J., 1973.
Habermann, A.N., A new approach to avoidance of system deadlocks, Revue Francaise d'Automatique, Informatique et Recherche Opérationelle 9. sept B-3, 1975
Habermann, A.N., Prevention of system deadlocks, Comm. ACM vol 12, No 7, 1969.
Holt, R.C., Comments on prevention of system deadlocks, Comm. ACM, vol. 14, No 1, 1971.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1978 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cellary, W. (1978). Scheduling dependent tasks from an infinite stream in systems with nonpreemptible resources. In: Bracchi, G., Lockemann, P.C. (eds) Information Systems Methodology. ECI 1978. Lecture Notes in Computer Science, vol 65. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08934-9_96
Download citation
DOI: https://doi.org/10.1007/3-540-08934-9_96
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08934-6
Online ISBN: 978-3-540-35731-5
eBook Packages: Springer Book Archive