Search Results - (( evolution identification tree algorithm ) OR ( java implementation max 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

    Morphology, molecular characterization and habitat preference of harmful Benthic dinoflagellate gambierdiscus (Dinophyceae) in Malaysia / Nurin Izzati Mustapa by Nurin Izzati , Mustapa

    Published 2020
    “…Taxon sampling on the small subunit (SSU) and large subunit (LSU) ribosomal RNA genes (rDNAs) of Gambierdiscus was performed for phylogenetic reconstruction using branch swapping algorithm. Morphological character states were coded and mapped onto the molecular phylogenetic tree (MP tree) to investigate the character state evolution of Gambierdiscus species. …”
    Get full text
    Get full text
    Get full text
    Thesis
  4. 4
  5. 5