Abstract
OCS (Optical Circuit Switch) is increasingly popular for accelerating data transmission of coflows due to its higher bandwidth and lower power consumption compared with EPS (Electronic Packet Switch), where a coflow is a collection of related parallel flows between two computation stages in data-intensive applications. However, the extra port constraints and reconfiguration delay of OCS obstruct the efficiency of OCS operations. This paper studies the problem of coflow scheduling in the OCS of datacenter networks to minimize the total Coflow Completion Time (CCT). We propose a Dynamic Priority Coflow Scheduling Algorithm that schedules coflows preemptively by considering coflow transmission time and OCS reconfiguration delay jointly to dynamically update each coflow's priority, which can significantly reduce the waiting time of small coflows and reduce head-of-line blocking. Extensive simulations based on Facebook data traces show that our approach outperforms the state-of-the-art scheme OMCO [19] significantly, and transmits multiple coflows 1.30× faster than OMCO.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
FaceBookTrace. https://github.com/coflow/coflow-benchmark (2019)
Chen, L., Cui, W., Li, B., Li, B.: Optimizing coflow completion times with utility max-min fairness. In: INFOCOM. IEEE (2016)
Chowdhury, M., Stoica, I.: Coflow: a networking abstraction for cluster applications. In: HotNets-XI. ACM (2012)
Chowdhury, M., Stoica, I.: Efficient Coflow scheduling without prior knowledge. In: SIGCOMM. ACM (2015)
Chowdhury, M., Zaharia, M., Ma, J., Jordan, M. I., Stoica, I.: Managing data transfers in computer clusters with orchestra. In: SIGCOMM. ACM (2011)
Chowdhury, M., Zhong, Y., Stoica, I.: SIGCOMM. ACM (2014)
Dean, J., Ghemawat, S.: MapReduce: simplified data processing on large clusters. Commun. ACM. 51, 107–113 (2008)
Gopal, I., Wong, C.: Minimizing the number of switchings in an SS/TDMA system. IEEE Trans. Commun. 33(6), 497–501 (1985). https://doi.org/10.1109/TCOM.1985.1096336
Huang, X.S., Sun, X.S., Ng, T.S.E.: Sunflow: efficient optical circuit scheduling for Coflows. In: CoNEXT. ACM (2016)
Li, Y., et al.: Efficient online coflow routing and scheduling. In: MobiHoc. ACM (2016)
Li, Z., Zhang, Y., Li, D., Chen, K., Peng, Y.: OPTAS: decentralized flow monitoring and scheduling for tiny tasks. In: INFOCOM. IEEE (2016)
Liu, H., et al.: Scheduling techniques for hybrid circuit/packet networks. In: CoNEXT. ACM (2015)
Porter, G., et al.: Integrating microsecond circuit switching into the data center. In: SIGCOMM. ACM (2013)
Tang, Y., Yuan, T., Liu, B., Xiao, C.: Effective *-flow schedule for optical circuit switching based data center networks: a comprehensive survey. Comput. Netw. 197, 108321 (2021). https://doi.org/10.1016/j.comnet.2021.108321
Wang, C.H., Javidi, T., Porter, G.: End-to-end scheduling for all-optical data centers. In: INFOCOM. IEEE (2015)
Wang, G., et al.: c-Through: part-time optics in data centers. In: SIGCOMM. ACM (2010)
Wang, S., Wang, S., Huo, R., Huang, T., Liu, J., Liu, Y.: DeepAalo: auto-adjusting demotion thresholds for information-agnostic coflow scheduling. In: INFOCOM. IEEE (2020)
Wang, S., Zhang, J., Huang, T., Pan, T., Liu, J., Liu, Y.: Leveraging multiple coflow attributes for information-agnostic coflow scheduling. In: ICC. IEEE (2017)
Xu, C., Tan, H., Hou, J., Zhang, C., Li, X.Y.: OMCO: online multiple coflow scheduling in optical circuit switch. In: ICC. IEEE (2018)
Zhang, C., Tan, H., Xu, C., Li, X.Y., Tang, S., Li, Y.: Reco: efficient regularization-based coflow scheduling in optical circuit switches. In: ICDCS. IEEE (2019)
Zhang, H., Chen, L., Yi, B., Chen, K., Chowdhury, M., Geng, Y.: CODA: toward automatically identifying and scheduling coflows in the dark. In: SIGCOMM. ACM (2016)
Zhang, T., Ren, F., Bao, J., Shu, R., Cheng, W.: Minimizing coflow completion time in optical circuit switched networks. IEEE Trans. Parallel Distrib. Syst. 32(2), 457–469 (2021). https://doi.org/10.1109/TPDS.2020.3025145
Zhao, Y., et al.: Rapier: integrating routing and scheduling for coflow-aware data center networks. In: INFOCOM. IEEE (2015)
Acknowledgement
This work is supported by Macao Polytechnic University Research Grant RP/FCA-13/2022 and Key-Area Research and Development Plan of Guangdong Province #2020B010164003. The corresponding author is Hong Shen.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Ren, H., Shen, H., Wang, X. (2024). Dynamic Priority Coflow Scheduling in Optical Circuit Switched Networks. In: Park, J.S., Takizawa, H., Shen, H., Park, J.J. (eds) Parallel and Distributed Computing, Applications and Technologies. PDCAT 2023. Lecture Notes in Electrical Engineering, vol 1112. Springer, Singapore. https://doi.org/10.1007/978-981-99-8211-0_20
Download citation
DOI: https://doi.org/10.1007/978-981-99-8211-0_20
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-99-8210-3
Online ISBN: 978-981-99-8211-0
eBook Packages: Computer ScienceComputer Science (R0)