Results 131 to 140 of about 2,664 (165)
The h-edge tolerable diagnosability of balanced hypercubes [PDF]
Theoretical Computer Science, 2019 15 pages, 6 figures. This article was submitted to Theoretical Computer Science on February 1st, 2019.
Min Xu
exaly +4 more sources
Some of the next articles are maybe not open access.
A balanced bin sort for hypercube multicomputers
The Journal of Supercomputing, 1988We propose a balanced bin sort for hypercube multicomputers. This sorting algorithm has an empirically measured expected run time that is greater than that of hyperquicksort but less than that of bitonic sort. Also, its space requirements are less than that of hyperquicksort but more than that of bitonic sort.
Youngju Won, Sartaj Sahni
openaire +1 more source
Super connectivity of balanced hypercubes
Applied Mathematics and Computation, 2012zbMATH Open Web Interface contents unavailable due to conflicting licenses.
exaly +3 more sources
Edge-disjoint Hamiltonian cycles of balanced hypercubes
Information Processing Letters, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Huazhong Lu, Tingzeng Wu
exaly +2 more sources
Feedback Numbers of Balanced Hypercubes BH_n
2018 14th International Conference on Computational Intelligence and Security (CIS), 2018A subset of vertices of a graph G is called a feedback vertex set of G if its removal results in an acyclic subgraph. We use f(BHn) to denote the feedback number of balanced hypercubes BHn. In this paper, we construct a feedback vertex set of BHn and obtain ⌜2^2^n-1) (1-1/(2n-1)+1/2n-1 ⌝ ≤ f(BH_n ) ≤ 2^2^n-1- 2^n-1 for n ≤ 3 and ⌜2^2^n-1) (1-1/(2n-1)+1/
Sijia Zhang, Xinyue Zhang, Yijin Wang
openaire +1 more source
Edge-pancyclicity and Hamiltonian laceability of the balanced hypercubes
Applied Mathematics and Computation, 2007Balanced hypercubes has better properties that hypercube with same number of links and processors. This papers contains results showing that balanced hypercube is edge-pancyclic, also showing that balanced hypercubes are Hamiltonian laceable.
Min Xu, Jun-Ming Xu
exaly +3 more sources
Hypercube Dynamic Load Balancing
Proceedings of the Fifth Distributed Memory Computing Conference, 1990., 2005This paper reports on the results of a preliminary study in dynamic load balancing on an Intel Hypercube. The purpose of this research is to provide experimental data in how parallel algorithms should be constructed to obtain maximal utilization of a parallel architecture. This study is one aspect of an ongoing research project into the construction of
D. King, E.J. Wegman
openaire +1 more source
Two node-disjoint paths in balanced hypercubes
Applied Mathematics and Computation, 2014zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dongqin Cheng +2 more
exaly +2 more sources
Reliability analysis of balanced hypercubes
2012 Computing, Communications and Applications Conference, 2012The hypercube is a popular interconnection network for multiprocessor systems. The balanced hypercube, denoted by BH n , is a variant of the hypercube network. The balanced hypercube reserves some properties of the hypercube and enhances some other properties of it as well. For a multiprocessor system, the reliability of an interconnection network is a
Ming-Chien Yang, Ming-Hour Yang
openaire +1 more source
Complexity of intensive communications on balanced generalized hypercubes
[1993] Proceedings Seventh International Parallel Processing Symposium, 2002Lower bound complexities are derived for three intensive communication patterns assuming a balanced generalized hypercube (BGHC) topology. The BGHC is a generalized hypercube that has exactly w nodes along each of the d dimensions for a total of w/sup d/ nodes.
John K. Antonio +2 more
openaire +1 more source