Search Results - (( java implementation max algorithm ) OR ( waste selection path algorithm ))

  • Showing 1 - 5 results of 5
Refine Results
  1. 1

    OPTIMIZED MIN-MIN TASK SCHEDULING ALGORITHM FOR SCIENTIFIC WORKFLOWS IN A CLOUD ENVIRONMENT by Murad S.S., Badeel R., Alsandi N.S.A., Alshaaya R.F., Ahmed R.A., Muhammed A., Derahman M.

    Published 2023
    “…To achieve this, we propose a new noble mechanism called Optimized Min-Min (OMin-Min) algorithm, inspired by the Min-Min algorithm. The objectives of this work are: i) to provide a comprehensive review of the cloud and scheduling process; ii) to classify the scheduling strategies and scientific workflows; iii) to implement our proposed algorithm with various scheduling algorithms (i.e., Min-Min, Round-Robin, Max-Min, and Modified Max-Min) for performance comparison, within different cloudlet sizes (i.e., small, medium, large, and heavy) in three scientific workflows (i.e., Montage, Epigenomics, and SIPHT); and iv) to investigate the performance of the implemented algorithms by using CloudSim. …”
    Review
  2. 2

    Batch mode heuristic approaches for efficient task scheduling in grid computing system by Maipan-Uku, Jamilu Yahaya

    Published 2016
    “…Many algorithms have been implemented to solve the grid scheduling problem. …”
    Get full text
    Get full text
    Get full text
    Thesis
  3. 3
  4. 4

    Flexible window-based scheduling with critical worst case latency evaluations for real time traffic in time sensitive networks by Muftah, Shalghum Khaled

    Published 2022
    “…Also, implementing all GCLs in the selected path based on TT evaluations without considering their impacts on the AVB performance results in improper scheduling designs. …”
    Get full text
    Get full text
    Thesis
  5. 5

    Evolutionary cost-cognizant regression test case prioritization for object-oriented programs by Bello, AbdulKarim

    Published 2019
    “…Re-execution of all test cases can be expensive as there might be wasting resources, could be costly and time consuming. …”
    Get full text
    Get full text
    Thesis