7 citations · 24 across the 7 of their papers we have counts for
7 papers
Optimal circulant graphs as low-latency network topologies
Xiaolong Huang, Alexandre F. Ramos, Yuefan Deng
Communication latency has become one of the determining factors for the performance of parallel clusters. To design low-latency network topologies for high-performance computing cl…
A Structured Table of Graphs with Symmetries and Other Special Properties
Yidan Zhang, Xiaolong Huang, Zhipeng Xu +1
We organize a table of regular graphs with minimal diameters and minimal mean path lengths, large bisection widths and high degrees of symmetries, obtained by enumerations on super…
Load-balanced Routing for Nested Interconnection Networks
Zhipeng Xu, Xiaolong Huang, Yuefan Deng
We introduced the load-balanced routing algorithms, for interconnection networks resulting from nesting, by considering the pressure of the data forwarding in each node. Benchmarks…
A new record of graph enumeration enabled by parallel processing
Zhipeng Xu, Xiaolong Huang, Fabian Jimenez +1
Using three supercomputers, we broke a record set in 2011, in the enumeration of non-isomorphic regular graphs by expanding the sequence of A006820 in Online Encyclopedia of Intege…
Optimal Low-Latency Network Topologies for Cluster Performance Enhancement
Yuefan Deng, Meng Guo, Alexandre F. Ramos +3
We propose that clusters interconnected with network topologies having minimal mean path length will increase their overall performance for a variety of applications. We approach o…
Oriented diameter and rainbow connection number of a graph
Xiaolong Huang, Hengzhe Li, Xueliang Li +1
The oriented diameter of a bridgeless graph is . A path in an edge-colored graph , where adjacent edges may have the same co…
Rainbow connections for planar graphs and line graphs
Xiaolong Huang, Xueliang Li, Yongtang Shi
An edge-colored graph is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection number of a connected graph ,…