A Multiobjective Evolutionary Approach for Multisite Mapping on Grids
Grid systems, constituted by multisite and multi–owner time–shared resources, make a great amount of locally unemployed computational power accessible to users. To profitably exploit this power for processing computationally intensive grid applications, an efficient multisite mapping must be conceived. The mapping of cooperating and communicating application subtasks, already known as NP–complete for parallel systems, results even harder in grid computing because the availability and workload of grid resources change dynamically, so evolutionary techniques can be adopted to find near–optimal solutions. In this paper a mapping tool based on a multiobjective Differential Evolution algorithm is presented. The aim is to reduce the execution time of the application by selecting among all the potential solutions the one which minimizes the degree of use of the grid resources and, at the same time, complies with Quality of Service requirements. The proposed mapper is assessed on some artificial problems differing in application sizes and workload constraints.
KeywordsGrid computing mapping Differential Evolution
Unable to display preview. Download preview PDF.
- 1.Foster, I., Kesselmann, C.: The Grid: Blueprint for a New Computing Infrastructure. Morgan Kaufmann, San Francisco (1999)Google Scholar
- 3.Snir, M., Otto, S., Huss-Lederman, S., Walker, D., Dongarra, J.: MPI: The Complete Reference. The MPI Core, vol. 1. The MIT Press, Cambridge (1998)Google Scholar
- 4.Khokhar, A., Prasanna, V.K., Shaaban, M., Wang, C.L.: Heterogeneous computing: Challenges and opportunities. IEEE Computer 26(6), 18–27 (1993)Google Scholar
- 5.Siegel, H.J., Antonio, J.K., Metzger, R.C., Tan, M., Li, Y.A.: Heterogeneous computing. In: Zomaya, A.Y. (ed.) Parallel and Distributed Computing Handbook, pp. 725–761. McGraw–Hill, New York (1996)Google Scholar
- 9.Braun, T.D., Siegel, H.J., N.B.,, Bölöni, L.L., Maheswaran, M., Reuther, A.I., Robertson, J.P., Theys, M.D., Yao, B.: A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems. Journal of Parallel and Distributed Computing 61, 810–837 (2001)CrossRefGoogle Scholar
- 10.Kim, S., Weissman, J.B.: A genetic algorithm based approach for scheduling decomposable data grid applications. In: International Conference on Parallel Processing (ICPP 2004), Montreal, Quebec, Canada, pp. 406–413 (2004)Google Scholar
- 11.Song, S., Kwok, Y.K., Hwang, K.: Security–driven heuristics and a fast genetic algorithm for trusted grid job scheduling. In: IPDP 2005, Denver, Colorado (2005)Google Scholar
- 14.Dong, F., Akl, S.G.: Scheduling algorithms for grid computing: State of the art and open problems. Technical Report2006–504, School of Computing, Queen (2006)Google Scholar
- 15.Fitzgerald, S., Foster, I., Kesselman, C., von Laszewski, G., Smith, W., Tuecke, S.: A directory service for configuring high-performance distributed computations. In: Sixth Symp. on High Performance Distributed Computing, Portland, OR, USA, pp. 365–375. IEEE Computer Society, Los Alamitos (1997)CrossRefGoogle Scholar