Skip to main content
SpringerLink
Log in
Book cover

Smart Computational Strategies: Theoretical and Practical Aspects pp 273–286Cite as

PEFT-Based Hybrid PSO for Scheduling Complex Applications in IoT

  • Chapter
  • First Online:

Abstract

Internet of Things (IoT) is one of the buzzwords of the recent era and the most attractive field for researchers. It is defined as a system of connected physical objects which are approachable through the Internet and are capable of exchanging data using immerse technologies such as sensors, actuators. With the continuous evolution in IoT, number of issues arises such as confined storage space as well as limited processing capabilities. These issues can be resolved by merging IoT with cloud computing, as cloud has the immeasurable storage space as well as processing ability. This combination has proved as a boon for Internet and this combination can also be used to solve workflow scheduling problem as well. Large complex applications are often represented as workflows. Workflow scheduling is one of the eminent obstacles in both IoT and cloud computing. Several approaches have been proposed for workflow scheduling such as heuristic and meta-heuristic approaches. Commonly meta-heuristics approaches include Genetic Algorithm (GA), Simulated Annealing (SA), Particle Swarm Optimization (PSO) and heuristic approaches include Critical Path on Processor (CPOP), Heterogeneous Earliest Finish Time (HEFT), and Predict Earliest Finish Time (PEFT). But, mostly these approaches fail due to increasing of tasks, unable to execute tasks within specified budget, time, cost, and many more reasons. To overcome these above mention issues, this paper presents a hybrid PSO algorithm that uses a combine approach of both heuristic and meta-heuristic techniques namely PEFT and PSO, respectively.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Srivinas, J., Reddy, K.V.S., Qyser, A.M.: Cloud computing basics. Int. J. Adv. Res. Comput. Commun. Eng. 1(5), 343–347 (2012)

    Google Scholar 

  2. Al-Roomi, M., Al-Ebrahim, S., Buqrais, S., Ahmad, I.: Cloud computing pricing models: a survey. Int. J. Grid Distrib. Comp. 6(5), 93–106 (2013). https://doi.org/10.14257/ijgdc.2013.6.5.09

  3. AlZain, M., et al.: Cloud computing security: from single to multi-clouds. In: Proceedings of the 45th Hawaii International Conference on System Science (HICSS), pp. 5490–5499. IEEE Press, California (2012). https://doi.org/10.1109/hicss.2012.153

  4. Abrishami, S., Naghibzadeh, M.: Deadline-constrained workflow scheduling in software as a service cloud. Sci. Iran. 19(13), 680–689 (2012). https://doi.org/10.1016/j.scient.2011.11.047

  5. Kumar, S., Goudar, R.H.: Cloud computing-research issues, challenges, architecture, platforms and services: a survey. Int. J. Fut. Comp. and Comm., vol. 1, no. 4, pp. 356–360 (2012). https://doi.org/10.7763/ijfcc.2012.v1.95

  6. Abrishami, S., Naghibzadeh, M., Epema, D.H.J.: Deadline-constrained workflow scheduling algorithms for infrastructure as a service clouds. Fut. Gener. Comput. Syst., 29, 158–169 (2013). https://doi.org/10.1016/j.future.2012.05.004

  7. Jain, N., Choudhary, S.: Overview of virtualization in cloud computing. In: Symposium on Colossal Data Analysis and Networking, Indore (2016)

    Google Scholar 

  8. Kavitha, K.: Study on cloud computing models and its benefits, challenges. Int. J. Innov. Res. Comput. Commun. Eng. (IJIRCCE) 2(1), 2423–2431 (2014)

    Google Scholar 

  9. Apostu, A., Puican, F., Ularu, G., Suciu, G., Todoran, G.: New classes of applications in the cloud evaluating advantage and disadvantage of cloud computing for telementary applications. Database Syst. J. 5(1),3–14 (2014)

    Google Scholar 

  10. Aazam, M., Khan, I., Alsaffar, A.A.: Cloud of things: integrating internet of things and cloud computing and the issues involved. In: Proceeding of 11th International Bhurban Conference on Applied Sciences and Technology (IBCAST), Pakistan (2014). https://doi.org/10.1109/ibcast.2014.6778179

  11. Boota, A., Donato, W., Pescape, A.: Integration of cloud computing and internet of thing: a survey. Fut. Gener. Comput. Syst. (FGCS) 56, 684–700 (2016). http://dx.doi.org/10.1016/j.future.2015.09.021

  12. Ullaman, J.D.: NP-complete scheduling problems. J. Comput. Syst. Sci. 10(3), 384–393 (1975). https://doi.org/10.1016/s0022-0000(75)80008-0

  13. Arabnejad, H., Barbosa, J.G.: List scheduling algorithm for heterogeneous systems by an optimistic cost table. IEEE Trans. Parallel Distrib. Syst. 25(3), 682–694 (2014)

    Google Scholar 

  14. Abdi, S., Motamedi, S.A., Shorfian, S.: Task scheduling using modified particle swarm optimization algorithm in cloud environment. In: International Conference on Machine Learning, Dubai, pp. 37–41 (8–9 Jan). https://doi.org/10.15242/iie.e0114078

  15. Arya, L.K., Verma, A.: Workflow scheduling algorithm in cloud environment—a survey. Eng. Comput. Sci. (RAECS), Chandigarh, India (2014). https://doi.org/10.1109/races.2014.6799514

  16. Kwok, Y.K., Ahmad, I.: Dynamic critical path scheduling: an effective technique for allocating task graph to multiprocessors. IEEE Trans. Parallel Distrib. Syst. 7(5), 506–521 (1996)

    Google Scholar 

  17. Sharma, N., Tyagi, S., Atri, S.: A survey on heuristic approach on task scheduling in cloud computing. Int. J. Adv. Res. Comput. Sci. 8(3), 260–274 (2002)

    Google Scholar 

  18. El-Rewini, H., Lewis, T.G.: Scheduling parallel program tasks onto arbitrary target machines. J. Parallel Distrib. Comput. 9(2), 138–153 (1990). https://doi.org/10.16/0743-7315(90)90042-n

    Google Scholar 

  19. Sih, G.C., Lee, E.A.: A compile-time scheduling heuristic for interconnection-constrained heterogeneous processor architecture. IEEE Trans. Parallel Distrib. Syst. 4(2), 175–187 (1993). https://doi.org/10.1109/71.207593

  20. Topcuoglu, H., Hariri, S., Wu, M.: Task scheduling algorithms for heterogeneous processors. In: Proceeding of 8th Heterogeneous Computing Workshop (HCS), USA, pp. 3–14 (1999). https://doi.org/10.1109/hcw.1999.765092

  21. Topcuoglu, H., Hariri, S., Wu, M.Y.: Performance effective and low complexity task scheduling for heterogeneous computing. IEEE Trans. Parallel Distrib. Syst. 13(3), 260–274 (2002). https://doi.org/10.1109/71.80160

  22. Sakellarion, R., Zhao, H., Tsiakkouri, E., Dikaiakos, M. D.: Scheduling workflows with budget constraint. In: Proceeding of Integrated Research in GRID Computing, pp. 189–202 (2007)

    Google Scholar 

  23. Bossche, R.V., Vanmechelen, K., Brockhone, J.: Online cost efficient scheduling of deadline constrained workloads on hybrid clouds. Fut. Gener. Comput. Syst. 29(4), 973–985 (2013). https://doi.org/10.1016/j.future.2012.12.012

  24. Bittencourt, L.F., Sakellariou, R., Madeira, E.R.M.: DAG scheduling using a lookahead variant of the heterogeneous earliest finish time algorithm. In: Proceeding of 18th Euromicro International Conference on Parallel, Distributed and Network-Based Processing, Washington, USA, pp. 27–34 (2010). https://doi.org/10.1109/pdp.2010.56

  25. Rodriguiz, M.A., Buyya, R.: Deadline based resource provisioning and scheduling algorithm for scientific workflows on clouds. IEEE Trans. Cloud Comput. 2(2), 222–235 (2014)

    Google Scholar 

  26. Chen, Z.G., Du, K.J., Zhan, Z.H., Zhang, J.: Deadline constrained cloud computing resources scheduling for cost optimization based on dynamic objective genetic algorithm. In: IEEE Congress Evolutionary Computation (CEC), pp. 708–714 (2015). https://doi.org/10.1109/cccri.2015.14

  27. Verma, A., Kaushal, S., Sangaiah, A.K.: Computational intelligence based heuristic approach for maximizing energy efficiency in internet of things. In: Intelligent Decision Support Systems for Sustainable Computing. Studies in Computational Intelligence, vol. 705, pp. 53–76. Springer, Berlin (2017). https://doi.org/10.1007/978-3-319-53153-3_4

  28. Kaur, G., Kalra, M.: Deadline constrained scheduling of scientific workflows on cloud using hybrid genetic algorithm. In: IEEE Conference, Noida (2017). https://doi.org/10.1109/confluence.2017.7943162

  29. Hassan, R., Cohanim, B., Weck, O.: A comparison of particle swarm optimization and genetic algorithm. In: 46th AIAA/ASME/ASCE/AHS/ASC structures, Structural Dynamics and Material Conference, pp. 1–13 (2005). https://doi.org/10.2514/6.2005-1897

  30. Li, Z., Liu, X., Duan, X.: Comparative research on particle swarm optimization and genetic algorithm. Comput. Inf. Sci. (CCSE) 3(1), 120–127 (2010)

    Google Scholar 

  31. Elbetagi, E., Hegazy, T., Grierson, D.: Comparison among five evolutionary based optimization algorithm. Adv. Eng. Inf. (AEI), pp. 43–53 (2005). https://doi.org/10.1016/j.aci.2005.01.004

  32. Smanchat, S., Viriyapant, K.: Taxonomies of workflow scheduling problem and techniques in the cloud. Fut. Gener. Comput. Syst. 52, 1–12 (2015). https://doi.org/10.1016/j.future.2015.04.019

  33. Bai, Q.: Analysis of particle swarm optimization algorithm. Comput. Inf. Sci. 3(1), 180–184 (2010). https://doi.org/10.5539/cis.v31p180

  34. Chavan, S.D., Adgokar, N.P.: An overview on particle swarm optimization: basic concepts and variants. Int. J. Sci. Res. (IJSR) 4(5), 255–260 (2015)

    Google Scholar 

  35. Verma, A., Singh, M.: Particle swarm optimization techniques for workflow scheduling in cloud: a survey. Int. J. Inf. Commun. Technol. 6(1–2), 385–390

    Google Scholar 

  36. Verma, A., Kaushal, S.: Cost minimization PSO based workflow scheduling plan for cloud computing. Int. J. Inf. Technol. Comput. Sci. 8, 37–43 (2015). https://doi.org/10.5815/ijites.2015.08.06

  37. Verma, A., Kaushal, S.: A hybrid multi-objective PSO for scientific workflow scheduling. Parallel Comput. 62, 1–9 (2017). https://doi.org/10.1016/j.parco.2017.01.002

