Search Results - (( job application scheduling algorithm ) OR ( web application status algorithm ))
Search alternatives:
- application scheduling »
- application status »
- status algorithm »
- job application »
- web application »
-
1
-
2
Fuzzy C-Mean And Genetic Algorithms Based Scheduling For Independent Jobs In Computational Grid
Published 2006“…We get the better result when compared to the traditional algorithms for scheduling policies. Finally, the paper also discusses approach of the jobs classifications and the optimization engine in Grid scheduling. …”
Get full text
Get full text
Article -
3
A static jobs scheduling for independent jobs in Grid Environment by using Fuzzy C-Mean and Genetic algorithms
Published 2006Get full text
Get full text
Conference or Workshop Item -
4
-
5
A priority based job scheduling algorithm in cloud computing
Published 2012“…Job scheduling algorithms is one of the most challenging theoretical issues in the cloud computing area. …”
Get full text
Get full text
Conference or Workshop Item -
6
Job online scheduling within dynamic grid environment
Published 2008Get full text
Get full text
Article -
7
Ant colony algorithm for job scheduling in grid computing
Published 2010Get full text
Get full text
Get full text
Conference or Workshop Item -
8
DESIGN AND EVALUATION OF RESOURCE ALLOCATION AND JOB SCHEDULING ALGORITHMS ON COMPUTATIONAL GRIDS
Published 2012“…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
Thesis -
9
Experimental performance analysis of job scheduling algorithms on computational grid using real workload traces
Published 2017“…This paper presents comparative performance analysis of our proposed job scheduling algorithm with other well known job scheduling algorithms considering the quality of service parameters. …”
Get full text
Get full text
Article -
10
Ant colony optimization algorithm for dynamic scheduling of jobs in computational grid
Published 2012“…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
Monograph -
11
Scheduling jobs in computational grid using hybrid ACS and GA approach
Published 2014Get full text
Get full text
Get full text
Conference or Workshop Item -
12
Benchmark simulator with dynamic environment for job scheduling in grid computing
Published 2014Get full text
Get full text
Get full text
Conference or Workshop Item -
13
A new priority rule cloud scheduling technique that utilizes gaps to increase the efficiency of jobs distribution
Published 2023“…In this thesis, first a Priority-Based Fair Scheduling (PBFS) algorithm has been introduced to schedule jobs so that jobs get access to the required resources at optimal times. …”
Get full text
Get full text
Thesis -
14
Survey on job scheduling mechanisms in grid environment
Published 2015“…Grid systems provide geographically distributed resources for both computational intensive and data-intensive applications.These applications generate large data sets.However, the high latency imposed by the underlying technologies; upon which the grid system is built (such as the Internet and WWW), induced impediment in the effective access to such huge and widely distributed data.To minimize this impediment, jobs need to be scheduled across grid environments to achieve efficient data access.Scheduling multiple data requests submitted by grid users onto the grid environment is NP-hard.Thus, there is no best scheduling algorithm that cuts across all grids computing environments.Job scheduling is one of the key research area in grid computing.In the recent past many researchers have proposed different mechanisms to help scheduling of user jobs in grid systems.Some characteristic features of the grid components; such as machines types and nature of jobs at hand means that a choice needs to be made for an appropriate scheduling algorithm to march a given grid environment.The aim of scheduling is to achieve maximum possible system throughput and to match the application needs with the available computing resources.This paper is motivated by the need to explore the various job scheduling techniques alongside their area of implementation.The paper will systematically analyze the strengths and weaknesses of some selected approaches in the area of grid jobs scheduling.This helps researchers better understand the concept of scheduling, and can contribute in developing more efficient and practical scheduling algorithms.This will also benefit interested researchers to carry out further work in this dynamic research area.…”
Get full text
Get full text
Get full text
Article -
15
-
16
-
17
-
18
-
19
-
20