IDEAS home Printed from https://ideas.repec.org/a/igg/jirr00/v11y2021i3p34-48.html
   My bibliography  Save this article

Energy-Efficient Virtualized Scheduling and Load Balancing Algorithm in Cloud Data Centers

Author

Listed:
  • J. K. Jeevitha

    (PSNA College of Engineering and Technology, India)

  • Athisha G.

    (PSNA College of Engineering and Technology, India)

Abstract

To scale back the energy consumption, this paper proposed three algorithms: The first one is identifying the load balancing factors and redistribute the load. The second one is finding out the most suitable server to assigning the task to the server, achieved by most efficient first fit algorithm (MEFFA), and the third algorithm is processing the task in the server in an efficient way by energy efficient virtual round robin (EEVRR) scheduling algorithm with FAT tree topology architecture. This EEVRR algorithm improves the quality of service via sending the task scheduling performance and cutting the delay in cloud data centers. It increases the energy efficiency by achieving the quality of service (QOS).

Suggested Citation

  • J. K. Jeevitha & Athisha G., 2021. "Energy-Efficient Virtualized Scheduling and Load Balancing Algorithm in Cloud Data Centers," International Journal of Information Retrieval Research (IJIRR), IGI Global, vol. 11(3), pages 34-48, July.
  • Handle: RePEc:igg:jirr00:v:11:y:2021:i:3:p:34-48
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJIRR.2021070103
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jirr00:v:11:y:2021:i:3:p:34-48. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.