Stochastic Analysis of Resource Allocation in Parallel Processing Systems

We derive an exact matrix-analytic analysis of a general stochastic model of parallel processing systems under dynamic spacesharing, which yields a closed-form solution for certain model instances. An analysis of a general nearly completely decomposable model of parallel program memory reference behavior is also derived, which provides measures of the distribution of the memory overhead incurred by a parallel program as a function of its server allocation. These theoretical results can be exploited to investigate the design and performance space of parallel processing systems with respect to fundamental tradeoffs related to the server and memory allocation strategies and their interactions.