Skip to main content

Petri Net: Design and Analysis of Parallel Task Scheduling Algorithm

  • Conference paper
  • First Online:
Advances in Electronics, Communication and Computing

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 443))

Abstract

In real time, most of the tasks are deadline based. The deadline-based task has different parameters: arrival time, start time, execution time, and deadline. Many performance-based task scheduling algorithms are proposed by number of researchers theoretically. But due to change of implement environment, the performance varies. Petri net is a graphical and mathematical model to evaluate and analysis of the system. In Petri net, conflicts are occurred during firing. In this paper, we designed and modeled the Petri net for scheduling deadline-based task by resolving the conflicts. We also proposed a scheduling mechanism and firing rules to schedule deadline-based tasks. The designed model increases the resource utilization of a physical system in cloud computing. The performance of the proposed model is analyzed using the PIPE v4.3.0. We analyzed the reach ability graph, convertibility graph, and steady-state analysis of the model.

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

Access this chapter

Institutional subscriptions

References

  1. Alkhanak, E.N.: Cost optimization approaches for scientific workflow scheduling in cloud and grid computing: a review, classifications, and open issues. J. Syst. Softw. 113, 1–26 (2016). http://www.sciencedirect.com/science/article/pii/S0164121215002484

  2. Li, X., Cai, Z.: Elastic resource provisioning for cloud workflow applications. IEEE Trans. Autom. Sci. Eng. 1–16 (2015). http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=7352380

  3. Sotomayor, B.: Resource leasing and the art of suspending virtual machines. In: 2009 11th IEEE International Conference on High Performance Computing and Communications, pp. 59–68 (2009). http://www.computer.org/portal/web/csdl/doi/10.1109/HPCC.2009.17

  4. Nathani, A., Chaudhary, S., Somani, G.: Policy based resource allocation in IaaS cloud. Future Gen. Comput. Syst. 28(1), 94–103 (2012). http://dx.doi.org/10.1016/j.future.2011.05.016

  5. Parida, S., Nayak, S., Tripathy, C.: Truth Full Resource Allocation Detection in Cloud Computing. WCI, ACM, New York, pp. 487–491

    Google Scholar 

  6. Parida, S., Nayak, S.C.: Study of deadline sensitive resource allocation scheduling policy in cloud computing. Int. J. Comput. Sci. Mobile Comput. 3(12), 521–528 (2014)

    Google Scholar 

  7. Kumar, K., Ganesh, L.S.: Use of petri nets for resource allocation in projects. IEEE Trans. Eng. Manage. 45(1), 49–56 (1998)

    Google Scholar 

  8. Colom, J.: The resource allocation problem in software applications: a Petri Net perspective, pp. 219–233 (2012)

    Google Scholar 

  9. Nayak, S.C., Tripathy, C.: Deadline sensitive lease scheduling in cloud computing environment using AHP. J. King Saud Univ. Comput. Inform. Sci. (2016). http://dx.doi.org/10.1016/j.jksuci.2016.05.003

  10. Di, S., Kondo, D., Wang, C.L.: Optimization of composite cloud service processing with virtual machines. IEEE Trans. Comput. 64(6), 1755–1768 (2015)

    MathSciNet  MATH  Google Scholar 

  11. Sotomayor, B.: Capacity leasing in cloud systems using the OpenNebula engine. Most, 2008, pp. 1–5 (2008). http://scholar.google.com/scholar?hl=en&btnG=Search&q=intitle:Capacity+Leasing+in+Cloud+Systems+using+the+OpenNebula+Engine#0

  12. Calheiros, R.N., Buyya, R.: Meeting deadlines of scientific workflows in public clouds with tasks replication. IEEE Trans. Parallel Distrib. Syst. 25(7), 1787–1796 (2014)

    Article  Google Scholar 

  13. Chaisiri, S., Member, S.: Optimization of resource provisioning cost in cloud computing. IEEE Trans. Serv. Comput. 5(2), 164–177 (2012)

    Article  Google Scholar 

  14. Duan, H.: Energy-aware scheduling of virtual machines in heterogeneous cloud computing systems. Future Gen. Comput. Syst. (2016). http://linkinghub.elsevier.com/retrieve/pii/S0167739X16300292

  15. Kalra, M., Singh, S.: A review of metaheuristic scheduling techniques in cloud computing. Egypt. Inform. J. 16(3), 275–295 (2015). http://linkinghub.elsevier.com/retrieve/pii/S1110866515000353

  16. Ergu, D.: The analytic hierarchy process: task scheduling a resource allocation in cloud computing environment. J. Supercomputing, 835–848 (2011)

    Google Scholar 

  17. Al-azzoni, I.: Server consolidation for heterogeneous computer clusters using colored petri nets and CPN tools. J. King Saud Univ. Comput. Inform. Sci. 27(4), 376–385 (2015). http://dx.doi.org/10.1016/j.jksuci.2015.02.001

  18. Kato, E.R., Morandin, O., Sgavioli, M.: A conflict solution manufacturing system modeling using fuzzy coloured Petri Net. In: 2010 IEEE International Conference on Systems Man and Cybernetics, pp. 3983–3988 (2010)

    Google Scholar 

  19. Amer-Yahia, C., Zerhouni, N., Moudni, A.E., Ferney, M.: Some subclasses of petri nets and the analysis of their structural properties: a new approach. IEEE Trans. Syst. Man Cybern. 29(2), 164–172 (1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Sasmita Parida .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Parida, S., Nayak, S.C., Priyadarshi, P., Pattnaik, P.K., Ray, G. (2018). Petri Net: Design and Analysis of Parallel Task Scheduling Algorithm. In: Kalam, A., Das, S., Sharma, K. (eds) Advances in Electronics, Communication and Computing. Lecture Notes in Electrical Engineering, vol 443. Springer, Singapore. https://doi.org/10.1007/978-981-10-4765-7_79

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-4765-7_79

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-4764-0

  • Online ISBN: 978-981-10-4765-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics