Abstract
The problem of optimal processor allocation in parallel systems in the presence of nonlinear dynamics is considered. The flow of parallel jobs is modelled as that of a continuous fluid, and the Maximum Principle is applied to the resulting problem. The optimal fluid solution provides a lower bound on performance. Based on the optimal solution, several suboptimal (static partitioning) policies are proposed, and their performance is shown to be close to the lower bound in numerical examples.
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
Chiang, S.-H., Mansharamani, R., and Vernon, M. Use of application characteristics and limited preemption for run-to-completion parallel processor scheduling policies. In Proc. ACM Sigmetrics Conf., pages 33–44.
Islam, N., Prodromidis, A., Squillante, M., Fong, L., and Gopal, A. (1997). Extensible resource management for cluster computing. In Proc. Int. Conf. Dist. Comp.
McCann, C., Vaswani, R., and J. Zahorjan. A dynamic processor allocation policy for multiprogrammed shared-memory multiprocessors. ACM Trans. Comp. Sys., 11.
Ousterhout, J. Scheduling techniques for concurrent systems. In Proc. Int. Conf. Dist. Comp., pages 22–30.
Parsons, E. and Sevcik, K. (1996). Coordinated allocation of memory and processors in multiprocessors. In Proc. ACM Sigmetrics Conf., pages 57–67.
Peris, V., Squillante, M., and Naik, V. (1994). Analysis of the impact of memory in distributed parallel processing systems. In Proc. ACM Sigmetrics Conf., pages 5–18.
Pontryagin, L., Boltyansky, V., Gamkrelidze, R., and Mishchenko, E. (1961). The Mathematical Theory of Optimal Processes. Nauka, Moscow.
Rosti, E., Serazzi, G., Smirni, E., and Squillante, M. (1998). The impact of i/o on program behavior and parallel scheduling. In Proc. ACM Sigmetrics Conf., pages 56–64.
Rosti, E., Smirni, E., Dowdy, L., Serazzi, G., and Carlson, B. (1994). Robust partitioning policies of multiprocessor systems. Performance Evaluation, 19:141–165.
Setia, S. (1995). The interaction between memery allocation and adaptive partitioning in message-passing multicomputers. In Feitelson, D. and Rudolph, L., editors, Job Scheduling Strategies for Parallel Processing, volume 949 of Lecture Notes in Comp. Sci., pages 146–164. Springer.
Squillante, M. (1995). On the benefits and limitations of dynamic partitioning in parallel computer systems. In Feitelson, D. and Rudolph, L., editors, Job Scheduling Strategies for Parallel Processing, volume 949 of Lecture Notes in Comp. Sci., pages 219–238. Springer.
Squillante, M., Wang, F., and Papaefthymiou, M. Stochastic analysis of gang scheduling in parallel and distributed systems. Performance Evaluation, 27.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer Science+Business Media New York
About this chapter
Cite this chapter
Bertsimas, D., Perevalov, E. (2003). Fluid Models for Parallel Processor Allocation. In: Bhargava, H.K., Ye, N. (eds) Computational Modeling and Problem Solving in the Networked World. Operations Research/Computer Science Interfaces Series, vol 21. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-1043-7_14
Download citation
DOI: https://doi.org/10.1007/978-1-4615-1043-7_14
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-5366-9
Online ISBN: 978-1-4615-1043-7
eBook Packages: Springer Book Archive