Dynamic adjustment of a MLFQ flow scheduler to improve cloud applications performance

State-of-the-art solutions for flow scheduling propose the use of Multi Level Feedback Queue (MLFQ) as a mechanism to avoid the requirement of prior information (i.e. agnosticism) regarding flow sizes. This is an important aspect to achieve the performance goals of high responsiveness and high throu...

Full description

Autores:
Tipo de recurso:
Fecha de publicación:
2018
Institución:
Universidad de Medellín
Repositorio:
Repositorio UDEM
Idioma:
eng
OAI Identifier:
oai:repository.udem.edu.co:11407/6133
Acceso en línea:
http://hdl.handle.net/11407/6133
Palabra clave:
Rights
License
http://purl.org/coar/access_right/c_16ec
id REPOUDEM2_87d2e356bd0641a5f0b362e26dad595a
oai_identifier_str oai:repository.udem.edu.co:11407/6133
network_acronym_str REPOUDEM2
network_name_str Repositorio UDEM
repository_id_str
dc.title.none.fl_str_mv Dynamic adjustment of a MLFQ flow scheduler to improve cloud applications performance
title Dynamic adjustment of a MLFQ flow scheduler to improve cloud applications performance
spellingShingle Dynamic adjustment of a MLFQ flow scheduler to improve cloud applications performance
title_short Dynamic adjustment of a MLFQ flow scheduler to improve cloud applications performance
title_full Dynamic adjustment of a MLFQ flow scheduler to improve cloud applications performance
title_fullStr Dynamic adjustment of a MLFQ flow scheduler to improve cloud applications performance
title_full_unstemmed Dynamic adjustment of a MLFQ flow scheduler to improve cloud applications performance
title_sort Dynamic adjustment of a MLFQ flow scheduler to improve cloud applications performance
description State-of-the-art solutions for flow scheduling propose the use of Multi Level Feedback Queue (MLFQ) as a mechanism to avoid the requirement of prior information (i.e. agnosticism) regarding flow sizes. This is an important aspect to achieve the performance goals of high responsiveness and high throughput that is expected in Cloud Applications (e.g. search engines, social networks, and e-commerce sites). These goals are tightly associated with the prioritization of short flows (a few KB in size), the majority for these applications rather than long flows (several MB in size). However, these applications usually cannot provide information in advance about the size of the flows. In this paper, we analyze the feasibility of providing dynamic adjustment for a MLFQ-based scheduling system in such a way that it adapts itself to the time and space variations exhibited by Data Center Network (DCN) traffic without requiring prior information about workload properties. © The author; licensee Universidad Nacional de Colombia.
publishDate 2018
dc.date.accessioned.none.fl_str_mv 2021-02-05T14:59:54Z
dc.date.available.none.fl_str_mv 2021-02-05T14:59:54Z
dc.date.none.fl_str_mv 2018
dc.type.eng.fl_str_mv Article
dc.type.coarversion.fl_str_mv http://purl.org/coar/version/c_970fb48d4fbd8a85
dc.type.coar.fl_str_mv http://purl.org/coar/resource_type/c_6501
http://purl.org/coar/resource_type/c_2df8fbb1
dc.type.driver.none.fl_str_mv info:eu-repo/semantics/article
dc.identifier.issn.none.fl_str_mv 127353
dc.identifier.uri.none.fl_str_mv http://hdl.handle.net/11407/6133
dc.identifier.doi.none.fl_str_mv 10.15446/dyna.v85n206.71626
identifier_str_mv 127353
10.15446/dyna.v85n206.71626
url http://hdl.handle.net/11407/6133
dc.language.iso.none.fl_str_mv eng
language eng
dc.relation.isversionof.none.fl_str_mv https://www.scopus.com/inward/record.uri?eid=2-s2.0-85060983713&doi=10.15446%2fdyna.v85n206.71626&partnerID=40&md5=ba3f9ff35cb4f1fce912efe75c361d1e
dc.relation.citationvolume.none.fl_str_mv 85
dc.relation.citationissue.none.fl_str_mv 206
dc.relation.citationstartpage.none.fl_str_mv 16
dc.relation.citationendpage.none.fl_str_mv 23
dc.relation.references.none.fl_str_mv Alizadeh, M., Greenberg, A., Maltz, D.A., Padhye, J., Patel, P., Prabhakar, B., Sengupta, S., Sridharan, M., (2010) Proceedings of the ACM SIGCOMM 2010 Conference, pp. 63-74. , New York, NY, USA
Alizadeh, M., Javanmard, A., Prabhakar, B., Analysis of DCTCP: Stability, convergence, and fairness (2011) Proceedings of the ACM SIGMETRICS Joint International Conference on Measurement and Modeling of Computer Systems, pp. 73-84. , New York, NY, USA
Alizadeh, M., Kabbani, A., Edsall, T., Prabhakar, B., Vahdat, A., Yasuda, M., Less is more: Trading a little bandwidth for ultra-low latency in the data center (2012) Proceedings of the 9Th USENIX Conference on Networked Systems Design and Implementation, p. 19. , Berkeley, CA, USA
Alizadeh, M., Yang, S., Sharif, M., Katti, S., McKeown, N., Prabhakar, B., Shenker, S., PFabric: Minimal near-optimal datacenter transport (2013) Proceedings of the ACM SIGCOMM 2013 Conference on SIGCOMM, pp. 435-446. , New York, NY, USA
Bai, W., Chen, L., Chen, K., Han, D., Tian, C., Wang, H., Information-agnostic flow scheduling for commodity data centers (2015) Proceedings of the 12Th USENIX Conference on Networked Systems Design and Implementation, pp. 455-468. , Berkeley, CA, USA
Bai, W., Chen, L., Chen, K., Han, D., Tian, C., Wang, H., PIAS: Practical information-agnostic flow scheduling for commodity data centers (2017) IEEE/ACM Transactions on Networking, 25 (4), pp. 1954-1967
Benson, T., Akella, A., Maltz, D.A., Network traffic characteristics of data centers in the wild (2010) Proceedings of the 10Th ACM SIGCOMM Conference on Internet Measurement, pp. 267-280. , New York, NY, USA
Bosshart, P., Daly, D., Gibb, G., Izzard, M., McKeown, N., Rexford, J., Schlesinger, C., Walker, D., P4: Programming protocol-independent packet processors (2014) SIGCOMM Comput. Commun. Rev., 44 (3), pp. 87-95
Chen, L., Chen, K., Bai, W., Alizadeh, M., Scheduling mix-flows in commodity datacenters with Karuna (2016) Proceedings of the 2016 ACM SIGCOMM Conference, pp. 174-187. , New York, NY, USA
Corbato, F.J., Merwin-Daggett, M., Daley, R.C., (2001) An Experimental Time-Sharing System. Classic Operating Systems, pp. 117-137. , P.B. Hansen, ed. Springer New York
Vojta, L., Mrljak, V., Curkovic, S., Zivicnjak, T., Marinculic, A., Beck, R., Molecular epizootiology of canine hepatozoonosis in Croatia (2009) Int J Parasitol, 39, pp. 1129-1136
Hoganson, K., Brown, J., Intelligent mitigation in multilevel feedback queues (2017) Proceedings of the Southeast Conference, pp. 158-163. , New York, NY, USA
Hong, C.-Y., Caesar, M., Godfrey, P.B., Finishing flows quickly with preemptive scheduling (2012) Proceedings of the ACM SIGCOMM 2012 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, pp. 127-138. , New York, NY, USA
Joy, S., Nayak, A., Improving flow completion time for short flows in datacenter networks (2015) 2015 IFIP/IEEE International Symposium on Integrated Network Management (IM), pp. 700-705
Munir, A., Baig, G., Irteza, S.M., Qazi, I.A., Liu, A.X., Dogar, F.R., Friends, not foes: Synthesizing existing transport strategies for data center networks (2014) Proceedings of the 2014 ACM Conference on SIGCOMM, pp. 491-502. , New York, NY, USA
Noormohammadpour, M., Raghavendra, C.S., Datacenter traffic control: Understanding techniques and trade-offs (2017) IEEE Communications Surveys Tutorials, 99, p. 1
Pfaff, B., Pettit, J., Koponen, T., Jackson, E.J., Zhou, A., Rajahalme, J., Gross, J., Shelar, P., (2015) The Design and Implementation of Open Vswitch, pp. 117-130. , NSDI
Rojas-Cessa, R., Kaymak, Y., Dong, Z., Schemes for fast transmission of flows in data center networks (2015) IEEE Communications Surveys Tutorials, 17 (3), pp. 1391-1422
Roy, A., Zeng, H., Bagga, J., Porter, G., Snoeren, A.C., Inside the social Network’s (Datacenter) Network (2015) Proceedings of the 2015 ACM Conference on Special Interest Group on Data Communication, pp. 123-137. , New York, NY, USA
Sivaraman, A., Cheung, A., Budiu, M., Kim, C., Alizadeh, M., Balakrishnan, H., Varghese, G., Licking, S., Packet transactions: High-level programming for line-rate switches (2016) Proceedings of the 2016 ACM SIGCOMM Conference, pp. 15-28. , New York, NY, USA
Sivaraman, A., Kim, C., Krishnamoorthy, R., Dixit, A., Budiu, M., DC.P4: Programming the forwarding plane of a data-center switch (2015) Proceedings of the 1St ACM SIGCOMM Symposium on Software Defined Networking Research, pp. 1-2. , New York, NY, USA
Sivaraman, A., Subramanian, S., Alizadeh, M., Chole, S., Chuang, S.T., Agrawal, A., Balakrishnan, H., McKeown, N., Programmable packet scheduling at line rate (2016) Proceedings of the 2016 ACM SIGCOMM Conference, pp. 44-57. , New York, NY, USA
dc.rights.coar.fl_str_mv http://purl.org/coar/access_right/c_16ec
rights_invalid_str_mv http://purl.org/coar/access_right/c_16ec
dc.publisher.none.fl_str_mv Universidad Nacional de Colombia
dc.publisher.program.spa.fl_str_mv Ingeniería de Telecomunicaciones
dc.publisher.faculty.spa.fl_str_mv Facultad de Ingenierías
publisher.none.fl_str_mv Universidad Nacional de Colombia
dc.source.none.fl_str_mv DYNA (Colombia)
institution Universidad de Medellín
repository.name.fl_str_mv Repositorio Institucional Universidad de Medellin
repository.mail.fl_str_mv repositorio@udem.edu.co
_version_ 1808481181412360192
spelling 20182021-02-05T14:59:54Z2021-02-05T14:59:54Z127353http://hdl.handle.net/11407/613310.15446/dyna.v85n206.71626State-of-the-art solutions for flow scheduling propose the use of Multi Level Feedback Queue (MLFQ) as a mechanism to avoid the requirement of prior information (i.e. agnosticism) regarding flow sizes. This is an important aspect to achieve the performance goals of high responsiveness and high throughput that is expected in Cloud Applications (e.g. search engines, social networks, and e-commerce sites). These goals are tightly associated with the prioritization of short flows (a few KB in size), the majority for these applications rather than long flows (several MB in size). However, these applications usually cannot provide information in advance about the size of the flows. In this paper, we analyze the feasibility of providing dynamic adjustment for a MLFQ-based scheduling system in such a way that it adapts itself to the time and space variations exhibited by Data Center Network (DCN) traffic without requiring prior information about workload properties. © The author; licensee Universidad Nacional de Colombia.engUniversidad Nacional de ColombiaIngeniería de TelecomunicacionesFacultad de Ingenieríashttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85060983713&doi=10.15446%2fdyna.v85n206.71626&partnerID=40&md5=ba3f9ff35cb4f1fce912efe75c361d1e852061623Alizadeh, M., Greenberg, A., Maltz, D.A., Padhye, J., Patel, P., Prabhakar, B., Sengupta, S., Sridharan, M., (2010) Proceedings of the ACM SIGCOMM 2010 Conference, pp. 63-74. , New York, NY, USAAlizadeh, M., Javanmard, A., Prabhakar, B., Analysis of DCTCP: Stability, convergence, and fairness (2011) Proceedings of the ACM SIGMETRICS Joint International Conference on Measurement and Modeling of Computer Systems, pp. 73-84. , New York, NY, USAAlizadeh, M., Kabbani, A., Edsall, T., Prabhakar, B., Vahdat, A., Yasuda, M., Less is more: Trading a little bandwidth for ultra-low latency in the data center (2012) Proceedings of the 9Th USENIX Conference on Networked Systems Design and Implementation, p. 19. , Berkeley, CA, USAAlizadeh, M., Yang, S., Sharif, M., Katti, S., McKeown, N., Prabhakar, B., Shenker, S., PFabric: Minimal near-optimal datacenter transport (2013) Proceedings of the ACM SIGCOMM 2013 Conference on SIGCOMM, pp. 435-446. , New York, NY, USABai, W., Chen, L., Chen, K., Han, D., Tian, C., Wang, H., Information-agnostic flow scheduling for commodity data centers (2015) Proceedings of the 12Th USENIX Conference on Networked Systems Design and Implementation, pp. 455-468. , Berkeley, CA, USABai, W., Chen, L., Chen, K., Han, D., Tian, C., Wang, H., PIAS: Practical information-agnostic flow scheduling for commodity data centers (2017) IEEE/ACM Transactions on Networking, 25 (4), pp. 1954-1967Benson, T., Akella, A., Maltz, D.A., Network traffic characteristics of data centers in the wild (2010) Proceedings of the 10Th ACM SIGCOMM Conference on Internet Measurement, pp. 267-280. , New York, NY, USABosshart, P., Daly, D., Gibb, G., Izzard, M., McKeown, N., Rexford, J., Schlesinger, C., Walker, D., P4: Programming protocol-independent packet processors (2014) SIGCOMM Comput. Commun. Rev., 44 (3), pp. 87-95Chen, L., Chen, K., Bai, W., Alizadeh, M., Scheduling mix-flows in commodity datacenters with Karuna (2016) Proceedings of the 2016 ACM SIGCOMM Conference, pp. 174-187. , New York, NY, USACorbato, F.J., Merwin-Daggett, M., Daley, R.C., (2001) An Experimental Time-Sharing System. Classic Operating Systems, pp. 117-137. , P.B. Hansen, ed. Springer New YorkVojta, L., Mrljak, V., Curkovic, S., Zivicnjak, T., Marinculic, A., Beck, R., Molecular epizootiology of canine hepatozoonosis in Croatia (2009) Int J Parasitol, 39, pp. 1129-1136Hoganson, K., Brown, J., Intelligent mitigation in multilevel feedback queues (2017) Proceedings of the Southeast Conference, pp. 158-163. , New York, NY, USAHong, C.-Y., Caesar, M., Godfrey, P.B., Finishing flows quickly with preemptive scheduling (2012) Proceedings of the ACM SIGCOMM 2012 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, pp. 127-138. , New York, NY, USAJoy, S., Nayak, A., Improving flow completion time for short flows in datacenter networks (2015) 2015 IFIP/IEEE International Symposium on Integrated Network Management (IM), pp. 700-705Munir, A., Baig, G., Irteza, S.M., Qazi, I.A., Liu, A.X., Dogar, F.R., Friends, not foes: Synthesizing existing transport strategies for data center networks (2014) Proceedings of the 2014 ACM Conference on SIGCOMM, pp. 491-502. , New York, NY, USANoormohammadpour, M., Raghavendra, C.S., Datacenter traffic control: Understanding techniques and trade-offs (2017) IEEE Communications Surveys Tutorials, 99, p. 1Pfaff, B., Pettit, J., Koponen, T., Jackson, E.J., Zhou, A., Rajahalme, J., Gross, J., Shelar, P., (2015) The Design and Implementation of Open Vswitch, pp. 117-130. , NSDIRojas-Cessa, R., Kaymak, Y., Dong, Z., Schemes for fast transmission of flows in data center networks (2015) IEEE Communications Surveys Tutorials, 17 (3), pp. 1391-1422Roy, A., Zeng, H., Bagga, J., Porter, G., Snoeren, A.C., Inside the social Network’s (Datacenter) Network (2015) Proceedings of the 2015 ACM Conference on Special Interest Group on Data Communication, pp. 123-137. , New York, NY, USASivaraman, A., Cheung, A., Budiu, M., Kim, C., Alizadeh, M., Balakrishnan, H., Varghese, G., Licking, S., Packet transactions: High-level programming for line-rate switches (2016) Proceedings of the 2016 ACM SIGCOMM Conference, pp. 15-28. , New York, NY, USASivaraman, A., Kim, C., Krishnamoorthy, R., Dixit, A., Budiu, M., DC.P4: Programming the forwarding plane of a data-center switch (2015) Proceedings of the 1St ACM SIGCOMM Symposium on Software Defined Networking Research, pp. 1-2. , New York, NY, USASivaraman, A., Subramanian, S., Alizadeh, M., Chole, S., Chuang, S.T., Agrawal, A., Balakrishnan, H., McKeown, N., Programmable packet scheduling at line rate (2016) Proceedings of the 2016 ACM SIGCOMM Conference, pp. 44-57. , New York, NY, USADYNA (Colombia)Dynamic adjustment of a MLFQ flow scheduler to improve cloud applications performanceArticleinfo:eu-repo/semantics/articlehttp://purl.org/coar/version/c_970fb48d4fbd8a85http://purl.org/coar/resource_type/c_6501http://purl.org/coar/resource_type/c_2df8fbb1Gutiérrez, S.A., Facultad de Minas, Universidad Nacional de Colombia, Medellín, Colombia, Facultad de Ingenierías, Universidad de Medellín, Medellín, ColombiaBarcellos, M., Instituto de Infiormática, Universidade Federal do Rio Grande do Sul, Porto Alegre, BrazilBranch, J.W., Facultad de Minas, Universidad Nacional de Colombia, Medellín, Colombiahttp://purl.org/coar/access_right/c_16ecGutiérrez S.A.Barcellos M.Branch J.W.11407/6133oai:repository.udem.edu.co:11407/61332021-02-05 09:59:54.345Repositorio Institucional Universidad de Medellinrepositorio@udem.edu.co