Execution Time Based Sufferage Algorithm for Static Task Scheduling in Cloud

  • H. KrishnaveniEmail author
  • V. Sinthu Janita Prakash
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 750)


In cloud computing applications, storage of data and computing resources are rendered as a service to the clients via the Internet. In the advanced cloud computing applications, efficient task scheduling plays a significant role to enhance the resource utilization and improvise the overall performance of cloud. This scheduling is vital for attaining a high performance schedule in a heterogeneous-computing system. The existing scheduling algorithms such as Min-Min, Sufferage and Enhanced Min-Min, focused only on reducing the makespan but failed to consider the other parameters like resource utilization and load balance. This paper intends to develop an efficient algorithm namely Execution Time Based Sufferage Algorithm (ETSA) that take into account, the parameters makespan and also the resource utilization for scheduling the tasks. It is implemented in Java with Eclipse IDE and a set of ETC matrices are used in experimentation to evaluate the proposed algorithm. The ETSA delivers better makespan and resource utilization than the other existing algorithms.


Cloud computing Scheduling Makespan 


  1. 1.
    Shawish, A., Salama, M.: Cloud Computing: Paradigms and Technologies, pp. 39–67. Springer, BerlinGoogle Scholar
  2. 2.
    Awad, A.I., El-Hefnawy, N.A., Abdel_kader, H.M.: Enhanced particle swarm optimization for task scheduling in cloud environments. In: International Conference on Communication, Management and Information Technology. Procedia Computer Science, Elsevier B.V. (2015)Google Scholar
  3. 3.
    Yang, T., Cong, F., Pyramid, S., Jose, S.: Space/time-efficient scheduling and execution of parallel irregular computations. ACM 20, 1195–1222 (1998)Google Scholar
  4. 4.
    Maheswaran, M., Ali, S., Siegel, H.J., Hensgen, D., Freund, R.F.: Dynamic mapping of a class of independent tasks onto heterogeneous computing systems. J. Parallel Distrib. Comput. 59, 107–131 (1999)CrossRefGoogle Scholar
  5. 5.
    Braun, T.D., Siegel, H.J., Beck, N.: A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems. J. Parallel Distrib. Comput. 61, 810–837 (2001)CrossRefGoogle Scholar
  6. 6.
    Parsa, S., Entezari-Maleki, R.: RASA: a new grid task scheduling algorithm. Int. J. Digit. Content Technol. Appl. pp. 91–99 (2009)Google Scholar
  7. 7.
    Haladu, M., Samual, J.: Optimizing task scheduling and resource allocation in cloud data center, using enhanced Min-Min algorithm. IOSR J. Comput. Eng. 18, 18–25 (2016)CrossRefGoogle Scholar
  8. 8.
    Chawda, P., Chakraborty, P.S.: An improved min-min task scheduling algorithm for load balancing in cloud computing. Int. J. Recent Innovation Trends Comput. Commun. 4, 60–64 (2016)Google Scholar
  9. 9.
    Kokilavani, T., George Amalarethinam, D.I.: EMGEN—a tool to create ETC matrix with memory characteristics for meta task scheduling in grid environment. Int. J. Comput. Sci. Appl. 2, 84–91 (2013)Google Scholar
  10. 10.
    Jinquan, Z., Lina, N., Changjun, J.: A heuristic scheduling strategy for independent tasks on grid. In: Proceedings of the Eighth International Conference on High-Performance Computing in Asia-Pacific Region (2005)Google Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2019

Authors and Affiliations

  1. 1.Department of Computer ScienceCauvery College for WomenTrichyIndia

Personalised recommendations