skip to main content
10.1145/1555284.1555289acmconferencesArticle/Chapter ViewAbstractPublication PagesicacConference Proceedingsconference-collections
research-article

An innovative perspective on mapping in grids

Published:19 June 2009Publication History

ABSTRACT

To execute large scale applications exploiting the unemployed aggregated power available on grid nodes, effective and efficient mapping algorithms must be designed. Since the problem of optimally mapping is NP--complete, heuristic techniques can be profitably adopted to find near--optimal solutions. Here a multiobjective Differential Evolution algorithm is implemented and tested on different mapping scenarios with the aim to fulfill several optimization criteria. The results attained show the robustness of the evolutionary approach proposed in dealing with multisite grid mapping.

References

  1. Foster and C. Kesselmann C (eds). The Grid 2: Blueprint for a New Computing Architecture. Morgan Kaufmann, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. J. M. Schopf. Ten actions when grid scheduling: the user as a grid scheduler. In Grid Resource Management: State of the Art and Future Trends, pages 15--23. Kluwer Academic Publishers, Norwell, MA, USA, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. G. Mateescu. Quality of service on the grid via metascheduling with resource co-scheduling and co-reservation. Int. Journal of High Performance Computing Applications, 17(3):209--218, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. O. Wäldrich, P. Wieder, and W. Ziegler. A meta-scheduling service for coallocating arbitrary types of resources. In Proceedings of the Sixth Int. Conference on Parallel Processing and Applied Mathematics, LNCS vol. 3911, pages 782--791, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. J. Blythe, S. Jain, E. Deelman, Y. Gil, K. Vahi, A. Mandal, and K. Kennedy. Task scheduling strategies for workflow-based applications in grids. In Proceedings of the IEEE Int. Symposium on Cluster Computing and Grid, pages 759--767, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. 6. A. Doǧan and F. Özgüner. Scheduling of a meta-task with QoS requirements in heterogeneous computing systems. Journal of Parallel and Distributed Computing, 66(2):181--186, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. I. Foster. Globus toolkit Version 4: Software for service-oriented systems. In Proceedings of IFIP Int. Conference on Network and Parallel Computing, LNCS vol. 3779, pages 2--13, Beijing, China, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. F. Berman. High-performance schedulers. In The Grid: Blueprint for a Future Computing Infrastructure. Foster I, Kesselman C (eds). Morgan Kaufmann, pp. 279--307, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. D. Fernandez-Baca. Allocating modules to processors in a distributed system. IEEE Trans. on Software Engineering, 15(11):1427--1436, 1989. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. H. Casanova, A. Legrand, D. Zagorodnov, F. Berman. Heuristics for scheduling parameter sweep applications in grid environments. In Proceedings of the 9th Heterogeneous Computing Workshop, pages 349--363, Cancun, Mexico, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. T. D. Braun, H. J. Siegel, N. Beck, L. L. Bölöni, M. Maheswaran, A.I. Reuther, J. P. Robertson, M. D. Theys, and B. Yao. 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. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. O. Beaumont, A. Legrand, and Y. Robert Y. Scheduling divisible workloads on heterogeneous platforms. Parallel Computing, 29(9):1121--1152, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. V. Di Martino and M. Mililotti. Suboptimal scheduling in a grid using genetic algorithms. Parallel Computing, 30:553--565, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Y. Gao, J. Z. Huang, and H. Rong. Adaptive grid job scheduling with genetic algorithm. Future Generation Computer Systems, 21:151--161, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. J. M. P. Sinaga, H. H. Mohamed, and D. H. J. Epema. A dynamic co-allocation service in multicluster systems. Proceedings of the Tenth Workshop on Job Scheduling Strategies for Parallel Processing, D. G. Feitelson, L. Rudolph, U. Schwiegelshohn (eds.), LNCS vol. 3277, pages 194--209, New York, USA, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. G. Onwubolu, G. Davendra. Scheduling flowshops using differential evolution algorithm. European Journal of Operational Research, 171:674--692, 2006.Google ScholarGoogle ScholarCross RefCross Ref
  17. I. De Falco, A. Della Cioppa, U. Scafuri, E. Tarantino. Multiobjective Differential Evolution for Mapping in a Grid Environment. In Proc. High Performance Computing Conf. - Lecture Notes in Computer Science, vol. 4782, pp. 322--333. R. Perrott et al. (eds.). Springer, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. K. Price and R. Storn. Differential evolution. Dr. Dobb's Journal, 22(4):18--24, 1997.Google ScholarGoogle Scholar
  19. Storn R, Price K (1997) Differential evolution - a simple and efficient heuristic for global optimization over continuous spaces. Journal of Global Optimization, 11(4):341--359. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. C. M. Fonseca and P. J. Fleming. An overview of evolutionary algorithms in multiobjective optimization. Evolutionary Computation, 3(1):1--16, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. F. Dong and S. G Akl. Scheduling algorithms for grid computing: state of the art and open problems. Technical Report no. 2006--504, School of Computing, Queen's University Kingston, Ontario, 2006.Google ScholarGoogle Scholar
  22. J. M. Schopf and F. Berman. Using stochastic information to predict application behavior on contended resources. Int. J. Found. Comput. Sci., 12(3):341--364, 2001.Google ScholarGoogle ScholarCross RefCross Ref
  23. L. Yang L, J. M. Schopf, and I. Foster. Conservative scheduling: using predicted variance to improve scheduling decisions in dynamic environments. In Proceedings of the ACM/IEEE Conference on High Performance Networking and Computing, page 31, 15--21 November 2003, Phoenix, AZ, USA, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. S. Vazhkudai and J. M. Schopf. Using regression techniques to predict large data transfers. The Int. Journal of High Performance Computing Applications: Special issue on Grid Computing: Infrastructure and Applications, 17(3):249--268, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. K. Czajkowski, S. Fitzgerald, I. Foster, and C. Kesselman. Grid information services for distributed resource sharing. In Proceedings of the Tenth IEEE Symp. on High Performance Distributed Computing, pages 181--194, San Francisco, CA, USA, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. R. Wolski, N. Spring, and J. Hayes. The network weather service: a distributed resource performance forecasting service for metacomputing. Future Generation Computer Systems, 15(5-6):757--768, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. S. Fitzgerald, I. Foster, C. Kesselman, G. von Laszewski, W. Smith, and S. Tuecke. A directory service for configuring high-performance distributed computations. In Proceedings of the Sixth IEEE Symp. on High Performance Distributed Computing, pages 365--375, Portland, OR, USA, 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. H. J. Siegel , H. G. Dietz, J.K. Antonio. Software support for heterogeneous computing. ACM Computing Surveys, 28(1):237--239, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. A. K. M. Khaled Ahsan Talukder, M. Kirley, and R. Buyya. Multiobjective differential evolution for workflow execution on grids. In Proceedings of the 5th Int. Workshop on Middleware for Grid Computing, Newport Beach, California, USA, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. An innovative perspective on mapping in grids

      Recommendations

      Reviews

      Luminita State

      The research presented in this paper focuses on adapting, implementing, and testing a variant of the multiobjective differential evolution (DE) algorithm proposed by Storn and Price in 1997 [1], for solving grid scheduling tasks. The introductory section supplies certain considerations concerning the task-to-node allocation and task scheduling problems, as well as comments on current research and trends in the area. The DE algorithm is briefly presented in the second section of the paper. In the first part of Section 3, De Falco et al. describe the parameters of the proposed mapping model and a series of means to overcome the difficulties that arise when deriving suitable parameter settings. Aiming to develop an evolutionary-based approach in the search for an optimal mapping, the second part of this section presents the details of encoding the mapping solutions, the recombination operators, and the fitness criteria. The optimality of the mapping solutions is defined in terms of two fitness functions-expressing the amount of time the grid resources are used and their reliability-and the optimal mapping results, as a solution computed by a multiobjective DE approach. The performance of the proposed method is tested by simulations on a grid architecture that aggregates 184 nodes grouped into six sites. The tests performed and the results obtained are described in Section 4. The first set of tests is carried out on a ring structure application that consists of 16 tasks and on a master-slave application that consists of 31 tasks. The results obtained are promising, and confirm the potential of evolutionary-based approaches in solving the grid multisite mapping problem. Online Computing Reviews Service

      Access critical reviews of Computing literature here

      Become a reviewer for Computing Reviews.

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Conferences
        BADS '09: Proceedings of the 2009 workshop on Bio-inspired algorithms for distributed systems
        June 2009
        114 pages
        ISBN:9781605585840
        DOI:10.1145/1555284

        Copyright © 2009 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 19 June 2009

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article
      • Article Metrics

        • Downloads (Last 12 months)0
        • Downloads (Last 6 weeks)0

        Other Metrics

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader