Self-adjustment of resource allocation for grid applications

Computer Networks

Volumn 52, Issue 9, 2008, Pages 1762-1781

  Batista, Daniel M ^a   da Fonseca, Nelson L S ^a   Miyazawa, Flavio K ^a   Granelli, Fabrizio ^b  

^a UNIVERSITY OF CAMPINAS   (Brazil)

^b UNIVERSITY OF TRENTO   (Italy)

Author keywords

Grid networks; Reactive scheduling; Task migration; Task scheduling

Indexed keywords

BANDWIDTH; COMPUTER SIMULATION; CONTROL SYSTEMS; DISTRIBUTED COMPUTER SYSTEMS; PROBLEM SOLVING; SCHEDULING;

GRID NETWORKS; REACTIVE SCHEDULING; TASK MIGRATION; TASK SCHEDULING;

RESOURCE ALLOCATION;

EID: 43449126478     PISSN: 13891286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comnet.2008.03.002     Document Type: Article

References (37)

1. I. Foster, What is the grid? A three point checklist, GRIDToday 1 (6) (2002). (accessed at 20.10.2006).
2. Casanova H. Distributed computing research issues in grid computing. SIGACT News 33 3 (2002) 50-70
3. Kwok Y.-K., and Ahmad I. Static scheduling algorithms for allocating directed task graphs to multiprocessors. ACM Comput. Surv. 31 4 (1999) 406-471
4. E. Huedo, R.S. Montero, I.M. Llorente, Experiences on adaptive grid scheduling of parameter sweep applications, in: Proceedings of the 12th Euromicro Conference on Parallel, Distributed and Network-Based Processing, 2004, pp. 28-33.
5. Allen G., Angulo D., Foster I., Lanfermann G., Liu C., Radke T., Seidel E., and Shalf J. The cactus worm: experiments with dynamic resource discovery and allocation in a grid environment. Int. J. High Performance Comput. Appl. 15 4 (2001) 345-358
6. E. Huedo, R.S. Montero, I.M. Llrorent, An Experimental Framework for Executing Applications in Dynamic Grid Environments, Tech. Rep. 2002-43, NASA Langley Research Center, 2002.
7. Berman F., Wolski R., Casanova H., Cirne W.W., Dail H.H., Faerman M., Figueira S., Hayes J., Obertelli G., Schopf J., Shao G., Smallen S., Spring N., Su A., and Zagorodnov D. Adaptive computing on the grid using AppLeS. IEEE Trans. Parallel Distribut. Syst. 14 (2003) 369-382
8. S.S. Vadhiyar, J.J. Dongarra, A performance oriented migration framework for the grid, in: Proceedings of 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid(CCGRID'03), 2003, pp. 130-137.
9. Montero R.S., Huedo E., and Llorente I.M. Grid resource selection for opportunistic job migration. Proceedings of the 9th International Euro-Par Conference (2003), Springer, Berlin, Heidelberg 366-373
10. Kurowski K., Ludwiczak B., Nabrzyski J., Oleksiak A., and Pukacki J. Dynamic grid scheduling with job migration and rescheduling in the GridLab resource management system. Sci. Program. 12 (2004) 263-273
11. Sakellariou R., and Zhao H. A low-cost rescheduling policy for efficient mapping of workflows on grid systems. Sci. Program. 12 (2004) 253-262
12. Schopf J.M. Ten actions when grid scheduling. Grid Resource Management: State of the Art and Future Trends. first ed. (2003), Springer 15-23
13. Renambot L., van der Schaaf T., Bal H.E., Germans D., and Spoelder H.J.W. Griz: experience with remote visualization over an optical grid. Future Generation Comput. Syst. 19 6 (2003) 871-882
14. D.M. Batista, N.L.S. da Fonseca, F. Granelli, D. Kliazovich, Self-adjusting grid networks, in: Proceedings of the IEEE International Conference on Communications, 2007 - ICC'07, 2007, pp. 344-349.
15. Batista D.M., da Fonseca N.L.S., and Miyazawa F.K. A set of schedulers for grid networks. SAC'07: Proceedings of the 2007 ACM Symposium on Applied Computing (2007), ACM Press, New York, NY, USA 209-213
16. M. Cannataro, C. Mastroianni, D. Talia, P. Trunfio, Evaluating and enhancing the use of the GridFTP protocol for efficient data transfer on the grid, in: Proceedings of the 10th European PVM/MPI User's Group Meeting, Lecture Notes in Computer Science, vol. 2840, 2003, pp. 619-628.
17. F. Montesino-Pouzols, Comparative analysis of active bandwidth estimation tools, in: Proceedings of the 5th Passive and Active Measurement Workshop (PAM 2004), Lecture Notes in Computer Science, vol. 3015, 2004, pp. 175-184.
18. Lowekamp B.B. Combining active and passive network measurements to build scalable monitoring systems on the grid. SIGMETRICS Perform. Evaluat. Rev. 30 4 (2003) 19-26
19. Schopf J.M., and Yang L. Using predicted variance for conservative scheduling on shared resources. Grid Resource Management: State of the Art and Future Trends. first ed. (2003), Springer 215-236
20. X. Sun, M. Wu, GHS: a performance system of grid computing, in: Proceedings of 19th IEEE International Parallel and Distributed Processing Symposium, 2005, p. 228a-233.
21. Wolski R., Spring N.T., and Hayes J. The network weather service: a distributed resource performance forecasting service for metacomputing. Future Generation Comput. Syst. 15 5-6 (1999) 757-768
22. H. Zhao, R. Sakellariou, Scheduling multiple DAGs onto heterogeneous systems, in: Proceedings of the 20h International Parallel and Distributed Processing Symposium (IPDPS 2006), 2006.
23. D. Ma, W. Zhang, A static task scheduling algorithm in grid computing, in: Proceedings of the Second International Workshop on Grid and Cooperative Computing (GCC 2003) - Part II, Lecture Notes in Computer Science, vol. 3033, 2004, pp. 153-156.
24. G.B. Dantzig, Maximization of linear function of variables subject to linear inequalities, in: T.C. Koopmans (Ed.), Activity Analysis of Production and Allocation, 1951, pp. 339-347.
25. Todd M.J. The many facets of linear programming. Math. Program. 91 3 (2004) 417-436
26. Bixby R.E. Implementing the simplex method: the initial basis. ORSA J. Comput. 4 (1992) 267-284
27. Kuhn H.W., and Quandt R.E. An experimental study of the simplex method. In: Metropolis E.A. (Ed). Proceedings of the 15th Symposium on Applied Mathematics (1963), Amer. Math. Soc. 107-124
28. Karmarkar N.K. A new polynomial-time algorithm for linear programming. Combinatorica 4 4 (1984) 373-395
29. Mitchell J.E., Pardalos P.M., and Resende M.G.C. Interior point methods for combinatorial optimization. In: Du D.-Z., and Pardalos P.M. (Eds). Handbook of Combinatorial Optimization (1998), Kluwer Academic Publishers 189-297
30. Karmarkar N.K., and Ramakrishnan K.G. Computational results of an interior point algorithm for large scale linear programming. Math. Program. 52 (1991) 555-586
31. M. Iverson, F. Ozguner, G. Follen, Parallelizing existing applications in a distributed heterogeneous environment, in: Proceedings of Heterogeneous Computing Workshop, 1995, pp. 93-100.
32. Montage. (accessed at 5.11.2007).
33. M. Doar, I.M. Leslie, How bad is naive multicast routing? in: Proceedings of IEEE INFOCOM'93, 1993, pp. 82-89.
34. Sinnen O., and Sousa L.A. Communication contention in task scheduling. IEEE Trans. Parallel Distribut. Syst. 16 6 (2005) 503-515
35. J. Blythe, S. Jain, E. Deelman, Y. Gil, K. Vahi, A. Mandal, K. Kennedy, Task scheduling strategies for workflow-based applications in grids, in: Proceedings of IEEE International Symposium on Cluster Computing and the Grid (CCGRID'05), vol. 2, 2005, pp. 759-767.
36. He X., Sun X., and von Laszewski G. QoS guided min-min heuristic for grid task scheduling. J. Comput. Sci. Technol. 18 4 (2003) 442-451
37. N. Fujimoto, K. Hagihara, Near-optimal dynamic task scheduling of precedence constrained coarse-grained tasks onto a computational grid, in: Proceedings of the Second International Symposium on Parallel and Distributed Computing, 2003, pp. 80-87.