Search Results - (( java implementation path algorithm ) OR ( grid computing bees algorithm ))

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

    Optimization grid scheduling with priority base and bees algorithm by Ahmed, Mohammed Shihab

    Published 2014
    “…The main aim of this current research to propose an optimization of the initial scheduler for grid computing using the bees algorithm. Modern algorithms informed this research. …”
    Get full text
    Get full text
    Get full text
    Thesis
  2. 2

    Bee foraging behaviour techniques for grid scheduling problem by Alyaseri, Sana, Ku-Mahamud, Ku Ruhana

    Published 2013
    “…Grid computing is the infrastructure that involves a large number of resources like computers, networks and databases which are owned by many organizations.These resources are collected together to make a huge computing power.Job scheduling problem is one of the key issues in grid computing and failing to look into grid scheduling results in uncompleted view of the grid computing.Achieving optimized performance of grid system, and matching application requirements with available computing resources, are the objectives of grid job scheduling.Bee colony approaches are more adaptive to grid scheduling due to high heterogeneous and dynamic nature of resources and applications in grid.These algorithms have shown encouraging results in terms of time and cost.This paper presents some resent research activities inspired by bee foraging behavior for grid job scheduling especially ABC and BCO approaches.Different original studies related to this area are briefly described along with their comparisons against them and results.The review summary of their derived algorithms and research efforts is done.…”
    Get full text
    Get full text
    Get full text
    Article
  3. 3

    Multi objective bee colony optimization framework for grid job scheduling by Alyaseri, Sana, Ku-Mahamud, Ku Ruhana

    Published 2013
    “…Grid computing is the infrastructure that involves a large number of resources like computers, networks and databases which are owned by many organizations.Job scheduling problem is one of the key issues because of high heterogeneous and dynamic nature of resources and applications in the grid computing environment.Bee colony approach has been used to solve this problem because it can be easily adapted to the grid scheduling environment.The bee algorithms have shown encouraging results in terms of time and co st.In this paper a framework for multi objective bee colony optimization is proposed to schedule batch jobs to available resources where the number of jobs is greater than the number of resources.Pareto analysis and k-means analysis are integrated in the bee colony optimization algorithm to facilitate the scheduling of jobs to resources.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  4. 4

    Performance evaluation of load balancing algorithm for virtual machine in data centre in cloud computing by Parmesivan, Yuganes, Hasan, Sazlinah, Muhammed, Abdullah

    Published 2018
    “…Cloud computing has become biggest buzz in the computer era these days.It runs entire operating systems on the cloud and doeverything on cloud to store data off-site.Cloud computing is primarily based on grid computing, but it’s a new computational model.Cloud computing has emerged into a new opportunity to further enhance way of hosting data centre and provide services.The primary substance of cloud computing is to deal the computing power,storage,different sort of stages and services which assigned tothe external users on demand through the internet.Task scheduling in cloud computing is vital role optimisation and effective dynamic resource allocation for load balancing.In cloud, the issue focused is under utilisation and over utilisation of the resources to distribute workload of multiple network links for example,when cloud clients try to access and send request tothe same cloud server while the other cloud server remain idle at that moment, leads to the unbalanced of workload on cloud data centers.Thus, load balancing is to assign tasks to the individual cloud data centers of the shared system so that no single cloud data centers is overloaded or under loaded.A Hybrid approach of Honey Bee (HB) and Particle Swarm Optimisation (PSO) load balancing algorithm is combined in order to get effective response time.The proposed hybrid algorithm has been experimented by using CloudSim simulator.The result shows that the hybrid load balancing algorithm improves the cloud system performance by reducing the response time compared to the Honey Bee (HB) and Particle Swarm Optimisation (PSO) load balancing algorithm.…”
    Get full text
    Get full text
    Get full text
    Article
  5. 5

    Heavy Transportation Shortest Route using Dijkstra’s algorithm (HETRO) / Nurul Aqilah Ahmad Nezer by Ahmad Nezer, Nurul Aqilah

    Published 2017
    “…The development tools used in developing this project is NetBeans by using Java for the implementation of the coding. The methodology that used for developing this system is the Dijkstra’s algorithm. …”
    Get full text
    Get full text
    Thesis
  6. 6

    Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization by Mohammad Ata, Karimeh Ibrahim

    Published 2019
    “…BST inserts the nodes in the way that the Dijkstra’s can find the empty parking in fastest way. Dijkstra’s algorithm initials the paths to finding the shortest path while ACO optimizes the paths. …”
    Get full text
    Get full text
    Thesis
  7. 7

    Path planning for unmanned aerial vehicle (UAV) using rotated accelerated method in static outdoor environment by Shaliza Hayati A. Wahab, Nordin Saad, Azali Saudi, Ali Chekima

    Published 2021
    “…In this study, a fast iterative method known as Rotated Successive Over-Relaxation (RSOR) is introduced. The algorithm is implemented in a self-developed 2D Java tool, UAV Planner. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  8. 8

    Modified anfis architecture with less computational complexities for classification problems by Talpur, Noureen

    Published 2018
    “…The results show that the proposed modified ANFIS architecture with gaussian membership function and Artificial Bee Colony (ABC) optimization algorithm, on average has achieved classification accuracy of 99.5% with 83% less computational complexity.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  9. 9

    Smart appointment organizer for mobile application / Mohd Syafiq Adam by Adam, Mohd Syafiq

    Published 2009
    “…The main component of this prototype is the use of Dijkstra algorithm to compute the shortest path from source of appointment to the 6 points of destinations within UiTM Shah Alam. …”
    Get full text
    Get full text
    Thesis
  10. 10
  11. 11
  12. 12
  13. 13
  14. 14
  15. 15

    Energy management system for optimal operation of microgrid consisting of PV, fuel cell and battery / Shivashankar Sukumar by Shivashankar , Sukumar

    Published 2017
    “…The BESS sizing problem is solved using grey wolf optimizer (GWO), particle swarm optimization (PSO), artificial bee colony (ABC), gravitational search algorithm (GSA), and genetic algorithm (GA). …”
    Get full text
    Get full text
    Get full text
    Thesis
  16. 16
  17. 17

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

    Published 2019
    “…Therefore, this study proposed a cost-cognizant TCP approach for object-oriented software that uses path-based integration testing to identify the possible execution path extracted from the Java System Dependence Graph (JSDG) model of the source code using forward slicing technique. …”
    Get full text
    Get full text
    Thesis