Abstract
In a computational grid environment, a common practice is try to allocate an entire parallel job onto a single participating site. Sometimes a parallel job, upon its submission, cannot fit in any single site due to the occupation of some resources by running jobs. How the job scheduler handles such situations is an important issue which has the potential to further improve the utilization of grid resources as well as the performance of parallel jobs. This paper develops adaptive processor allocation methods based on the moldable property of parallel jobs to deal with such situations in a heterogeneous computational grid environment. The proposed methods are evaluated through a series of simulations using real workload traces. The results indicate that adaptive processor allocation methods can further improve the system performance of a load sharing computational grid.
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
Hamscher, V., Schwiegelshohn, U., Streit, A., Yahyapour, R.: Evaluation of Job-Scheduling Strategies for Grid Computing. In: Proceedings of the 7th International Conference on High Performance Computing, HiPC 2000, Bangalore, India, pp. 191–202 (2000)
Ernemann, C., Hamscher, V., Yahyapour, R., Streit, A.: Enhanced Algorithms for Multi-Site Scheduling. In: Proceedings of 3rd International Workshop Grid 2002, in conjunction with Supercomputing 2002, Baltimore, MD, USA, pp. 219–231 (2002)
Ernemann, C., Hamscher, V., Schwiegelshohn, U., Streit, A., Yahyapour, R.: On Advantages of Grid Computing for Parallel Job Scheduling. In: Proceedings of 2nd IEEE International Symposium on Cluster Computing and the Grid (CC-GRID 2002), Berlin, Germany, pp. 39–46 (2002)
Ernemann, C., Hamscher, V., Streit, A., Yahyapour, R.: On Effects of Machine Configurations on Parallel Job Scheduling in Computational Grids. In: Proceedings of International Conference on Architecture of Computing Systems, pp. 169–179 (2002)
England, D., Weissman, J.B.: Costs and Benefits of Load Sharing in the Computational Grid. In: Feitelson, D.G., Rudolph, L., Schwiegelshohn, U. (eds.) JSSPP 2004. LNCS, vol. 3277, pp. 160–175. Springer, Heidelberg (2005)
Huang, K.C., Chang, H.Y.: An Integrated Processor Allocation and Job Scheduling Approach to Workload Management on Computing Grid. In: Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, Las Vegas, USA, pp. 703–709 (2006)
Sabin, G., Kettimuthu, R., Rajan, A., Sadayappan, P.: Scheduling of Parallel Jobs in a Heterogeneous Multi-Site Environment. In: Proceedings of 9th Workshop on Job Scheduling Strategies for Parallel Processing (2003)
Brune, M., Gehring, J., Keller, A., Reinefeld, A.: Managing Clusters of Geographically Distributed High-Performance Computers. Concurrency – Practice and Experience 11, 887–911 (1999)
Bucur, A.I.D., Epema, D.H.J.: The Performance of Processor Co-Allocation in Multicluster Systems. In: Proceedings of the Third IEEE International Symposium on Cluster Computing and the Grid (2003)
Bucur, A.I.D., Epema, D.H.J.: The Influence of Communication on the Performance of Co-allocation. In: Feitelson, D.G., Rudolph, L. (eds.) JSSPP 2001. LNCS, vol. 2221, pp. 66–86. Springer, Heidelberg (2001)
Bucur, A.I.D., Epema, D.H.J.: Local versus Global Schedulers with Processor Co-Allocation in Multicluster Systems. In: Feitelson, D.G., Rudolph, L., Schwiegelshohn, U. (eds.) JSSPP 2002. LNCS, vol. 2537, pp. 184–204. Springer, Heidelberg (2002)
Banen, S., Bucur, A.I.D., Epema, D.H.J.: A Measurement-Based Simulation Study of Processor Co-allocation in Multicluster Systems. In: Feitelson, D.G., Rudolph, L., Schwiegelshohn, U. (eds.) JSSPP 2003. LNCS, vol. 2862, pp. 105–128. Springer, Heidelberg (2003)
Zhang, W., Cheng, A.M.K., Hu, M.: Multisite Co-allocation Algorithms for Computational Grid. In: Proceedings of the 20th International Parallel and Distributed Processing Symposium (2006)
Feitelson, D., Rudolph, L.: Parallel Job Scheduling: Issues and Approaches. In: Proceedings of IPPS 1995 Workshop: Job Scheduling Strategies for Parallel Processing, pp. 1–18 (1995)
Ernemann, C., Hamscher, V., Yahyapour, R.: Benefits of Global Grid Computing for Job Scheduling. In: Proceedings of the Fifth IEEE/ACM International Workshop on Grid Computing, pp. 374–379 (2004)
Parallel Workloads Archive (2008), http://www.cs.huji.ac.il/labs/parallel/workload/
Foster, I., Kesselman, C.: The Grid: Blueprint for a New Computing Infrastructure. Morgan Kaufmann Publishers, Inc., San Francisco (1999)
Huang, K.C.: Performance Evaluation of Adaptive Processor Allocation Policies for Moldable Parallel Batch Jobs. In: Proceedings of the Third Workshop on Grid Technologies and Applications, Hsinchu, Taiwan (2006)
Srinivasan, S., Krishnamoorthy, S., Sadayappan, P.: A Robust Scheduling Strategy for Moldable Scheduling of Parallel Jobs. In: Proceedings of the Fifth IEEE International Conference on Cluster Computing (2003)
Cirne, W., Berman, F.: Using Moldability to Improve the Performance of Supercomputer Jobs. Journal of Parallel and Distributed Computing 62(10), 1571–1601 (2002)
Srinivasan, S., Subramani, V., Kettimuthu, R., Holenarsipur, P., Sadayappan, P.: Effective Selection of Partition Sizes for Moldable Scheduling of Parallel Jobs. In: Sahni, S.K., Prasanna, V.K., Shukla, U. (eds.) HiPC 2002. LNCS, vol. 2552, pp. 174–183. Springer, Heidelberg (2002)
Cirne, W., Berman, F.: Adaptive Selection of Partition Size for Supercomputer Requests. In: Feitelson, D.G., Rudolph, L. (eds.) IPDPS-WS 2000 and JSSPP 2000. LNCS, vol. 1911, pp. 187–208. Springer, Heidelberg (2000)
Sabin, G., Lang, M., Sadayappan, P.: Moldable Parallel Job Scheduling Using Job Efficiency: An Iterative Approach. In: Proceedings of the 12th Workshop on Job Scheduling Strategies for Parallel Processing (2006)
Barsanti, L., Sodan, A.C.: Adaptive Job Scheduling via Predictive Job Resource Allocation. In: Proceedings of the 12th Workshop on Job Scheduling Strategies for Parallel Processing (2006)
Turek, J., Ludwig, W., Wolf, J.L., Fleischer, L., Tiwari, P., Glasgow, J., Schwiegelshohn, U., Yu, P.S.: Scheduling Parallelizable Tasks to Minimize Average Response Time. In: Proceedings of the Sixth Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 200–209 (1994)
Huang, K.C., Shih, P.C., Chung, Y.C.: Towards Feasible and Effective Load Sharing in a Heterogeneous Computational Grid. In: Proceedings of the Second International Conference on Grid and Pervasive Computing, France (2007)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Huang, KC., Shih, PC., Chung, YC. (2008). Using Moldability to Improve Scheduling Performance of Parallel Jobs on Computational Grid. In: Wu, S., Yang, L.T., Xu, T.L. (eds) Advances in Grid and Pervasive Computing. GPC 2008. Lecture Notes in Computer Science, vol 5036. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68083-3_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-68083-3_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68081-9
Online ISBN: 978-3-540-68083-3
eBook Packages: Computer ScienceComputer Science (R0)