A Priority-Based Process Scheduling Algorithm in Cloud Computing

Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 755)


Nowadays, cloud computing is in demand as it provides progressive pliable resource allocation, for unfailing and guaranteed services in the pay-as-you-use scheme, to cloud service users. So, there is a dispensation that all resources are made available to requesting users in an efficient manner to satisfy their needs. Process scheduling has become the key issue in cloud computing. In this paper, we have presented a priority-based process scheduling (PRIPSA) algorithm, which is developed with the block-based queue in cloud computing. It concentrates on the preemptive part as well as it calculates the energy consumption and reducing starvation of process for scheduling the process in the cloud. We provide a priority-based algorithm which considered preempt able task scheduling with block-based queue using burst time and lead time. This job is being performed by the dynamic voltage and frequency scaling (DVFS) controller in our algorithm. The load management, energy consumption, reducing the starvation problem of the processes, and maximizing the revenue are the key motives of our consideration.


Block-based queue Cloud computing Energy efficiency Preemptive Priority Process scheduling 


  1. 1.
    Gupta, G., Kumawat, V.K., Laxmi, P.R., Singh, D., Jain, V., Singh, R.: A simulation of priority based earliest deadline first scheduling for cloud computing system. In: 2014 First International Conference on Networks & Soft Computing (ICNSC), pp. 35–39 (2014)Google Scholar
  2. 2.
    Dhinesh Babu, L.D., Krishna, P.V.: Honey bee behavior inspired load balancing of tasks in cloud computing environments. Appl. Soft Comput. 2292–2303 (2013). ElsevierGoogle Scholar
  3. 3.
    Shenai, S., et al.: Survey on scheduling issues in cloud computing. Procedia Eng. 38, 2881–2888 (2012). ElsevierGoogle Scholar
  4. 4.
    Casati, F., Shan, M.-C.: Definition, execution, analysis, and optimization of composite e-services. IEEE Data Eng. Bull. 24(1), 29–34 (2001)Google Scholar
  5. 5.
    Patel, S., Bhoi, U.: Priority based job scheduling techniques in cloud computing: a systematic review. Int. J. Sci. Technol. Res. 2(11), 147–152 (2013)Google Scholar
  6. 6.
    Karthick, A.V., Ramaraj, E., Subramanian, R.G.: An efficient multi queue job scheduling for cloud computing. In: 2014 World Congress on Computing and Communication Technologies (WCCCT), pp. 164–166 (2014)Google Scholar
  7. 7.
    Ergu, D., Kou, G., Peng, Y., Shi, Y., Shi, Y.: The analytic hierarchy process: task scheduling and resource allocation in cloud computing environment. J. Supercomput. (11), 1–14 (2013). SpringerGoogle Scholar
  8. 8.
    Li, J., Qiu, M., Niu, J.-W., Chen, Y., Ming, Z.: Adaptive resource allocation for preemptable jobs in cloud systems. In: 2010 10th International Conference on Intelligent Systems Design and Applications (ISDA), pp. 31–36 (2010)Google Scholar
  9. 9.
    Liu, N., Dong, Z., Rojas-Cessa, R.: Task scheduling and server provisioning for energy-efficient cloud-computing data centers. In: 2013 IEEE 33rd International Conference on Distributed Computing Systems Workshops (ICDCSW), pp. 226–231 (2013)Google Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2019

Authors and Affiliations

  1. 1.Department of Computer Science and EngineeringDaffodil International UniversityDhakaBangladesh

Personalised recommendations