scholarly journals Zone Based Job Scheduling In Mobile Grid Environment

2012 ◽  
Vol 3 (2) ◽  
pp. 43-55 ◽  
Author(s):  
S Stephen Vaithiya
2015 ◽  
Vol 69 ◽  
pp. 104-115
Author(s):  
Ahmad Abba Haruna ◽  
Low T. Jung ◽  
Nordin Zakaria ◽  
Jun Okitsu

Author(s):  
Achal Kaushik ◽  
Deo P. Vidyarthi

Computation in the mobile grid nodes under the cellular network environment requires an efficient management of wireless channels along with the user mobility. Due to random movement of the mobile devices, the load over the cells in terms of initiation of new computation or carryover computation (handoff) may vary dynamically. This may result in non-availability of free channels for Inter-task communication leading in the drop of carryover computation or to initiate the new computation in the current cell. The proposed work designs a model by instigating substantive cooperation among underutilized and the overloaded cells, considering importance to the frequency reuse and assigning priority to the on-going computation in the computational mobile grid. The model seeks cooperation by grouping the cells in different sizes to reduce the blocking and dropping of the computation. Blocking of the communication is very serious in computational mobile grid environment as the drop may result in the termination of the computation. The model aims at minimizing the Call Block Probability (CBP) and Call Drop Probability (CDP) in the mobile grid by making the clusters of different sizes. A simulation experiment to evaluate the performance of the proposed model reveals the effectiveness of this model.


2010 ◽  
Vol 2 (1) ◽  
pp. 34-50 ◽  
Author(s):  
Nikolaos Preve

Job scheduling in grid computing is a very important problem. To utilize grids efficiently, we need a good job scheduling algorithm to assign jobs to resources in grids. The main scope of this article is to propose a new Ant Colony Optimization (ACO) algorithm for balanced job scheduling in the Grid environment. To achieve the above goal, we will indicate a way to balance the entire system load while minimizing the makespan of a given set of jobs. Based on the experimental results, the proposed algorithm confidently demonstrates its practicability and competitiveness compared with other job scheduling algorithms.


Author(s):  
Annalisa Terracina ◽  
Stefano Beco ◽  
Tom Kirkham ◽  
Julian Gallop ◽  
Ian Johnson ◽  
...  
Keyword(s):  

2011 ◽  
Vol 27 (8) ◽  
pp. 991-998 ◽  
Author(s):  
Yun-Han Lee ◽  
Seiven Leu ◽  
Ruay-Shiung Chang

Sign in / Sign up

Export Citation Format

Share Document