Mostrar el registro sencillo del ítem

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

dc.creatorGutiérrez S.A.
dc.creatorBarcellos M.
dc.creatorBranch J.W.
dc.date2018
dc.date.accessioned2021-02-05T14:59:54Z
dc.date.available2021-02-05T14:59:54Z
dc.identifier.issn127353
dc.identifier.urihttp://hdl.handle.net/11407/6133
dc.descriptionState-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.
dc.language.isoeng
dc.publisherUniversidad Nacional de Colombia
dc.relation.isversionofhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85060983713&doi=10.15446%2fdyna.v85n206.71626&partnerID=40&md5=ba3f9ff35cb4f1fce912efe75c361d1e
dc.sourceDYNA (Colombia)
dc.titleDynamic adjustment of a MLFQ flow scheduler to improve cloud applications performance
dc.typeArticleeng
dc.rights.accessrightsinfo:eu-repo/semantics/restrictedAccess
dc.publisher.programIngeniería de Telecomunicacionesspa
dc.identifier.doi10.15446/dyna.v85n206.71626
dc.relation.citationvolume85
dc.relation.citationissue206
dc.relation.citationstartpage16
dc.relation.citationendpage23
dc.publisher.facultyFacultad de Ingenieríasspa
dc.affiliationGutiérrez, S.A., Facultad de Minas, Universidad Nacional de Colombia, Medellín, Colombia, Facultad de Ingenierías, Universidad de Medellín, Medellín, Colombia
dc.affiliationBarcellos, M., Instituto de Infiormática, Universidade Federal do Rio Grande do Sul, Porto Alegre, Brazil
dc.affiliationBranch, J.W., Facultad de Minas, Universidad Nacional de Colombia, Medellín, Colombia
dc.relation.referencesAlizadeh, 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
dc.relation.referencesAlizadeh, 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
dc.relation.referencesAlizadeh, 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
dc.relation.referencesAlizadeh, 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
dc.relation.referencesBai, 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
dc.relation.referencesBai, 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
dc.relation.referencesBenson, 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
dc.relation.referencesBosshart, 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
dc.relation.referencesChen, 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
dc.relation.referencesCorbato, 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
dc.relation.referencesVojta, 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
dc.relation.referencesHoganson, K., Brown, J., Intelligent mitigation in multilevel feedback queues (2017) Proceedings of the Southeast Conference, pp. 158-163. , New York, NY, USA
dc.relation.referencesHong, 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
dc.relation.referencesJoy, 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
dc.relation.referencesMunir, 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
dc.relation.referencesNoormohammadpour, M., Raghavendra, C.S., Datacenter traffic control: Understanding techniques and trade-offs (2017) IEEE Communications Surveys Tutorials, 99, p. 1
dc.relation.referencesPfaff, 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
dc.relation.referencesRojas-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
dc.relation.referencesRoy, 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
dc.relation.referencesSivaraman, 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
dc.relation.referencesSivaraman, 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
dc.relation.referencesSivaraman, 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.type.versioninfo:eu-repo/semantics/publishedVersion
dc.type.driverinfo:eu-repo/semantics/article


Ficheros en el ítem

FicherosTamañoFormatoVer

No hay ficheros asociados a este ítem.

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem