Abstract
Scheduling dependent, preemptable tasks with regard to primary memory allocation in multiprocessor system with virtual memory and a common primary memory is considered. The system — workload complex is based on an analytic approximation to the lifetime curves of tasks. The exact algorithm which minimize the schedule length for an arbitrary number of identical processors is presented and compared with the approximate algorithm.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baskin, H.B., Borgerson, B.R., Roberts, R., PRIME - A modular architecture for terminal oriented systems. AFIPS Conf. Proc. 40 SJCC 1972, 1972.
Chamberlin, D.D., Fuller, S.H., Liu, K.Y., An analysis of page allocation strategies for multiprogramming systems with virtual memory, IBM J. Res. Develop., 1973.
Ferrari, D., Memory allocation in multiprocessing systems, in: Computer Architectures and Networks ed. E. Gelenbe, R. Mahl, North-Holland, Amsterdam, 1974.
Muntz, R.R., Coffman, E.G. Jr., Optimal preemptive scheduling on two processor systems, IEEE Trans. Computers C18, 1969.
Muntz, R.R., Coffman, E.G. Jr., Preemptive scheduling of real time tasks on multiprocessor systems, J. Assoc. Comput. Mach. 17, 1970.
Saltzer, J.H., A simple linear model of demand paging performance, Comm. ACM 17, 1974.
Węglarz, J., Time-optimal control of resource allocation in a complex of operations framework, IEEE Trans. Systems, Man and Cybernet. SMC-6, No 11, 1976.
Węglarz, J., Scheduling with memory allocation in multiprocessing systems, in: Modelling and Performance Evaluation of Computer Systems (ed. E. Gelenbe, H. Beilner), North-Holland, Amsterdam, New York, 1976.
Węglarz, J., Multiprocessor scheduling with memory allocation — a deterministic approach, (submitted for publication).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1977 Springer-Verlag Berlin · Heidelberg
About this chapter
Cite this chapter
Węglarz, J. (1977). Scheduling Dependent Tasks with Memory Allocation in Multiprocessing Systems to Minimize Schedule Length. In: Spies, P.P. (eds) Modelle für Rechensysteme. Informatik — Fachberichte, vol 9. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-45499-8_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-45499-8_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08206-4
Online ISBN: 978-3-642-45499-8
eBook Packages: Springer Book Archive