Download references

Author information

Authors and Affiliations

  1. U.I.E.T., Panjab University, Chandigarh, India

    Komal Middha & Amandeep Verma

Authors
  1. Komal Middha
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Amandeep Verma
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Komal Middha .

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, Maharishi Dayanand University, Rohtak, Haryana, India

    Ashish Kumar Luhach

  2. Faculty of Electrical and Electronics Engineering, Universiti Malaysia Pahang, Pekan, Pahang, Malaysia

    Kamarul Bin Ghazali Hawari

  3. Department of Police and Behavioral Science, Alexandru Ioan Cuza Police Academy, Bucharest, Romania

    Ioan Cosmin Mihai

  4. National Chung Cheng University, Minxiong, Chiayi, Taiwan

    Pao-Ann Hsiung

  5. Department of Computer Science and Engineering, Indian Institute of Technology (BHU), Varanasi, Uttar Pradesh, India

    Ravi Bhushan Mishra

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Singapore Pte Ltd.

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Middha, K., Verma, A. (2019). PEFT-Based Hybrid PSO for Scheduling Complex Applications in IoT. In: Luhach, A.K., Hawari, K.B.G., Mihai, I.C., Hsiung, PA., Mishra, R.B. (eds) Smart Computational Strategies: Theoretical and Practical Aspects. Springer, Singapore. https://doi.org/10.1007/978-981-13-6295-8_23

Download citation

  • DOI: https://doi.org/10.1007/978-981-13-6295-8_23

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-13-6294-1

  • Online ISBN: 978-981-13-6295-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation