waiting time variance
Recently Published Documents


TOTAL DOCUMENTS

14
(FIVE YEARS 0)

H-INDEX

7
(FIVE YEARS 0)

The efficiency of parallel processors is achieved for the purpose of quick computing is mainly depending on the scheduling of activity. The most important factor for scheduling of activities are depend on the waiting time which is directly influence the computation time of overall activity. Minimizing the Variance of Waiting Time otherwise known as Waiting Time Variance (WTV) is one of the metrics of Quality of Services (QoS) which enhance the efficiency of activity scheduling. Allocate the activity from a set of activity pool and schedule them for each identical parallel processor for execution in a large scale by minimizing WTV is the main focusing area of this paper. In case of large scale computing activities are complex in nature. A prior knowledge of each activity must be known before the preparation of activity scheduling for efficient and rapid computing. A snake walks style of activity distribution among the parallel processor is presented in this paper for minimization problem. The minimization of WTV is measured with the help of three heuristic intend methods named as RSS, VS and BS. The results of the experiment are compared with current conspires and demonstrate the new snake style conspire is presenting the best practices for proven conspires and challenges in a wide range of activity. The algorithm's predictable findings appear as illustrated with graph.









Author(s):  
Shajulin Benedict ◽  
◽  
Rejitha R. S ◽  
V. Vasudevan ◽  

Grids promote user collaboration through flexible, coordinated sharing of distributed resources to solve a single large problem. Grid scheduling, similar to resource discovery and monitoring, is inherently more complex in Grid environments. We propose two approaches for solving Grid scheduling problems with the simultaneous objectives of maximizing the number of workflow executions and minimizing the waiting time variance among tasks of each workflow. One is the multiple objective Niched Pareto Genetic Algorithm (NPGA) that involves evolution during a comprehensive search and work on multiple solutions. After the Genetic search, we strengthen the search using Simulated Annealing as a local search meta-heuristic. For comparison, we evaluate other scheduling, such as, Tabu Search (TS), Simulated annealing (SA), and Discrete Particle Swarm Optimization (Discrete PSO). Results show that our proposed evolutionary Hybrid scheduling involving NPGA with an SA search, works better than other scheduling in considering workflow execution time within a deadline and waiting time variance in tasks with minimal iterations.



2007 ◽  
Vol 34 (10) ◽  
pp. 3069-3083 ◽  
Author(s):  
Nong Ye ◽  
Xueping Li ◽  
Toni Farley ◽  
Xiaoyun Xu


2007 ◽  
Vol 52 (1) ◽  
pp. 41-56 ◽  
Author(s):  
Xueping Li ◽  
Nong Ye ◽  
Tieming Liu ◽  
Yang Sun


2007 ◽  
Vol 1 (1) ◽  
pp. 56 ◽  
Author(s):  
Xueping Li ◽  
Nong Ye ◽  
Xiaoyun Xu ◽  
Rapinder Sawhey


Sign in / Sign up

Export Citation Format

Share Document