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

Optimized Scheduling Procedure for Enhancing Resource Utilization in Heterogeneous Parallel Environment

Author

Listed:
  • Lovejoban Preet Singh
  • Anil Kumar

Abstract

Because of a phenomenal increment in the quantity of computing assets in various associations, compelling jobs scheduling algorithms are required for proficient asset use. Job scheduling in considered as NP difficult issue in parallel and disseminated registering situations, for example, group, matrix and mists. Metaheuristics, for example, Genetic Algorithms, Ant Colony Optimization, Artificial Bee Colony, Cuckoo Search, Firefly Algorithm, Bat Algorithm and so on are utilized by researchers to get close ideal answers for work scheduling issues. These metaheuristic algorithms are utilized to plan distinctive sorts of jobs, for example, BSP, Workflow and DAG, Independent undertakings and Bag-of-Tasks. This paper is an endeavor to give exhaustive review of prominent nature-enlivened metaheuristic procedures which are utilized to plan distinctive classifications of jobs to accomplish certain execution targets.

Suggested Citation

  • Lovejoban Preet Singh & Anil Kumar, 2018. "Optimized Scheduling Procedure for Enhancing Resource Utilization in Heterogeneous Parallel Environment," 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. 3(3), pages 1509-1518, April.
    • Handle: RePEc:jbh:ijsrcs:v3:y2018:i3:id:hcseit1833433
    Note: Article URL: https://ijsrcseit.com/CSEIT1833433
    as

    Download full text from publisher

    File URL: https://ijsrcseit.com/CSEIT1833433
    File Function: Article URL
    Download Restriction: no
    File URL: https://ijsrcseit.com/paper/CSEIT1833433.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:v3:y2018:i3:id:hcseit1833433. 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.