Skip to main content
Have a personal or library account? Click to login
Modern approaches to modeling user requirements on resource and task allocation in hierarchical computational grids Cover

Modern approaches to modeling user requirements on resource and task allocation in hierarchical computational grids

International Journal of Applied Mathematics and Computer Science
Volume 21 (2011): Issue 2 (June 2011)
By:  and    
Open Access
|Jun 2011
References

References

  1. Abraham, A., Buyya, R. and Nath, B. (2000). Nature's heuristics for scheduling jobs on computational grids,, pp. 45-52.
    Search in Google Scholar
  2. Ali, S., Siegel, H., Maheswaran, M. and Hensgen, D. (2000). Task execution time modeling for heterogeneous computing system,, pp. 185-199.
    Search in Google Scholar
  3. Baçsar, T. and Olsder, G. (1995)., 2nd Edn., Academic Press, London.
    Search in Google Scholar
  4. Brandic, I., Pllana, S. and Benkner, S. (2006). An approach for the high-level specification of qos-aware grid workflows considering location affinity,(3-4): 231-250.
    Open DOISearch in Google Scholar
  5. Braun, T., Siegel, H.J., Beck, N., Boloni, L.L., Maheswaran, M., Reuther, A.I., Robertson, J.P., Theys, M.D., Yao, B., Hensgen, D. and Freund, R.F. (2001). A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems,(6): 810-837.
    Open DOISearch in Google Scholar
  6. Buyya, R., Abramson, D. and Giddy, J. (2000). An economy driven resource management architecture for global computational power grids,, pp. 517-525.
    Search in Google Scholar
  7. Buyya, R., Abramson, D., Giddy, J. and Stockinger, H. (2002). Economic models for resource management and scheduling in grid computing,(13-15): 1507-1542.
    Open DOISearch in Google Scholar
  8. Buyya, R. and Bubendorfer, K. (2009)., Wiley Press, New York, NY.
    Open DOISearch in Google Scholar
  9. Edlefsen, L. and Millham, C. (1972). On a formulation of discrete n-person non-cooperative games,(1): 31-34.
    Open DOISearch in Google Scholar
  10. Garg, S., Buyya, R. and Segel, H. (2009). Scheduling parallel aplications on utility grids: Time and cost trade-off management,, Vol. 91, Australian Computer Society, Inc., Darlinghurst, Australia, pp. 139-147.
    Search in Google Scholar
  11. Ghosh, P., Roy, N., Basu, K. and Das, S. (2005). A game theory based pricing strategy for job allocation in mobile grids,(11): 1366-1383.
    Open DOISearch in Google Scholar
  12. Hwang, S. and Kesselman, C. (2003). A flexible framework for fault tolerance in the grid,(3): 251-272.
    Open DOISearch in Google Scholar
  13. Khan, S. and Ahmad, I. (2006). Non-cooperative, semi-cooperative, and cooperative games-based grid resource allocation,, pp. 101-104.
    Search in Google Scholar
  14. Kołodziej, J. and Xhafa, F. (2010). A game-theoretic and hybrid genetic meta-heuristic model for security-assured scheduling of independent jobs in computational grids,L. Barolli, F. Xhafa and S. Venticinque (Eds.), IEEE Press, Los Alamitos, CA, pp. 93-100.
    Open DOISearch in Google Scholar
  15. Kołodziej, J., Xhafa, F. and Kolanko, L. (2009). Hierarchic genetic scheduler of independent jobs in computational grid environment,J. Otamendi, A. Bargiela, J.L. Montes and L.M. Doncel Pedrera (Eds.),, IEEE Press, Los Alamitos, CA, pp. 108-115.
    Open DOISearch in Google Scholar
  16. Kwok, Y.-K., Hwang, K. and Song, S. (2007). Selfish grids: Game-theoretic modeling and nas/psa benchmark evaluation,(5): 1-16.
    Open DOISearch in Google Scholar
  17. Laccetti, G. and Schmidb, G. (2007). A framework model for grid security,(5): 702-713.
    Open DOISearch in Google Scholar
  18. Lim, D., Ong, Y.-S. and Jin, Y. (2007). Efficient hierarchical parallel genetic algorithms using grid computing,(4): 658-670.
    Open DOISearch in Google Scholar
  19. Lin, C., Wang, V.V.Y. and Pruthi, V. (2004). Enhancing grid security with trust management,, pp. 303-310.
    Search in Google Scholar
  20. Liu, H., Abraham, A. and Hassanien, A. (2009). Scheduling jobs on computational grids using a fuzzy particle swarm optimization algorithm,(8): 1336-1343.
    Open DOISearch in Google Scholar
  21. Mesghouni, K., Hammadi, S. and Borne, P. (2004). Evolutionary alogorithms for job-shop scheduling,(1): 91-103.
    Search in Google Scholar
  22. Pavlidis, N., Parsopoulos, K. and Vrahatis, M. (2005). Computing nash equilibria through computational intelligence methods,(1): 113-136.
    Open DOISearch in Google Scholar
  23. Regev, O. and Nisan, N. (2000). The popcorn market—Online markets for computational resources,(1-2): 177-189.
    Open DOISearch in Google Scholar
  24. Ritchie, G. and Levine, J. (2003). A fast effective local search for scheduling independent jobs in heterogeneous computing environments,, Centre for Intelligent Systems and Their Applications, School of Informatics, University of Edinburgh, Edinburgh.
    Search in Google Scholar
  25. Roughgarden, T. (2004). Stackelberg scheduling strategies,(2): 332-350.
    Open DOISearch in Google Scholar
  26. Song, S., Hwang, K. and Kwok, Y. (2005). Trusted grid computing with security binding and trust integration,(1-2): 53-73.
    Open DOISearch in Google Scholar
  27. Song, S., Hwang, K. and Kwok, Y.-K. (2006). Risk-resilient heuristics and genetic algorithms for security-assured grid job scheduling,(6): 703-719.
    Open DOISearch in Google Scholar
  28. Straffin, P. (1996)., Mathematical Association of America Textbooks, Washington, DC.
    Search in Google Scholar
  29. Subrata, R., Zomaya, A.Y. and Landfeldt, B. (2010). Cooperative power-aware scheduling in grid computing environments,(2): 84-91.
    Open DOISearch in Google Scholar
  30. Wolski, R., Plank, J., Bryan, T. and Brevik, J. (2001). Gcommerce: Market formulations controlling resource allocation on the computational grid,
    Search in Google Scholar
  31. Wu, C. and Sun, R.-Y. (2010). An integrated security-aware job scheduling strategy for large-scale computational grids,(2): 198-206.
    Open DOISearch in Google Scholar
  32. Xhafa, F. and Abraham, A. (2010). Computational models and heuristic methods for grid scheduling problems,(4): 608-621.
    Open DOISearch in Google Scholar
  33. Xhafa, F., Barolli, L. and Durresi, A. (2008). An experimental study on genetic algorithms for resource allocation on grid systems,(4): 427-443.
    Open DOISearch in Google Scholar
  34. Xhafa, F., Carretero, J. and Abraham, A. (2007). Genetic algorithm based schedulers for grid computing systems,(5): 1-19.
    Search in Google Scholar
  35. Xhafa, F., Carretero, J., Alba, E. and Dorronsoro, B. (2009). Tabu search algorithm for scheduling independent jobs in computational grids,(2): 237-249.
    Search in Google Scholar
  36. Xhafa, F., Gonzalez, J., Dahal, K. and Abraham, A. (2009). A GA(TS) hybrid algorithm for scheduling in computational grids,E. Corchado, X. Wu, E. Oja, Á. Herrero and B. Baruque (Eds.),, Lecture Notes in Computer Science, Vol. 5572, Springer, Berlin/Heidelberg, pp. 285-292.
    Open DOISearch in Google Scholar
DOI: https://doi.org/10.2478/v10006-011-0018-x | Journal eISSN: 2083-8492 | Journal ISSN: 1641-876X
Journal RSS Feed
Language: English
Page range: 243 - 257
Published on: Jun 22, 2011
Published by: University of Zielona Góra
In partnership with: Paradigm Publishing Services
Publication frequency: 4 issues per year
Keywords:
computational grids,
scheduling,
non-cooperative games,
user behavior,
security,
meta-heuristics
Related subjects:
Mathematics,
Applied mathematics

© 2011 Joanna Kołodziej, Fatos Xhafa, published by University of Zielona Góra
This work is licensed under the Creative Commons License.

Volume 21 (2011): Issue 2 (June 2011)
Previous article
Next article