Skip to main content

Learning Automata Based Algorithms for Mapping of a Class of Independent Tasks over Highly Heterogeneous Grids

  • Conference paper
Advances in Grid Computing - EGC 2005 (EGC 2005)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 3470))

Included in the following conference series:

Abstract

Computational grid provides a platform for exploiting various computational resources over wide area networks. One of the concerns in implementing computational grid environment is how to effectively map tasks onto resources in order to gain high utilization in the highly heterogeneous environment of the grid. In this paper, three algorithms for task mapping based on learning automata are introduced. To show the effectiveness of the proposed algorithms, computer simulations have been conducted. The results of experiments show that the proposed algorithms outperform two best existing mapping algorithms when the heterogeneity of the environment is very high.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Rosenberg, A.L.: Optimal scheduling for cycle-stealing in a network of workstations with a bag-of-tasks workload. IEEE Trans. Parallel Distributed Systems 13(2), 179–191 (2002)

    Article  Google Scholar 

  2. Casanova, H., Bartol, T.M., Stiles, J., Berman, F.: Distributing MCell simulations on the grid, Int’l J. High Performance Computing Applications 15(3), 243–257 (2001)

    Article  Google Scholar 

  3. Smallen, S., Cirne, W., Frey, J., Berman, F., Wolski, R., Su, M., Kesselman, C., Young, S., Ellisman, M.: Combining workstations and supercomputers to support grid applications: the parallel tomography experience. In: IEEE Proc. 9th Heterogeneous Computing Workshop, pp. 241–252 (2000)

    Google Scholar 

  4. Macheswaran, M., Ali, S., Siegel, H.J., Hensgen, D., Freund, R.F.: Dynamic mapping of a class of independent tasks onto heterogeneous computing systems, J. Parallel Distributed Computing 59(2), 107–131 (1999)

    Article  Google Scholar 

  5. Braun, T.D., Siegel, H.J., Beck, N.: A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems. J.Parallel and Distributed Computing 61, 810–837 (2001)

    Article  Google Scholar 

  6. Braun, T.D., Siegel, H.J., et al.: Taxonomy for describing matching and scheduling heuristics for mixed-machine heterogeneous computing systems. In: Proc. 17th IEEE Symposium on Reliable Distributed Systems, pp. 330–335 (1998)

    Google Scholar 

  7. Wu, M.-Y., Shu, W.: A high-performance mapping algorithm for heterogeneous computing systems. In: Proc. 15th Int’l Parallel and Distributed Processing Symposium, IPDPS 2001 (2001)

    Google Scholar 

  8. Narendra, K., Thathachar, M.A.L.: Learning Automata: An Introduction. Prentice Hall, Englewood Cliffs (1989)

    Google Scholar 

  9. Berman, F.: High-performance schedulers. In: Foster, I., Kesselman, C. (eds.) The Grid: Blueprint for a New Computing Infrastructure, pp. 279–310. Morgan Kaufmann, San Francisco (1999)

    Google Scholar 

  10. Chen, H., Maheswaran, M.: Distributed dynamic scheduling of composite tasks on grid computing systems. In: Proc. Int’l Parallel and Distributed Processing Symposium, IPDPS 2002 (2002)

    Google Scholar 

  11. Ibarra, O.H., Kim, C.E.: Heuristic Algorithms for scheduling independent tasks on non-identical processors. J.ACM 24(2), 280–289 (1977)

    Article  MATH  MathSciNet  Google Scholar 

  12. Weng, C., Lu, X.: Heuristic scheduling for bag-of-tasks applications in combination with QoS in the computational grid. In: J. Future Generation Computer Systems. Elsevier, Amsterdam (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ghanbari, S., Meybodi, M.R. (2005). Learning Automata Based Algorithms for Mapping of a Class of Independent Tasks over Highly Heterogeneous Grids. In: Sloot, P.M.A., Hoekstra, A.G., Priol, T., Reinefeld, A., Bubak, M. (eds) Advances in Grid Computing - EGC 2005. EGC 2005. Lecture Notes in Computer Science, vol 3470. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11508380_69

Download citation

  • DOI: https://doi.org/10.1007/11508380_69

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-26918-2

  • Online ISBN: 978-3-540-32036-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics