A new Grid scheduler with failure recovery and rescheduling mechanisms: Discussion and analysis

Journal of Grid Computing

Volumn 10, Issue 2, 2012, Pages 211-235

  Saleh, Ahmed Ibrahim ^a   Sarhan, Amany M ^b   Hamed, Amr M ^a  

^a University of Mansoura   (Egypt)

^b Tanta University   (Egypt)

Author keywords

Adaptive grid scheduling; Failure recovery; Grid; Grid resource monitoring; Mobile agents

Indexed keywords

ACYCLIC GRAPHS; ADAPTIVE GRIDS; COMPUTATIONAL GRIDS; DYNAMIC GRID; DYNAMIC SOLUTIONS; FAILURE RECOVERY; GRID; GRID RESOURCE; GRID SCHEDULERS; HETEROGENEOUS RESOURCES; MONITORING PROCESS; PARALLEL APPLICATION; RESOURCE DISCOVERY; RUNTIMES; STATIC AND DYNAMIC; STATIC AND DYNAMIC BEHAVIORS; STATIC SCHEDULING; SUBMISSION TIME; UNIQUE FEATURES;

MOBILE AGENTS; SCHEDULING; SUPERCOMPUTERS;

GRID COMPUTING;

EID: 84860884873     PISSN: 15707873     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10723-011-9200-5     Document Type: Article

References (19)

1. Yu, Z., Shi, W.: An adaptive rescheduling strategy for grid workflow applications. In: Parallel and Distributed Processing Symposium. IPDPS 2007. IEEE International, pp. 1-18 (2007)
2. Bharadwaj, V., Ghose, D., Mani, V., Robertazzi, T.: Scheduling Divisible Loads in Parallel and Distributed Systems. IEEE Comput. Soc. Press (1996)
3. Lang, D., Oshima, M.: Seven good reasons for mobile agents. Commun. ACM 42(8), 88-89 (1999)
4. Aversa, R., Di Martino, B., Mazzocca, N., Venticinque, S.: MAGDA: A mobile agent based grid architecture. J. Grid Computing 4(4), 395-412 (2006)
5. Negri, A., Poggi, A., et al.: Dynamic grid tasks composition and distribution through agents. Concurr. Comput. Pract. Exp. 18(8), 875-885 (2006)
6. Choi, S., Baik, M. et al.: Mobile agent based adaptive scheduling mechanism in peer-to-peer grid computing. In: Proc. of ICCSA 2005, pp. 936-947. Singapore (2005)
7. Kontothanassis, L., Goddeau, D.: Profile driven scheduling for a heterogeneous server cluster. In: Proceedings of the 34th International Conference on Parallel Processing Workshops, pp. 336-345 (2005)
8. Kwok, Y., Ahmad, I.: Benchmarking and comparison of the task graph scheduling algorithms. J. Parallel Distrib. Comput. 59(3), 381-422 (1999)
9. Braun, T., Siegel, H., Beck, N.: A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems. J. Parallel Distrib. Comput. 61, 810-837 (2001)
10. Zhang, Y., Koelbel, C., Kennedy, K.: Relative performance of scheduling algorithms in Grid Environments. In: Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid, pp. 521-528 (2007)
11. Topcuoglu, H., Hariri, S.: Performance effective and low-complexity task scheduling for heterogeneous computing. IEEE Trans. Parallel Distrib. Syst. 2(13), 260-274 (2002)
12. Baskiyar, S., Dickinson, C.: Scheduling directed acyclic task graphs on a bounded set of heterogeneous processors using task duplication. J. Parallel Distrib. Comput. 65(8), 911-921 (2005)
13. Zhao, H., Sakellariou, R.: An experimental investigation into the rank function of the heterogeneous earliest finish time scheduling algorithm. In: Proc. of Euro-Par 2003, LNCS 2790, pp. 189-194. Springer, Klagenfurt, Austria (2003)
14. Wieczorek, M., Prodan, R., Fahringer, T.: Scheduling of scientific workflows in the ASKALON Grid environment. ACM SIGMOD Record 34(3), 56-62 (2005)
15. Huang, C., Zheng, Y., Chen, D.: A scheduling approach with respect to overlap of computing and data transferring in grid computing. In: Proc. GCC (2), pp. 105-112 (2003)
16. Boutammine, S., Millot, D., Parrot, C.: An adaptive schedulingmethod for grid computing. In: Nagel, W.E., Walter, W.V., Lehner, W. (eds.) Euro-Par, pp. 188-197 (2006)
17. Silberschatz, A., Galvin, P., Gagne, G.: Process Scheduling. Operating System Concepts, 8th edn., p. 194. Wiley, Asia. ISBN 978-0-47023399-3. 5.3.4 Round Robin Scheduling (2010)
18. Mandal, A, Kennedy, K., Koelbel, C., Marin, G., Johnsson, L.: Scheduling strategies for mapping application workflows onto the Grid. In: 14-th IEEE Symposium on High Performance Distributed Computing (HPDC14), pp. 125-134 (2005)
19. Armstrong, R., Hensgen, D., Kidd, T.: The relative performance of various mapping algorithms is independent of sizable variances in run-time predictions. In: 7th IEEE Heterogeneous Computing Workshop, pp. 79-87 (1998)