Advertisement

Effective Processor Allocation for Moldable Jobs with Application Speedup Model

  • Kuo-Chan Huang
  • Tse-Chi Huang
  • Yuan-Hsin Tung
  • Pin-Zei Shih
Part of the Smart Innovation, Systems and Technologies book series (SIST, volume 21)

Abstract

Traditionally, users who submit parallel jobs to supercomputing centers need to specify the amount of processors that each job requires. Job schedulers then allocate resources to each job according to the processor requirement. However, this kind of allocation has been shown leading to degraded system utilization and job turnaround time when mismatch between requirement and available resources occurs. System performance could be improved through the moldable property which most current parallel application programs have. With moldable property, parallel programs can exploit different parallelisms for execution at runtime. Previous research has shown potential performance improvement achieved by adaptive processor allocation based on the moldable property. This paper proposes effective processor allocation methods for moldable jobs, which can dynamically determine an appropriate number of processors for each job according to its speedup model and current workload situations. We evaluated the proposed approaches under three different usage scenarios through a series of simulation experiments. The experimental results indicate that our approaches outperform existing methods significantly, achieving up to 69%, 89%, and 98% performance improvement for the three usage scenarios, respectively.

Keywords

moldable property adaptive processor allocation application speedup model 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Feitelson, D.G.: A Survey of Scheduling in Multiprogrammed Parallel Systems. Research Report RC 19790 (87657), IBM T. J. Watson Research Center (October 1994)Google Scholar
  2. 2.
    Feitelson, D.G., Weil, A.M.: Utilization and Predictability in Scheduling the IBM SP2 with Backfilling. In: Proc. 12th Int’l Parallel Processing Symp., pp. 542–546 (April 1998)Google Scholar
  3. 3.
    Gibbons, R.: A Historical Application Profiler for Use by Parallel Schedulers. In: Proc. Job Scheduling Strategies for Parallel Processing, pp. 58–77. Springer (1997)Google Scholar
  4. 4.
    Lifka, D.: The ANL/IBM SP Scheduling System. In: Proc. Job Scheduling Strategies for Parallel Processing, pp. 295–303. Springer (1995)Google Scholar
  5. 5.
    Mu’alem, A.W., Feitelson, D.G.: Utilization, Predictability, Workloads, and User Runtime Estimate in Scheduling the IBM SP2 with Backfilling. IEEE Transactions on Parallel and Distributed Systems 12(6), 529–543 (2001)CrossRefGoogle Scholar
  6. 6.
    Downey, A.B.: A Model for Speedup of Parallel Programs., UC Berkeley EECS Technical Report, No. UCB/CSD-97-933 (January 1997)Google Scholar
  7. 7.
    Downey, A.B.: A Parallel Workload Model and Its Implications for Processor Allocation. In: Proc. the 6th International Symposium on High Performance Distributed Computing (1997)Google Scholar
  8. 8.
    Cirne, W., Berman, F.: Using Moldability to Improve the Performance of Supercomputer Jobs. Journal of Parallel and Distributed Computing 62, 1571–1601 (2002)zbMATHGoogle Scholar
  9. 9.
    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–207. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  10. 10.
    Sabin, G., Lang, M.: Moldable Parallel Job Scheduling Using Job Efficiency: An Iterative Approach. In: Proc. Job Scheduling Strategies for Parallel Processing, Saint Malo, France (June 2006)Google Scholar
  11. 11.
    Srinivasan, S., Krishnamoorthy, S., Sadayappan, P.: A Robust Scheduling Strategy for Moldable Scheduling of Parallel Jobs. In: Proc. 5th IEEE International Conference on Cluster Computing, pp. 92–99 (2003)Google Scholar
  12. 12.
    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)CrossRefGoogle Scholar
  13. 13.
    Sun, H., Cao, Y., Hsu, W.J.: Efficient Adaptive Scheduling of Multiprocessors with Stable Parallelism Feedback. IEEE Transactions on Parallel and Distributed System 22(4) (April 2011)Google Scholar
  14. 14.
    Huang, K.C.: Performance Evaluation of Adaptive Processor Allocation Policies for Moldable Parallel Batch Jobs. In: Proc. 3th Workshop on Grid Technologies and Applications (December 2006)Google Scholar
  15. 15.
  16. 16.
    Feitelson, D.G., Rudolph, L., Schweigelshohn, U., Sevcik, K., Wong, P.: Theory and Practice in Parallel Job Scheduling. In: Feitelson, D.G., Rudolph, L. (eds.) IPPS-WS 1997 and JSSPP 1997. LNCS, vol. 1291, pp. 1–34. Springer, Heidelberg (1997)CrossRefGoogle Scholar
  17. 17.

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Kuo-Chan Huang
    • 1
  • Tse-Chi Huang
    • 1
  • Yuan-Hsin Tung
    • 2
  • Pin-Zei Shih
    • 2
  1. 1.Department of Computer ScienceNational Taichung University of EducationTaichungTaiwan
  2. 2.Chunghwa Telecommunication LaboratoriesTaoyuanTaiwan R.O.C.

Personalised recommendations