Skip to main content
Springer Nature Link
Log in

A Heuristic Algorithm for Workflow-Based Job Scheduling in Decentralized Distributed Systems with Heterogeneous Resources

  • Chapter
  • First Online:
Computer and Information Science

Part of the book series: Studies in Computational Intelligence ((SCI,volume 566))

  • 755 Accesses

Abstract

Decentralized distributed systems, such as grids, clouds or networks of sensors, have been widely investigated recently. An important nature of such systems is the heterogeneity of their resources; in order to archive the availability, scalability and flexibility. As a consequence, managing the systems to meet requirements is obviously a nontrivial work. The issue is even more challenging in term of job scheduling when the task dependency within each job exists. In this paper, we address such problem of job scheduling, so called workflow-based job scheduling, in the decentralized distributed systems with heterogeneous resources. As such problem is proven to be an NP-complete problem, an efficient heuristic algorithm to address this problem is proposed. The algorithm is based on an observation that the heterogeneity of the resources can affect the execution time of the scheduling. We compare the effectiveness and efficiency of the proposed algorithm with a baseline algorithm. The result shows that our algorithm is highly effective and efficient for the scheduling problem in the decentralized distributed system with heterogeneous resources environment both in terms of the solution quality and the execution time respectively.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Kondo, D., Andrzejak, A., Anderson, D.P.: On correlated availability in internet-distributed systems. In: Proceedings of the 9th IEEE/ACM International Conference on Grid Computing, pp. 276–283. Washington, DC, USA (2008)

    Google Scholar 

  2. Lai, K., Huberman, B.A., Fine, L.R.: Tycoon: A distributed market-based resource allocation system. Comput. Res. Repos. cs.DC/0404013 (2004)

    Google Scholar 

  3. Mainland, G., Parkes, D.C., Welsh, M.: Decentralized, adaptive resource allocation for sensor networks. In: Proceedings of the 2nd conference on Symposium on Networked Systems Design and Implementation, Vol. 2, pp. 315–328. Berkeley, CA, USA (2005)

    Google Scholar 

  4. Masuishi, T., Kuriyama, H., Oki, Y., Mori, K.: Autonomous decentralized resource allocation for tracking dynamic load change. In: Proceedings of the International Symposium on Autonomous Decentralized Systems, pp. 277–283 (2005)

    Google Scholar 

  5. Pathan, AsK, Pathan, M., Lee, H.Y.: Advancements in Distributed Computing and Internet Technologies: Trends and Issues, 1st edn. Information Science Reference - Imprint of: IGI Publishing, Hershey, PA (2011)

    Google Scholar 

  6. Sotiriadis, S., Bessis, N., Xhafa, F., Antonopoulos, N.: From meta-computing to interoperable infrastructures: A review of meta-schedulers for hpc, grid and cloud. Advanced Information Networking and Applications, International Conference on 0, 874–883 (2012). http://doi.ieeecomputersociety.org/10.1109/AINA.2012.15

  7. Tantitharanukul, N., Natwichai, J., Boonma., P.: Workflow-based composite job scheduling for decentralized distributed systems. In: Proceedings of the Sixteenth International Conference on Network-Based Information Systems (NBiS), pp. 583–588 (2013)

    Google Scholar 

  8. Tsamoura, E., Gounaris, A., Manolopoulos, Y.: Decentralized execution of linear workflows over web services. Futur. Gener. Comput. Syst. 27(3), 290–291 (2011)

    Article  Google Scholar 

Download references

Acknowledgments

The work is partially supported by Graduate School of Chiang Mai University. The authors would like to thank the colleagues at Data Engineering and Network Laboratory, Faculty of Engineering, Chiang Mai University for their support.

Author information

Authors and Affiliations

  1. Data Engineering and Network Technology Laboratory, Department of Computer Engineering, Faculty of Engineering, Chiang Mai University, Chiang Mai, 50200, Thailand

    Nasi Tantitharanukul, Juggapong Natwichai & Pruet Boonma

Authors
  1. Nasi Tantitharanukul
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Juggapong Natwichai
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Pruet Boonma
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Juggapong Natwichai .

Editor information

Editors and Affiliations

  1. Software Engineering and Information Technology Institute, Central Michigan University, Mt. Pleasant, Michigan, USA

    Roger Lee

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Tantitharanukul, N., Natwichai, J., Boonma, P. (2015). A Heuristic Algorithm for Workflow-Based Job Scheduling in Decentralized Distributed Systems with Heterogeneous Resources. In: Lee, R. (eds) Computer and Information Science. Studies in Computational Intelligence, vol 566. Springer, Cham. https://doi.org/10.1007/978-3-319-10509-3_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-10509-3_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-10508-6

  • Online ISBN: 978-3-319-10509-3

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics