Abstract

This study proposes an intelligent reliable schedule with budget constraints in grid computing to reduce the makespan in grid environment. A good schedule improves the usability of the grid environment, but often faces the challenge of reliability and budget. In our paper we have addressed the reliability and budget constraints in grid environment by augmenting intelligence to the schedule by means of intelligent exploitation of random pushing and random job stealing. The objective of this paper is to schedule the tasks onto the reliable processor based on the user requirement and also provide the opportunity to schedule the tasks onto the reliable processor which don’t have high budgets. The experimental outcomes have supported the theoretical analysis by classifying the tasks and scheduling those to the various resources which are again divided as levels of criteria based on rank values enabling us to get a good and efficient schedule.

Keywords:

Budget, grid scheduling, random job stealing, random pushing, reliability,

References

1. Christopher, D., 2009. Reliability in grid computing system. Concurr. Comp-Pract. E., 21(8): 927-959.
   
2. Dogan, A. and F. Ozguner, 2005. Biobjective scheduling algorithms for execution time reliability trade-off in heterogeneous computing systems. Comput. J., 48(3): 300-314.
   CrossRef    
3. He, Y., Z. Shao, B. Xiao, Q. Zhuge and S. Edwin, 2003. Reliability driven task scheduling for heterogeneous systems. Proceeding of the International Conference on Parallel and Distributed Computing and Systems, pp: 465-470.
   
4. Kovvur, R.M.R., S. Ramachandram, K.K. Vijaya and A. Govardhana, 2011. A reliable distributed grid scheduler for independent tasks. Int. J. Comput. Sci. Issues, 8(2).
   
5. Ponnambalam, S.G., P. Aravindan and S.V. Rajesh, 2000. A Tabu search algorithm for job shop scheduling. Int. J. Adv. Manuf. Technol., 16: 765-771.
   CrossRef    
6. Rob, V.N., K. Thilo and E.B. Henri, 2001. Efficient Load Balancing for Wide-Area Divide-and-Conquer Applications. Proceeding of the 8th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP, 01), pp: 34-43.
   
7. Robert, D.B. and E.L. Charles, 1994. Scheduling Multithreaded Computations by work stealing. Proceeding of the 35th Annual Symposium on Foundations of Computer Science (FOCS). Santa Fe, New Mexico, pp: 356-368.
   
8. Srikumar, V. and B. Rajkumar, 2005. A Deadline and Budget Constrained Scheduling Algorithm for Science Applications on Data Grids. Springer-Verlag, Berlin Heidelberg, pp: 60-72.
   
9. Srinivasan, S. and N.K. Jha, 1999. Safety and reliability driven tasks allocation in distributed systems. IEEE T. Parall. Distr., 10(3): 238-251.
   CrossRef    
10. Stephie, I.R., S.R. Joshua and V. Vasudevan, 2013. A reliable schedule with budget constraints in grid computing. Int. J. Comp. sci., 64(3).
    
11. Tang, X., K. Li, R. Li and B. Veeravalli, 2010. Reliability-aware scheduling strategy for heterogeneous distributed computing systems. J. Parallel Distr. Com., 70(9): 941-952.
    CrossRef    
12. Wei, L., Q. Xiao and B. Kiranmai, 2007. Reliability-driven scheduling of periodic tasks in heterogeneous real-time systems. Proceeding of the 21st International Conference on Advanced Information Networking and Applications Workshops, 1: 778-783.
    
13. Xiao, Q. and J. Hong, 2005. A dynamic and reliability-driven scheduling algorithm for parallel real-time jobs on heterogeneous clusters. J. Parallel Distr. Com., 65(8): 885-900.
    CrossRef    
14. Xiao, Q., J. Hong., X. Changsheng and H. Zongfen, 2000. Reliability-driven scheduling for real-time tasks with precedence constraints in heterogeneous systems. Proceeding of the 12th International Conference Parallel and Distributed Computing and Systems.
    

Competing interests

The authors have no competing interests.

Open Access Policy

This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.

Copyright

The authors have no competing interests.