Search Results - (( problem sharing process algorithm ) OR ( java application matching algorithm ))

Refine Results
  1. 1

    Enhancement of Ant Colony Optimization for Grid Job Scheduling and Load Balancing by Husna, Jamal Abdul Nasir

    Published 2011
    “…A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against existing grid resource management algorithms such as Antz algorithm, Particle Swarm Optimization algorithm, Space Shared algorithm and Time Shared algorithm, in terms of processing time and resource utilization. …”
    Get full text
    Get full text
    Get full text
    Thesis
  2. 2
  3. 3

    Accounting Information Systems Genetic Algorithms for All-Optical Shared Fiber-Delay-Line Packet Switches by Liew, S.Y., Wong, E.S.K.

    Published 2009
    “…In the first algorithm, packet scheduling is formulated as a tree-searching problem. …”
    Get full text
    Get full text
    Get full text
    Article
  4. 4

    Enhanced Harris's Hawk algorithm for continuous multi-objective optimization problems by Yasear, Shaymah Akram

    Published 2020
    “…This indicates the capability of the algorithm in exploring the search space. The 2S-ENDSHHMO algorithm can be used to improve the search process of other MOSI-based algorithms and can be applied to solve MOPs in applications such as structural design and signal processing.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  5. 5

    Collaboration algorithms between intermediaries for supporting flexible supply chain management by Mohd Tamrin, Mohd Izzuddin, Tengku Sembok, Tengku Mohd, Kartiwi, Mira

    Published 2013
    “…The results demonstrate that the IIMA has the most stable performance in supporting the shared processes when stoke by the problems at both stages of the processes. …”
    Get full text
    Get full text
    Get full text
    Article
  6. 6
  7. 7
  8. 8

    Comparison of anonymous tracker algorithms / Nur Shafikah Mat Daud by Mat Daud, Nur Shafikah

    Published 2014
    “…By using the IP Address, can help easily to track location of anonymous. Then, time processing and accuracy which one is the best of algorithms will be determine. …”
    Get full text
    Get full text
    Thesis
  9. 9
  10. 10

    Securing cloud data system (SCDS) for key exposure using AES algorithm by Thabet Albatol, Mohammed Samer Hasan

    Published 2021
    “…The AES algorithm has its own structure to encrypt and decrypt sensitive data that make the attackers difficult to get the real data when encrypting by AES algorithm. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  11. 11

    The comparison of tardiness in scheduling techniques for task distribution using grid simulation tool by Stapa @ Mustapa, Muhamad Azhar

    Published 2008
    “…Today scheduling in Grid computing involves much static and fix algorithm. Research on Grid scheduling focuses in solving three problems: finding a good algorithm, automating the process, and building a flexible, scalable, and efficient scheduling mechanism. …”
    Get full text
    Get full text
    Get full text
    Thesis
  12. 12

    CPU Burst Processes Prioritization Using Priority Dynamic Quantum Time Algorithm: A Comparison with Varying Time Quantum and Round Robin Algorithms by Mohammed, Maysoon A., Mazlina, Abdul Majid, Balsam, A. Mustafa, Ghani, Rana Fareed

    Published 2015
    “…Round Robin scheduling algorithm is the most suitable choice for time shared system but not for soft real time systems due to a large turnaround time, large waiting time and high number of context switches. …”
    Get full text
    Get full text
    Get full text
    Article
  13. 13

    Impatient job scheduling under cloud computing by Mahdi, Nawfal A.

    Published 2012
    “…The challenge was how to consider the file sharing in on-the-fly way. This algorithm has been improved to take into account the input file sharing after analyzing the effect of this case on system performance. …”
    Get full text
    Get full text
    Thesis
  14. 14

    COMPARATIVE PERFORMANCE OF SOME HYBRID HEURISTICS SCHEDULING ALGORITHMS BASED ON SLTR AND DEADLINE FOR COMPUTATIONAL GRID by AHMED ABBA, HARUNA

    Published 2013
    “…Typical scheduling challenges tend to be NP complete problems where there is no optimal solution. Research on Grid scheduling focuses in solving three challenges: finding a good algorithm, automating the process, and developing a scalable, robust and efficient scheduling mechanism. …”
    Get full text
    Get full text
    Thesis
  15. 15

    Improved rsync algorithm to minimize communication cost using multi-agent systems for synchronization in multi-learning management systems by Mwinyi, Amir Kombo

    Published 2017
    “…Remote file synchronization (RFS) is based on updating the outdated version of a file that resides on one machine to be similar to the new version of the updated file in another machine at a minimum computation time (cost). The problem of rsync algorithm synchronization process is that rsync tries to check folders and files one by one, which takes long time to synchronize them. …”
    Get full text
    Get full text
    Get full text
    Thesis
  16. 16

    A Proposed Priority Dynamic Quantum Time Algorithm to Enhance Varying Time Quantum Round Robin Algorithm by Mohammed, Maysoon A., Mazlina, Abdul Majid, Balsam, A. Mustafa

    Published 2016
    “…One of the important units of the OS is Central Processing Unit (CPU), which is scheduling by many algorithms of scheduling. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  17. 17
  18. 18

    Traffic management algorithms for LEO satellite networks by Huyop @ Ayop, Fahrul Hakim

    Published 2016
    “…The performances of the proposed algorithms are then compared with the previously developed algorithms. …”
    Get full text
    Get full text
    Get full text
    Thesis
  19. 19

    Exact parallel plurality voting algorithm for totally ordered object space fault-tolerant systems by Karimi, Abbas, Zarafshan, Faraneh, Jantan, Adznan, Ramli, Abdul Rahman, Saripan, M. Iqbal, Syed Mohamed, Syed Abdul Rahman Al-Haddad

    Published 2012
    “…Since parallel algorithms normally have high processing speed and are especially appropriate for large scale systems, they are therefore used to achieve a new parallel plurality voting algorithm by using (n/log n) processors on EREW shared-memory PRAM. …”
    Get full text
    Get full text
    Get full text
    Article
  20. 20

    Backhaul load and performance optimality of partial joint processing schemes in LTE-A networks by Kousha, Mohammad

    Published 2014
    “…The proposed algorithm also leverages the location dependency of the joint processing. …”
    Get full text
    Get full text
    Thesis