Abstract
When a job arrives at a space-sharing multiprocessor system, a decision has to be made regarding the number and the specific identities of the processors to be allocated to it. An adaptive policy may consider the state of the system at arrival time but it does not allow preemption of any of the running jobs. A dynamic partitioning policy may preempt one or more of the currently running jobs to accommodate the new arrival. In this paper performance of dynamic and adaptive policies is investigated experimentally on a message passing architecture (Intel Paragon). The workload model is based on matrix computation applications commonly found on large systems used for scientific programming. Results are reported for single and multiclass cases. A sensitivity analysis with respect to workload speedup characteristics is presented. Our results show that if the preemption overheads are kept low, dynamic polices result in noticeable improvement in overall performance of the system.
Supported in part under sub-contract 19X-SL131V administered through the Mathematical Sciences Section of Oak Ridge National Laboratory.
This work was done at Vanderbilt University.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
J. Brehm, M. Madhukar, E. Smirni, L. W. Dowdy, “PerPreT — A performance prediction tool for massively parallel systems,” Int. Conf. on Modeling Techniques and Tools for Computer Performance Evaluation, September 1995.
S.-H. Chiang, R.K. Mansharamani, M.K. Vernon, “Use of application characteristics and limited preemption for run-to-completion parallel processor scheduling policies,” Proc. ACM SIGMETRICS, 1994, pp. 33–44.
K. Dussa, B.M. Carlson, L.W. Dowdy, K.-H. Park, “Dynamic partitioning in a transputer environment,” Proc. ACM SIGMETRICS, 1990, pp. 203–213.
A. Gupta, A. Tucker, S. Urushibara, “The impact of operating system scheduling policies and synchronization methods on the performance of parallel applications,” Proc. ACM SIGMETRICS, 1991, pp. 120–132.
Intel Corporation, Paragon OSF/1 User's Guide, 1993.
N. Islam, A. Prodormidis and M. Squillante, “Dynamic Partitioning in Different Distributed-Memory Environments,” In this volume.
S.T. Leutenegger, M.K. Vernon, “The performance of multiprogrammed multiprocessor scheduling policies,” Proc. ACM SIGMETRICS, 1990, pp. 226–236.
S. Majumdar, D.L. Eager, R.B. Bunt, “Scheduling in multiprogrammed parallel systems,” Proc. ACM SIGMETRICS, 1988, pp. 104–113.
C. McCann, R. Vaswani, J. Zahorjan, “A dynamic processor allocation policy for multiprogrammed shared memory multiprocessors,” ACM Transactions on Computer Systems, Vol 11(2), February 1993, pp. 146–178.
C. McCann, J. Zahorjan, “Processor allocation policies for message-passing parallel computers,” Proc. ACM SIGMETRICS, 1994, pp. 19–32.
J. Padhye, “Preemptive versus non-preemptive processor allocation policies: an empirical comparison”, Technical Report, Department of Computer Science, Vanderbilt University, 1996.
K.-H. Park, L.W. Dowdy, “Dynamic partitioning of multiprocessor systems,” International Journal of Parallel Programming, Vol 18(2), 1989, pp. 91–120.
E. Rosti, E. Smirni, L.W. Dowdy, G. Serazzi, B.M. Carlson, “Robust partitioning policies for multiprocessor systems,” Performance Evaluation, Vol 19(2–3), March 1994, pp. 141–165.
K.C. Sevcik, “Application scheduling and processor allocation in multiprogrammed multiprocessors,” Performance Evaluation, Vol 19(2–3), March 1994, pp. 107–140.
E. Smirni, E. Rosti, G. Serazzi, L. W. Dowdy, K. C. Sevcik “Performance gains from leaving idle processors in multiprocessor systems” Proc. International Conference on Parallel Processing, 1995.
S.K. Setia, M.S. Squillante, S.K. Tripathi, “Processor scheduling in multiprogrammed, distributed memory parallel computers,” Proc. ACM SIGMETRICS, 1993, pp. 158–170.
A. Tucker, A. Gupta, “Process control and scheduling issues for multiprogrammed shared-memory multiprocessors,” Proc. of the 12th ACM Symposium on Operating Systems Principles, 1989, pp. 159–166.
Mary Vernon, Personal Communication.
S. Zhou, T. Brecht, “Processor pool-based scheduling for large-scale NUMA multiprocessors,” Proc. ACM SIGMETRICS, 1991, pp. 133–242.
J. Zahorjan, C. McCann, “Processor scheduling in shared memory multiprocessors,” Proc. ACM SIGMETRICS, 1990, pp. 214–225.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Padhye, J., Dowdy, L. (1996). Dynamic versus adaptive processor allocation policies for message passing parallel computers: An empirical comparison. In: Feitelson, D.G., Rudolph, L. (eds) Job Scheduling Strategies for Parallel Processing. JSSPP 1996. Lecture Notes in Computer Science, vol 1162. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022296
Download citation
DOI: https://doi.org/10.1007/BFb0022296
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61864-5
Online ISBN: 978-3-540-70710-3
eBook Packages: Springer Book Archive