A Dynamic Storage Allocation Algorithm for Multiprocessor Computer Systems

Abstract

In this paper a dynamic storage allocation algorithm is developed. The algorithm is very suitable for multiprocessor computer systems under multiprogramming and/or time-sharing environment. It may be considered as a dynamic Bayesian type. Since all the statistical information used in the algorithm is dynamically extracted, prerunning of programs is not required at all. The technique of biasing the working parameters and the concept of dynamic activity are both applied for developing the algorithm. It is shown that the system performance is improved on the average.Although some additional cost is small. In addition the algorithm is simple in implementation.