Please use this identifier to cite or link to this item:
DC FieldValueLanguage
dc.contributorDepartment of Computing-
dc.creatorYang, L-
dc.creatorLiu, XX-
dc.creatorCao, JN-
dc.creatorWang, ZY-
dc.publisherInstitute of Electrical and Electronics Engineersen_US
dc.rights© 2018 IEEE. Translations and content mining are permitted for academic research only. Personal use is also permitted, but republication/redistribution requires IEEE permission. See for more information.en_US
dc.rightsPost with permission of the publisher.en_US
dc.rightsThe following publication Yang, L., Liu, X. X., Cao, J. N., & Wang, Z. Y. (2018). Joint scheduling of tasks and network flows in big data clusters. IEEE Access, 6, 66600-66611 is available at
dc.subjectTask schedulingen_US
dc.subjectFlow schedulingen_US
dc.subjectData centersen_US
dc.subjectSoftware defined networksen_US
dc.titleJoint scheduling of tasks and network flows in big data clustersen_US
dc.typeJournal/Magazine Articleen_US
dcterms.abstractAs an increasing number of big data processing platforms like Hadoop, Spark, and Storm appear and normally share the resources in the data center, it has been important and challenging to schedule various jobs from these platforms onto the underlying data center resources such that the overall job completion time is minimized. To solve the problem, the existing work either focus on the task-level scheduling techniques, such as Quincy and delay scheduling, or focus on the network flow scheduling techniques, such as D3 and preemptive distributed quick. These works deal with the scheduling of tasks and network flows separately and cannot achieve optimal performance. The reason is that the task scheduling without regard of the available network bandwidths may generate the task placement that causes serious network congestions and thus leads to long data transmission time. In this paper, we propose the joint scheduling technique by coordinating the task placement and the scheduling of network flows arising from these tasks. We develop a software-defined network (SDN)-based online scheduling framework which selects the task placement based on the available bandwidth on the SDN switches and at meanwhile optimally allocates the bandwidth to each data flow. Comprehensive trace-driven simulations show that the joint scheduling technique can take full use of the network bandwidth and thus reduce the job completion time by 55% on average compared with the benchmark methods.-
dcterms.bibliographicCitationIEEE access, 2018, v. 6, p. 66600-66611-
dcterms.isPartOfIEEE access-
dc.description.validate201903 bcrc-
Appears in Collections:Journal/Magazine Article
Files in This Item:
File Description SizeFormat 
Yang_Network_Flows_Clusters.pdf7.2 MBAdobe PDFView/Open
View full-text via PolyU eLinks SFX Query
Show simple item record
PIRA download icon_1.1View/Download Full Text

Page view(s)

Citations as of Feb 12, 2020


Citations as of Feb 12, 2020

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.