IDEAS home Printed from https://ideas.repec.org/a/jbh/ijsrcs/v4y2018i3idhcseit184313.html

Task Scheduling and Resource Allocation Using a Heuristic Approach In Cloud Computing

Author

Listed:
  • K. Durailingam
  • V.S. Prakash

Abstract

Cloud computing is needed by trendy technology. Task planning and resource allocation are vital aspects of cloud computing. This paper proposes a heuristic approach that mixes the changed analytic hierarchy method (MAHP), bandwidth aware divisible scheduling (BATS) + BAR optimization, longest expected processing time preemption (LEPT), and divide-and-conquer strategies to perform task planning and resource allocation. During this approach, every task is processed before its actual allocation to cloud resources using a MAHP process. The resources are allocated victimization the combined haywire + BAR optimization methodology, that considers the information measure and cargo of the cloud resources as constraints. Additionally, the planned system preempts resource intensive tasks exploitation LEPT preemption. The divide-and-conquer approach improves the planned system, as is established by experimentation through comparison with the existing bats and improved differential evolution algorithmic rule (IDEA) frameworks once turnaround and time interval square measure used as performance metrics.

Suggested Citation

  • K. Durailingam & V.S. Prakash, 2018. "Task Scheduling and Resource Allocation Using a Heuristic Approach In Cloud Computing," International Journal of Scientific Research in Computer Science, Engineering and Information Technology, International Journal of Scientific Research in Computer Science, Engineering and Information Technology, vol. 4(3), pages 71-81, March.
  • Handle: RePEc:jbh:ijsrcs:v4:y2018:i3:id:hcseit184313
    Note: Article URL: https://ijsrcseit.com/CSEIT184313
    as

    Download full text from publisher

    File URL: https://ijsrcseit.com/CSEIT184313
    File Function: Article URL
    Download Restriction: no

    File URL: https://ijsrcseit.com/paper/CSEIT184313.pdf
    File Function: Full text
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;
    ;

    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:jbh:ijsrcs:v4:y2018:i3:id:hcseit184313. 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: Pankaj Sharma (USA) (email available below). General contact details of provider: https://ijsrcseit.com/home .

    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.