Experimental Study of Remote Job Submission and Execution on LRM through Grid Computing Mechanisms

Remote job submission and execution is fundamental requirement of distributed computing done using Cluster computing. However, Cluster computing limits usage within a single organization. Grid computing environment can allow use of resources for remote job execution that are available in other organizations. This paper discusses concepts of batch-job execution using LRM and using Grid. The paper discusses two ways of preparing test Grid computing environment that we use for experimental testing of concepts. This paper presents experimental testing of remote job submission and execution mechanisms through LRM specific way and Grid computing ways. Moreover, the paper also discusses various problems faced while working with Grid computing environment and discusses their trouble-shootings. The understanding and experimental testing presented in this paper would become very useful to researchers who are new to the field of job management in Grid.Comment: Fourth International Conference on Advanced Computing & Communication Technologies (ACCT), 201

Simulated Annealing for Location Area Planning in Cellular networks

LA planning in cellular network is useful for minimizing location management cost in GSM network. In fact, size of LA can be optimized to create a balance between the LA update rate and expected paging rate within LA. To get optimal result for LA planning in cellular network simulated annealing algorithm is used. Simulated annealing give optimal results in acceptable run-time.Comment: 7 Pages, JGraph-Hoc Journa

Approximate Analytical Solution of Advection-Dispersion Equation By Means of OHAM.

This work deals with the analytical solution of advection dispersion equation arising in solute transport along unsteady groundwater flow in finite aquifer. A time dependent input source concentration is considered at the origin of the aquifer and it is assumed that the concentration gradient is zero at the other end of the aquifer. The optimal homotopy analysis method (OHAM) is used to obtain numerical and graphical representation

Scheduling of Dependent Tasks Application using Random Search Technique

Since beginning of Grid computing, scheduling of dependent tasks application has attracted attention of researchers due to NP-Complete nature of the problem. In Grid environment, scheduling is deciding about assignment of tasks to available resources. Scheduling in Grid is challenging when the tasks have dependencies and resources are heterogeneous. The main objective in scheduling of dependent tasks is minimizing make-span. Due to NP-complete nature of scheduling problem, exact solutions cannot generate schedule efficiently. Therefore, researchers apply heuristic or random search techniques to get optimal or near to optimal solution of such problems. In this paper, we show how Genetic Algorithm can be used to solve dependent task scheduling problem. We describe how initial population can be generated using random assignment and height based approaches. We also present design of crossover and mutation operators to enable scheduling of dependent tasks application without violating dependency constraints. For implementation of GA based scheduling, we explore and analyze SimGrid and GridSim simulation toolkits. From results, we found that SimGrid is suitable, as it has support of SimDag API for DAG applications. We found that GA based approach can generate schedule for dependent tasks application in reasonable time while trying to minimize make-span

Edge product cordial labeling of switching operation on some graphs

Here we discuss and prove that the graphs attained by switching of any vertex with degree two which is adjacent to a vertex with degree two in triangular snake Tm, switching of any vertex with degree one in path Pm for m ≥ 3 and m odd, Switching of vertex with degree two in Pm except vertices u2 or um−1 with m > 4 and switching of any vertex in cycle Cm are an edge product cordial graphs.Publisher's Versio

Scheduling in Grid Computing Environment

Scheduling in Grid computing has been active area of research since its beginning. However, beginners find very difficult to understand related concepts due to a large learning curve of Grid computing. Thus, there is a need of concise understanding of scheduling in Grid computing area. This paper strives to present concise understanding of scheduling and related understanding of Grid computing system. The paper describes overall picture of Grid computing and discusses important sub-systems that enable Grid computing possible. Moreover, the paper also discusses concepts of resource scheduling and application scheduling and also presents classification of scheduling algorithms. Furthermore, the paper also presents methodology used for evaluating scheduling algorithms including both real system and simulation based approaches. The presented work on scheduling in Grid containing concise understandings of scheduling system, scheduling algorithm, and scheduling methodology would be very useful to users and researchersComment: Fourth International Conference on Advanced Computing & Communication Technologies (ACCT), 201

Analytic Analysis for Oil Recovery During Cocurrent Imbibition in Inclined Homogeneous Porous Medium

This paper focuses on the analysis of cocurrent imbibition phenomenon which occurs during secondary oil recovery process.In cocurrent imbibition, a strongly wetting phase(water) displaces a non-wetting phase(oil) spontaneously under the influence of capillary forces such that the oil moves in the same direction to the water. We use an optimal homotopy analysis method to derive an approximate analytical expression for saturation of water when the viscosity of the non-wetting phase is non-negligible