Skip to main content

Advertisement

SpringerLink
Log in
Menu
Find a journal Publish with us
Search
Cart
Book cover

IFIP International Conference on Network and Parallel Computing

NPC 2012: Network and Parallel Computing pp 1–13Cite as

  1. Home
  2. Network and Parallel Computing
  3. Conference paper
An Application-Level Scheduling with Task Bundling Approach for Many-Task Computing in Heterogeneous Environments

An Application-Level Scheduling with Task Bundling Approach for Many-Task Computing in Heterogeneous Environments

  • Jian Xiao20,
  • Yu Zhang20,
  • Shuwei Chen20 &
  • …
  • Huashan Yu20 
  • Conference paper
  • 2357 Accesses

  • 6 Citations

Part of the Lecture Notes in Computer Science book series (LNTCS,volume 7513)

Abstract

Many-Task Computing (MTC) is a widely used computing paradigm for large-scale task-parallel processing. One of the key issues in MTC is to schedule a large number of independent tasks onto heterogeneous resources. Traditional task-level scheduling heuristics, like Min-Min, Sufferage and MaxStd, cannot readily be applied in this scenario. As most of MTC tasks are usually fine-grained, the resource management overhead would be prominent and the multi-core nodes might become hard to be fully utilized. In this paper we propose an application-level scheduling with task bundling approach that utilizes the knowledge of both applications and tasks to overcome these difficulties. Furthermore we adapt the traditional task-level heuristics to our model for MTC scheduling. Experimental results show that these application-level scheduling approaches, when equipped with task bundling, can deliver good performance for Many-Task Computing in terms of both Makespan and Flowtime.

Keywords

  • application-level scheduling
  • many task computing
  • task bundling
  • traditional scheduling heuristics

Download conference paper PDF

