Edge-disjoint Hamiltonian cycles, abbreviated as EDHCs, provide multiple edge-disjoint communication paths for data broadcasting, which greatly enhance the reliability and fault tolerance of data transmission. The complete Josephus cube $CJ{C}_n$ possesses many desirable properties as a typical interconnection network. In this paper, we focus on the construction of EDHCs in $CJ{C}_n$. We prove that there exist two EDHCs in $CJ{C}_n$ when $n\ge 3$, and three EDHCs in $CJ{C}_n$ when $n\ge 4$.

The 3-ary n-cube, denoted as $Q_n^3$, is an important interconnection network topology proposed for parallel computers, owing to its many desirable properties such as regular and symmetrical structure, and strong scalability, among others. In this paper, we first obtain an exact formula for the minimum wirelength to embed $Q_n^3$ into grids. We then propose a load balancing algorithm for embedding $Q_n^3$ into a square grid with minimum dilation and congestion. Finally, we derive an O(N²) algorithm for embedding $Q_n^3$ into a gird with balanced communication, where N is the number of nodes in $Q_n^3$. Simulation experiments are performed to verify the total wirelength and evaluate the network cost of our proposed embedding algorithm.