Stochastic simulator for priority based task in grid environment
- 8 Downloads
Among the different types of distributed computing, grid computing is that type of computing which includes huge collection of resources and applications, which may be at the same or different locations owned by same or different governments. Availability of right resource at right time with suitable task is managed by scheduling process. Task scheduling goal in grid computing is to attain better throughput and to match the requirement of application with the available set of resources. With the increase in the size of task and grid, complexity of scheduling problem increases and it becomes a NP-complete problem to be solved. This has given birth to a new research issue. In this paper authors have given a solution to the scheduling problem by proposing a probability based scheduling approach. To represent the scheduling scenario, authors have used the concept of directed acyclic graph. Proposed approach not only handles the tasks on the basis of their priority but also handle them in parallel. Gridsim simulator has been used to compare and test the proposed approach with other existing approaches found in the literature. Parameters like makespan, cost, through put and percentage of load balancing has been considered to check the performance of probabilistic scheduling approach.
KeywordsGrid computing Priority based task Probabilistic scheduling Gridsim
- 2.Foster I, Kesselman C (1999) The grid: blueprint for a new computing infrastructure. Morgan Kaufmann Publishers Inc., San Francisco [ISBN: 1-55860-475-8]Google Scholar
- 4.Gary MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. W.H. Freeman and Co., San Francisco [ISBN: 0716710447]Google Scholar
- 11.Iverson MA, Ozuner F, Follen GJ (1995) Parallelizing existing applications in a distributed heterogeneous environment. In: Proceedings of Heterogeneous Computing Workshop. p 93–100Google Scholar