Política de escalonamento Owner-Share para sistemas de grades heterogêneas
Resumo
Grades formam uma infraestrutura eficiente para compartilhar recursos computacionais na internet, sendo a base para computação em nuvem. Um problema importante com grades é como alocar recursos entre usuários, em especial quando os recursos são fornecidos pelos próprios usuários. Várias políticas de justiça têm sido propostas, baseadas no histórico de uso, provisão de recursos, ou propriedade, por exemplo. Aqui apresentamos uma extensão de uma política baseada em propriedade (OSEP), buscando um maior controle de nós heterogêneos. Essa política é baseada em penalidades atribuídas por uso injusto de recursos. A definição e forma de cálculo das penalidades são descritas, assim como os resultados obtidos.Referências
Amar, L., Barak, A., Levy, E., and Okun, M. (2007). An on-line algorithm for fairshare node allocations in a cluster. In CCGRID '07: Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid, pages 83–91, Washington, DC, USA. IEEE Computer Society.
Andrade, N., Brasileiro, F., Cirne, W., and Mowbray, M. (2004). Discouraging free riding in a peer-to-peer cpu-sharing grid. In Proc. of the 13th IEEE International Symposium on High Performance Distributed Computing, HPDC '04, pages 129– 137. IEEE Computer Society.
Arpaci-Dusseau, A. C. and Culler, D. E. (1997). Extending proportional-share scheduling to a network of workstations. In In Proceedings of Parallel and Distributed Processing Techniques and Applications (PDPTA'97), Las Vegas, NV.
Di, S., Kondo, D., and Cappello, F. (2013). Characterizing cloud applications on a google data center. In 2013 42nd International Conference on Parallel Processing, pages 468–473. IEEE.
Doulamis, N., Doulamis, A., Varvarigos, E., and Varvarigou, T. (2007). Fair scheduling algorithms in grids. Parallel and Distributed Systems, IEEE Transactions on, 18(11):1630–1648.
Falavinha Jr., J., Manacero Jr., A., Livny, M., and Bradley, D. (2009). The ownershare scheduler for a distributed system. In Proc. of 38th Intl. Conf. on Parallel Processing Workshops, pages 298–305. IEEE.
Fujimoto, N. and Hagihara, K. (2004). A comparison among grid scheduling algorithms for independent coarse-grained tasks. In Proceedings of the 2004 Symposium on Applications and the Internet-Workshops (SAINT 2004 Workshops), SAINT-W '04, pages 674–, Washington, DC, USA. IEEE Computer Society.
Hadoop Project (2016a). Capacity Scheduler Guide. http://hadoop.apache.org/docs/stable/hadoop-yarn/hadoop-yarn-site/CapacityScheduler.html acessado em 06/08/2016.
Hadoop Project (2016b). Fair Scheduler. http://hadoop.apache.org/docs/stable/hadoop-yarn/hadoop-yarn-site/FairScheduler.html acessado em 06/08/2016.
Kay, J. and Lauder, P. (1988). A fair share scheduler. Commun. ACM, 31(1):44–55.
Livny, M. and Raman, R. (1998). High-throughput resource management. In Foster, I. and Kesselman, C., editors, The Grid: Blueprint for a New Computing Infrastructure. Morgan Kaufmann.
Manacero, A., Lobato, R. S., Oliveira, P. H. M. A., Garcia, M. A. B. A., Guerra, iSPD: an iconicA. I., Aoqui, V., Menezes, D., and da Silva, D. T. (2012). based modeling simulator for distributed grids. In Proceedings of the 45th Annual Simulation Symposium, ANSS '12, pages 5:1–5:8, San Diego, CA, USA. Society for Computer Simulation International.
Qureshi, M. B., Dehnavi, M. M., Min-Allah, N., Qureshi, M. S., Hussain, H., Rentis, I., Tziritas, N., Loukopoulos, T., Khan, S. U., Xu, C.-Z., and Zomaya, A. Y. (2014). Survey on grid resource allocation mechanisms. Journal of Grid Computing, 12(2):399–441.
Thain, D., Tannenbaum, T., and Livny, M. (2005). Distributed computing in practice: the condor experience. Concurrency Practice and Experience, 17(2-4):323– 356.
Tomas, L., Ostberg, P., Caminero, B., Carrion, C., and Elmroth, E. (2012). Addressing qos in grids through a fairshare meta-scheduling in-advance architecture. In P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC), 2012 Seventh International Conference on, pages 226–233.
Andrade, N., Brasileiro, F., Cirne, W., and Mowbray, M. (2004). Discouraging free riding in a peer-to-peer cpu-sharing grid. In Proc. of the 13th IEEE International Symposium on High Performance Distributed Computing, HPDC '04, pages 129– 137. IEEE Computer Society.
Arpaci-Dusseau, A. C. and Culler, D. E. (1997). Extending proportional-share scheduling to a network of workstations. In In Proceedings of Parallel and Distributed Processing Techniques and Applications (PDPTA'97), Las Vegas, NV.
Di, S., Kondo, D., and Cappello, F. (2013). Characterizing cloud applications on a google data center. In 2013 42nd International Conference on Parallel Processing, pages 468–473. IEEE.
Doulamis, N., Doulamis, A., Varvarigos, E., and Varvarigou, T. (2007). Fair scheduling algorithms in grids. Parallel and Distributed Systems, IEEE Transactions on, 18(11):1630–1648.
Falavinha Jr., J., Manacero Jr., A., Livny, M., and Bradley, D. (2009). The ownershare scheduler for a distributed system. In Proc. of 38th Intl. Conf. on Parallel Processing Workshops, pages 298–305. IEEE.
Fujimoto, N. and Hagihara, K. (2004). A comparison among grid scheduling algorithms for independent coarse-grained tasks. In Proceedings of the 2004 Symposium on Applications and the Internet-Workshops (SAINT 2004 Workshops), SAINT-W '04, pages 674–, Washington, DC, USA. IEEE Computer Society.
Hadoop Project (2016a). Capacity Scheduler Guide. http://hadoop.apache.org/docs/stable/hadoop-yarn/hadoop-yarn-site/CapacityScheduler.html acessado em 06/08/2016.
Hadoop Project (2016b). Fair Scheduler. http://hadoop.apache.org/docs/stable/hadoop-yarn/hadoop-yarn-site/FairScheduler.html acessado em 06/08/2016.
Kay, J. and Lauder, P. (1988). A fair share scheduler. Commun. ACM, 31(1):44–55.
Livny, M. and Raman, R. (1998). High-throughput resource management. In Foster, I. and Kesselman, C., editors, The Grid: Blueprint for a New Computing Infrastructure. Morgan Kaufmann.
Manacero, A., Lobato, R. S., Oliveira, P. H. M. A., Garcia, M. A. B. A., Guerra, iSPD: an iconicA. I., Aoqui, V., Menezes, D., and da Silva, D. T. (2012). based modeling simulator for distributed grids. In Proceedings of the 45th Annual Simulation Symposium, ANSS '12, pages 5:1–5:8, San Diego, CA, USA. Society for Computer Simulation International.
Qureshi, M. B., Dehnavi, M. M., Min-Allah, N., Qureshi, M. S., Hussain, H., Rentis, I., Tziritas, N., Loukopoulos, T., Khan, S. U., Xu, C.-Z., and Zomaya, A. Y. (2014). Survey on grid resource allocation mechanisms. Journal of Grid Computing, 12(2):399–441.
Thain, D., Tannenbaum, T., and Livny, M. (2005). Distributed computing in practice: the condor experience. Concurrency Practice and Experience, 17(2-4):323– 356.
Tomas, L., Ostberg, P., Caminero, B., Carrion, C., and Elmroth, E. (2012). Addressing qos in grids through a fairshare meta-scheduling in-advance architecture. In P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC), 2012 Seventh International Conference on, pages 226–233.
Publicado
05/10/2016
Como Citar
FORTE, C. H. V.; MANACERO, A.; LOBATO, R. S.; SPOLON, R. ; FALAVINHA-JR, J. N..
Política de escalonamento Owner-Share para sistemas de grades heterogêneas. In: SIMPÓSIO EM SISTEMAS COMPUTACIONAIS DE ALTO DESEMPENHO (SSCAD), 17. , 2016, Aracajú.
Anais [...].
Porto Alegre: Sociedade Brasileira de Computação,
2016
.
p. 227-238.
DOI: https://doi.org/10.5753/wscad.2016.14262.
