Abstract
Most studies on adaptive partitioning policies for scheduling parallel jobs on distributed memory parallel computers ignore the constraints imposed by the memory requirements of the jobs. In this paper, we first show that these constraints can have a negative impact on the performance of adaptive partitioning policies. We then evaluate the performance of adaptive partitioning in a system where these minimum processor constraints are eased due to the provision of support for virtual memory. Our primary conclusion is that any performance benefits resulting from the easing of minimum processor constraints imposed by the memory requirements of jobs will be negated by the overhead due to paging.
This work was partially supported by NSF grant CCR-9409697
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
D. Burger, R. Hyder, B. Miller, and D. Wood. Paging tradeoffs in distributed shared-memory multiprocessors. In Proceedings of Supercomputing '94. IEEE, November 1994.
Rohit Chandra, Scott Devine, Ben Verghese, Mendel Rosenblum, and Anoop Gupta. Scheduling and page migration for multiprocessor compute servers. In Proceedings of ASPLOS-VI, pages 12–24. ACM, October 1994.
Su-Hui Chiang, Rajesh K. Mansharamani, and Mary K. Vernon. Use of application characteristics and limited preemption in run-to-completion parallel processor scheduling policies. In Proceedings of 1994 ACM Sigmetrics Conference, pages 33–44, Nashville, May 1994.
H. M. Deitel. An Introduction to Operating Systems. Addison-Wesley, 1984.
L. Dowdy. On the partitioning of multiprocessor systems. Technical report, Vanderbilt Univ., Nashville, TN, July 1988.
D. L. Eager, J. Zahorjan, and E. D. Lazowska. Speedup versus efficiency in parallel systems. IEEE Transactions on Computers, 38:408–423, March 1989.
D. Feitelson and L. Rudolph. Gang scheduling Performance Benefits for Fine-Grain Synchronization. Journal of Parallel and Distributed Computing, 16:306–318, 1992.
Dror Feitelson. A survey of scheduling in multiprogrammed parallel systems. Technical Report RC 19790, IBM Research Division, October 1994.
Dror Feitelson and B. Nitzberg. Job Characteristics of a Production Parallel Scientific Workload on the NASA Ames iPSC/860. In Proceedings of the IPPS 95 Workshop on Job Scheduling Strategies for Parallel Processing, pages 215–227, April 1995.
Liviu Iftode, Kai Li, and Karin Peterson. Memory servers for multicomputers. In Proceedings of the 1993 Spring CompCon, pages 538–547, February 1993.
S. Leutenegger and M. Vernon. The Performance of Multiprogrammed Multiprocessor Scheduling Policies. In Proc. of Sigmetrics '90, May 1990.
Cathy McCann and John Zahorjan. Processor allocation policies for messagepassing parallel computers. In Proceedings of 1994 ACM Sigmetrics Conference, pages 19–32, Nashville, May 1994.
Cathy McCann and John Zahorjan. Scheduling memory constrained jobs on distributed memory parallel computers. Technical Report UW-CSE-94-10-05, University of Washington, Department of Computer Science, 1994.
V. K. Naik, S. K. Setia, and M. S. Squillante. Performance Analysis of Job Scheduling Policies in Parallel Supercomputing Environments. In SuperComputing '93, November 1993.
Eric W. Parsons and Kenneth C. Sevcik. Multiprocessor Scheduling for High-Variability Service Time Distributions. In Proceedings of the IPPS 95 Workshop on Job Scheduling Strategies for Parallel Processing, pages 76–88, April 1995.
Vinod G. J. Peris, Mark S. Squillante, and Vijay K. Naik. Analysis of the impact of memory in distributed parallel processing systems. In Proceedings of 1994 ACM Sigmetrics Conference, pages 5–18, Nashville, May 1994.
E. Rosti, E. Smirni, G. Serazzi, L. Dowdy, and B. Carlson. Robust Partitioning Policies of Multiprocessor Systems. Performance Evaluation, 9(2–3), 1994.
S. K. Setia and S. K. Tripathi. A Comparative Analysis of Static Processor Partitioning Policies for Parallel Computers. In Proc. of MASCOTS '93, January 1993.
K. C. Sevcik. Characterizations of parallelism in applications and their use in scheduling. In Proc. of the ACM SIGMETRICS Conf., May 1989.
A. Tucker and A. Gupta. Process control and scheduling issues for multiprogrammed shared-memory multiprocessors. In Proc. of the 12th ACM Symposium on Operating Systems Principles, December 1989.
K. Y. Wang and Dan C. Marinescu. An analysis of the paging activity of parallel programs. Technical Report CSD-TR-94-042, Purdue University, Computer Sciences Department, June 1994.
J. Zahorjan and C. McCann. Processor scheduling in shared memory multiprocessors. In Proc. of ACM SIGMETRICS Conf., 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Setia, S.K. (1995). The interaction between memory allocation and adaptive partitioning in message-passing multicomputers. In: Feitelson, D.G., Rudolph, L. (eds) Job Scheduling Strategies for Parallel Processing. JSSPP 1995. Lecture Notes in Computer Science, vol 949. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60153-8_27
Download citation
DOI: https://doi.org/10.1007/3-540-60153-8_27
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60153-1
Online ISBN: 978-3-540-49459-1
eBook Packages: Springer Book Archive