Search Results - (( java implementation max algorithm ) OR ( programming based replication algorithm ))

  • Showing 1 - 8 results of 8
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

    Adaptive persistence layer for synchronous replication (PLSR) in heterogeneous system by Beg, Abul Hashem

    Published 2011
    “…The PLSR architecture model, workflow and algorithms are described. The PLSR has been developed using Java Programming language. …”
    Get full text
    Get full text
    Thesis
  4. 4

    A cluster-based hybrid replica control protocol for high availability in data grid by Mabni, Zulaile

    Published 2019
    “…Another proposed algorithm is replica placement algorithm which selects and places only one replica in each cluster. …”
    Get full text
    Get full text
    Thesis
  5. 5
  6. 6

    An Enhanced Simulated Annealing Routing Algorithm for Semi-Diagonal Torus Network by Noraziah, Adzhar, Shaharuddin, Salleh

    Published 2017
    “…In order to achieve this objective, each node must be connected in its shortest way as possible. We start our algorithm by designing shortest path algorithm based on Dijkstra's method. …”
    Get full text
    Get full text
    Get full text
    Article
  7. 7

    Enhancing teaching and learning through data-driven optimization of servicing code demand and lecturer allocation using WEKA analysis by Rochin Demong, Nur Atiqah, Mohamed Razali, Murni Zarina, Kamaruddin, Juliana Noor, Shamsuddin, Sazwan, Awang, Nor Ain, Kamarudin, Norjuliatie, Wan Othman, Noor Faradilla

    Published 2025
    “…Complementary K-Means clustering grouped the data into two major clusters, indicating that a clear differentiation between economic-based and entrepreneurship-based courses in terms of student enrolment volume and approval distribution. …”
    Get full text
    Get full text
    Get full text
    Article
  8. 8