Search Results - (( java implementation max algorithm ) OR ( program text based algorithm ))

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
  5. 5
  6. 6
  7. 7
  8. 8

    Agent-based extraction algorithm for computational problem solving by Rajabi, Maryam

    Published 2015
    “…Modeling Computational Problem Solving (CPS) is the main issue in teaching programming where the given text is needed to be transformed into a model then later into a programming language. …”
    Get full text
    Get full text
    Thesis
  9. 9

    String matching algorithms: to search and compare longest common subsequence strings retrieved from Wagner & Fischer and Hirschberg algorithms on Malay dictionary words / Mohd Razi... by Mohd Ghazi, Mohd Razif

    Published 1999
    “…These are the Wagner & Fischer and Hirschberg algorithms. These methods were chosen because they are based on dynamic programming. …”
    Get full text
    Get full text
    Thesis
  10. 10
  11. 11
  12. 12
  13. 13
  14. 14
  15. 15
  16. 16
  17. 17
  18. 18
  19. 19
  20. 20