References

  1. Raicu, I., Zhang, Z., Wilde, M., Foster, I.T., Beckman, P.H., Iskra, K., Clifford, B.: Toward Loosely Coupled Programming on Petascale Systems. IEEE/ACM Super Computing (2008)

    Google Scholar 

  2. Raicu, I., Foster, I., Zhao, Y.: Many-Task Computing for Grids and Supercomputers. In: IEEE Workshop on Many-Task Computing on Grids and Supercomputers, MTAGS 2008 (2008)

    Google Scholar 

  3. Isard, M., Prabhakaran, V., Currey, J., Wieder, U., Talwar, K., Goldberg, A.: Quincy: Fair Scheduling for distributed Computing Clusters. In: OSDI 2010 (2010)

    Google Scholar 

  4. Kim, N., et al.: ECgene: Genome-based EST clustering and gene modeling foralternative splicing. Genome. Res. 15, 566–576 (2005)

    CrossRef  Google Scholar 

  5. Yu, H., Li, Y., Wu, X., Xiao, J., Li, X.: A Self-Optimizing Computation Partitioning Algorithm for Distributed Many-task Computing. In: China Grid 2010 (2010)

    Google Scholar 

  6. Xu, J., Lam, A.Y.S., Li, V.O.K.: Chemical reaction optimization for task scheduling in grid computing. IEEE Trans. Parallel Distrib. Systems (2011)

    Google Scholar 

  7. Garey, M.R., Johnson, D.S.: ‘Strong’ NP-CompletenessResults: Motivation, Examples, and Implications. J. Association for Computing Machinery 25(3), 499–508 (1978)

    CrossRef  MathSciNet  MATH  Google Scholar 

  8. Braun, T.D., Hensgen, D., Freund, R.F., Siegel, H.J., Beck, N., Boloni, L.L., Maheswaran, M., Reuther, A.I., Robertson, J.P., Theys, M.D., Yao, B.: A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems. J. Parallel and Distributed Comput. 61(6), 810–837 (2001)

    CrossRef  Google Scholar 

  9. Maheswaran, M., Ali, S., Siegel, H.J., Hensgen, D., Freund, R.F.: Dynamic matching and scheduling of a class of independent tasks onto heterogeneous computing systems. In: Proceedings of the Eighth Heterogeneous Computing Workshop (1999)

    Google Scholar 

  10. Munir, E.U., Li, J.-Z., Shi, S.-F., Zou, Z., Yang, D.: MaxStd: A Task Scheduling Heuristic for Heterogeneous Computing Environment. Information Technology Journal, ISSN-1812-5638

    Google Scholar 

  11. Izakian, H., Ladani, B.T., Zamanifar, K., Abraham, A.: A Novel Particle Swarm Optimization Approach for Grid Job Scheduling. In: Proc. Third Int’l Conf. Information Systems, Technology and Management, vol. 31, pp. 100–109 (March 2009)

    Google Scholar 

  12. Iosup, A., Sonmez, O.O., Anoep, S., Epema, D.H.J.: The performance of bags-of-tasks in large-scale distributed systems. In: International Symposium on High-Performance Distributed Computing (HPDC), pp. 97–108. ACM (2008)

    Google Scholar 

  13. Raicu, I., et al.: Falkon: a Fast and Light-weight task execution framework. IEEE/ACM Super Computing (2007)

    Google Scholar 

  14. Li, Y., Wu, X., Xiao, J., Zhang, Y., Yu, H.: A Scheduling Algorithm Based on Task Complexity Estimating for Many-Task Computing. In: SKG 2010 (2010)

    Google Scholar 

  15. Ali, S., Siegel, H.J., Maheswaran, M., Ali, S., Hensgen, D.: Task execution time modeling for heterogeneous computing systems. In: Proceedings of the Ninth Heterogeneous Computing Workshop, pp. 185–200 (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Electronic Engineering and Computer Science, Peking University, Beijing, 100871, P.R. China

    Jian Xiao, Yu Zhang, Shuwei Chen & Huashan Yu

Authors
  1. Jian Xiao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yu Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Shuwei Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Huashan Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, SeoulTech, 172 Gongreung 2-dong, Nowon-gu, 139-743, Seoul, Korea

    James J. Park

  2. School of Information Technologies, The University of Sydney, Building J12, 2006, Sydney, NSW, Australia

    Albert Zomaya

  3. Division of Computer Engineering, Mokwon University, 88 Do-An-Buk-Ro, Seo-gu, 302-729, Daejeon, Korea

    Sang-Soo Yeo

  4. Department of Computer and Information Science and Engineering, University of Florida, CSE 301, 32611, Gainesville, FL, USA

    Sartaj Sahni

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 IFIP International Federation for Information Processing

About this paper

Cite this paper

Xiao, J., Zhang, Y., Chen, S., Yu, H. (2012). An Application-Level Scheduling with Task Bundling Approach for Many-Task Computing in Heterogeneous Environments. In: Park, J.J., Zomaya, A., Yeo, SS., Sahni, S. (eds) Network and Parallel Computing. NPC 2012. Lecture Notes in Computer Science, vol 7513. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35606-3_1

Download citation

  • .RIS
  • .ENW
  • .BIB
  • DOI: https://doi.org/10.1007/978-3-642-35606-3_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-35605-6

  • Online ISBN: 978-3-642-35606-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Share this paper

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

Search

Navigation

  • Find a journal
  • Publish with us

Discover content

  • Journals A-Z
  • Books A-Z

Publish with us

  • Publish your research
  • Open access publishing

Products and services

  • Our products
  • Librarians
  • Societies
  • Partners and advertisers

Our imprints

  • Springer
  • Nature Portfolio
  • BMC
  • Palgrave Macmillan
  • Apress
  • Your US state privacy rights
  • Accessibility statement
  • Terms and conditions
  • Privacy policy
  • Help and support

167.114.118.210

Not affiliated

Springer Nature

© 2023 Springer Nature