Bing Hu
Orcid: 0000-0002-0594-8998Affiliations:
- Zhejiang University, Hangzhou, PR China
According to our database1,
Bing Hu
authored at least 35 papers
between 2006 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
DGS: An Efficient Delay-Guaranteed Scheduling Framework for Wireless Deterministic Networking.
IEEE Trans. Netw. Serv. Manag., December, 2024
IEEE/ACM Trans. Netw., April, 2024
US-Byte: An Efficient Communication Framework for Scheduling Unequal-Sized Tensor Blocks in Distributed Deep Learning.
IEEE Trans. Parallel Distributed Syst., January, 2024
WBSP: Addressing stragglers in distributed machine learning with worker-busy synchronous parallel.
Parallel Comput., 2024
GWPF: Communication-efficient federated learning with Gradient-Wise Parameter Freezing.
Comput. Networks, 2024
2023
OF-WFBP: A near-optimal communication mechanism for tensor fusion in distributed deep learning.
Parallel Comput., November, 2023
2022
IEEE Trans. Parallel Distributed Syst., 2022
Proceedings of the 23rd IEEE International Conference on High Performance Switching and Routing, 2022
Proceedings of the IEEE Global Communications Conference, 2022
2021
Graph Attention Network-Based Multi-Agent Reinforcement Learning for Slicing Resource Management in Dense Cellular Network.
IEEE Trans. Veh. Technol., 2021
Roulette Wheel Balancing Algorithm With Dynamic Flowlet Switching for Multipath Datacenter Networks.
IEEE/ACM Trans. Netw., 2021
Proceedings of the ICC 2021, 2021
Proceedings of the 22nd IEEE International Conference on High Performance Switching and Routing, 2021
Proceedings of the IEEE Global Communications Conference, 2021
2019
IEEE Trans. Netw. Serv. Manag., 2019
Proceedings of the 89th IEEE Vehicular Technology Conference, 2019
Proceedings of the 2019 IEEE Conference on Computer Communications, 2019
2018
Global Round Robin: Efficient Routing With Cut-Through Switching in Fat-Tree Data Center Networks.
IEEE/ACM Trans. Netw., 2018
Highest Rank First: A New Class of Single-Iteration Scheduling Algorithms for Input-Queued Switches.
IEEE Access, 2018
2016
IEEE/ACM Trans. Netw., 2016
Proceedings of the 2016 IEEE International Conference on Communications, 2016
Proceedings of the 2016 IEEE Global Communications Conference, 2016
2014
J. Netw. Comput. Appl., 2014
Proceedings of the IEEE 15th International Conference on High Performance Switching and Routing, 2014
2013
An efficient single-iteration single-bit request scheduling algorithm for input-queued switches.
J. Netw. Comput. Appl., 2013
2012
Proceedings of IEEE International Conference on Communications, 2012
FTMS: An efficient multicast scheduling algorithm for feedback-based two-stage switch.
Proceedings of the 2012 IEEE Global Communications Conference, 2012
2011
M<sup>2</sup>-CYCLE: An optical layer algorithm for fast link failure detection in all-optical mesh networks.
Comput. Networks, 2011
Minimizing the Communication Overhead of Iterative Scheduling Algorithms for Input-Queued Switches.
Proceedings of the Global Communications Conference, 2011
Proceedings of the Global Communications Conference, 2011
2010
IEEE/ACM Trans. Netw., 2010
Proceedings of IEEE International Conference on Communications, 2010
2007
Proceedings of IEEE International Conference on Communications, 2007
2006
Proceedings of the Global Telecommunications Conference, 2006. GLOBECOM '06, San Francisco, CA, USA, 27 November, 2006