Search Results - (( job application ((bee algorithm) OR (new algorithm)) ) OR ( its application server algorithm ))*

Comparison Between the Bees Algorithm and Genetic Algorithm Model in Manpower Allocation on Cell Loading Problem by AlMahasneh, Hossam Sayel

Get full text
Get full text
Get full text
Get full text

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

“…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

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

“…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

Load Balancing Using The Consensus Control Algorithm For A Network Server System by Loon, Alan Tan Chin

Get full text
Get full text

New accountant job market reform by computer algorithm: an experimental study by Hirose, Yoshitaka

Get full text
Get full text
Get full text

DESIGN AND EVALUATION OF RESOURCE ALLOCATION AND JOB SCHEDULING ALGORITHMS ON COMPUTATIONAL GRIDS by MEHMOOD SHAH, SYED NASIR

“…Thus, overall aim of this research is to introduce new grid scheduling algorithms for resource allocation as well as for job scheduling for enabling a highly efficient and effective utilization of the resources in executing various applications. …”
Get full text
Get full text

Adaptive intelligence job online scheduling within dynamic grid environment based on gridsim by Lorpunmanee, Siriluck, Md. Sap, Mohd. Noor, Abdullah, Abdul Hanan

Get full text
Get full text

Efficient DNS based Load Balancing for Bursty Web Application Traffic by Chin, Mei Lu, Chong, Eng Tan, Mohamad Imran, Bin Bandan

“…This research proposes a new efficient load balancing algorithm which applies to the local Domain Name Service (DNS) server for web based applications and services to ease the sudden increase in demand for the services. …”
Get full text
Get full text
Get full text

Ant colony optimization algorithm for dynamic scheduling of jobs in computational grid by Ku-Mahamud, Ku Ruhana, Ramli, Razamin, Yusof, Yuhanis, Mohamed Din, Aniza, Mahmuddin, Massudi

“…Job scheduling problem is classified as an NP-hard problem.Such a problem can be solved only by using approximate algorithms such as heuristic and meta-heuristic algorithms.Among different optimization algorithms for job scheduling, ant colony system algorithm is a popular meta-heuristic algorithm which has the ability to solve different types of NP-hard problems.However, ant colony system algorithm has a deficiency in its heuristic function which affects the algorithm behavior in terms of finding the shortest connection between edges.This research focuses on a new heuristic function where information about recent ants’ discoveries has been considered.The new heuristic function has been integrated into the classical ant colony system algorithm.Furthermore, the enhanced algorithm has been implemented to solve the travelling salesman problem as well as in scheduling of jobs in computational grid.A simulator with dynamic environment feature to mimic real life application has been development to validate the proposed enhanced ant colony system algorithm. …”
Get full text
Get full text

Managing Heterogeneous Database Replication Using Persistence Layer Synchronous Replication (PLSR) by Noraziah, Ahmad, Abdalla, Ahmed N., Beg, Abul Hashem

Get full text
Get full text
Get full text

Intelligent agent for e-commerce using genetic algorithm / Kok Sun Sun by Kok , Sun Sun

“…In addition, the system is developed using the developing tools that are essential in web applications, namely. web server, database server, system server and web programming tools such as ASP and Visual Basic. …”
Get full text
Get full text

A priority based job scheduling algorithm in cloud computing by Shamsollah, Ghanbari, Othman, Mohamed

“…Some intensive researches have been done in the area of job scheduling of cloud computing. In this paper we have proposed a new priority based job scheduling algorithm (PJSC) in cloud computing. …”
Get full text
Get full text

Rangka kerja keselamatan transaksi bagi pelanggan pelayan berasaskan perdagangan elektronik by Abdullah, Abdul Hanan

Get full text
Get full text

New heuristic function in ant colony system for job scheduling in grid computing by Ku-Mahamud, Ku Ruhana, Alobaedy, Mustafa Muwafak

Get full text
Get full text

Benchmark simulator with dynamic environment for job scheduling in grid computing by Ku-Mahamud, Ku Ruhana

Get full text
Get full text
Get full text

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

Get full text
Get full text
Get full text

A new priority rule cloud scheduling technique that utilizes gaps to increase the efficiency of jobs distribution by Saydul Akbar, Murad

“…To address this issue, the main objective of this research is to improve the existing PR cloud schedulers by developing a new dynamic scheduling algorithm by manipulating the gaps in the cloud job schedule. …”
Get full text
Get full text

Job recruiting system using sorting Algorithm / Adi Asyraf Ayob by Ayob, Adi Asyraf

“…The sorting algorithm will assist the recruiters in selecting best job candidate by assigning score to each applicants and sort the applicant list by the finest score value. …”
Get full text
Get full text

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

“…This technique also introduces a multi thread based persistence layer, which supports early binding and parallel connection to the servers. All the replication servers established its connection through interfaces. …”
Get full text
Get full text

Ant colony optimization algorithm for load balancing in grid computing by Ku-Mahamud, Ku Ruhana, Mohamed Din, Aniza

Get full text
Get full text
Get full text