Relevant bibliographies by topics / Crossed hypercube networks

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Conference papers

Academic literature on the topic 'Crossed hypercube networks'

Author: Grafiati
Published: 2 June 2025
Last updated: 31 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Crossed hypercube networks.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Crossed hypercube networks"

1

Yu, Xin, Gao Cai Wang, and Yan Yu. "Internally Vertex-Disjoint Paths in Crossed Cube-Connected Ring Networks." Applied Mechanics and Materials 321-324 (June 2013): 2715–20. http://dx.doi.org/10.4028/www.scientific.net/amm.321-324.2715.

Full text
Abstract:
Crossed cube is a variation of hypercube, but some properties of the former are superior to those of the latter. However, it is difficult to extend the scale of crossed cube networks. As a kind of hierarchical ring interconnection networks, crossed cube-connected ring interconnection network CRN can effectively overcome the disadvantage. Hence, it is a good topology for interconnection networks. In this paper, we prove that there exist n internally vertex-disjoint paths between any two vertexes in CRN, and analyze the lengths of the paths.
APA, Harvard, Vancouver, ISO, and other styles
2

WANG, XINYANG, DEYU QI, and NAQIN ZHOU. "Embedding Strategies of Mesh Network into the Exchanged Crossed Cube." Journal of Interconnection Networks 18, no. 02n03 (2018): 1850011. http://dx.doi.org/10.1142/s0219265918500111.

Full text
Abstract:
The topology of interconnection networks plays an important role in the performance of parallel and distributed computing systems, and the embeddings of interconnection networks can help adapt their topology features into new interconnection network structures. Being a basic and popular structure, the mesh network has wide application range as the result of some of its topology features. Meanwhile, as an important variant of hypercube, the Exchanged Crossed Cube(ECQ) combines advantages of crossed cube and exchanged hypercube, i.e. the promotion of network performance and the reduce of communi
APA, Harvard, Vancouver, ISO, and other styles
3

Lin, Cheng-Kuan, Eddie Cheng, and László Lipták. "Structure and Substructure Connectivity of Hypercube-Like Networks." Parallel Processing Letters 30, no. 03 (2020): 2040007. http://dx.doi.org/10.1142/s0129626420400071.

Full text
Abstract:
The connectivity of a graph [Formula: see text], [Formula: see text], is the minimum number of vertices whose removal disconnects [Formula: see text], and the value of [Formula: see text] can be determined using Menger’s theorem. It has long been one of the most important factors that characterize both graph reliability and fault tolerability. Two extensions to the classic notion of connectivity were introduced recently: structure connectivity and substructure connectivity. Let [Formula: see text] be isomorphic to any connected subgraph of [Formula: see text]. The [Formula: see text]-structure
APA, Harvard, Vancouver, ISO, and other styles
4

Xu, Xirong, Huifeng Zhang, Ziming Wang, Qiang Zhang, and Peng Zhang. "(n − 2)-Fault-Tolerant Edge-Pancyclicity of Crossed Cubes CQn." International Journal of Foundations of Computer Science 32, no. 03 (2021): 289–304. http://dx.doi.org/10.1142/s0129054121500167.

Full text
Abstract:
As one of the most fundamental networks for parallel and distributed computation, cycle is suitable for developing simple algorithms with low communication cost. A graph [Formula: see text] is called [Formula: see text]-fault-tolerant edge-pancyclic if after deleting any faulty set [Formula: see text] of [Formula: see text] vertices and/or edges from [Formula: see text], every correct edge in the resulting graph lies in a cycle of every length from [Formula: see text] to [Formula: see text], inclusively, where [Formula: see text] is the girth of [Formula: see text], the length of a shortest cy
APA, Harvard, Vancouver, ISO, and other styles
5

Liu, Yu-Liang, and Jou-Ming Chang. "Realizing Exchanged Crossed Cube Communication Patterns on Linear Array WDM Optical Networks." International Journal of Foundations of Computer Science 29, no. 06 (2018): 1003–21. http://dx.doi.org/10.1142/s0129054118500181.

Full text
Abstract:
The exchanged crossed cube, denoted by [Formula: see text], is a novel interconnection network with fewer edges and smaller diameter compared to other variations of the corresponding hypercube. The linear array, denoted by [Formula: see text], is one of the most popular topologies in optical networks. This paper addresses the routing and wavelength assignment for realizing [Formula: see text] communication pattern on wavelength division multiplexing (WDM) optical network [Formula: see text], where [Formula: see text]. We prove that the congestion for [Formula: see text] on [Formula: see text]
APA, Harvard, Vancouver, ISO, and other styles
6

Zhang, Yan-Qing. "Folded-crossed hypercube: a complete interconnection network." Journal of Systems Architecture 47, no. 11 (2002): 917–22. http://dx.doi.org/10.1016/s1383-7621(02)00051-6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

CHENG, EDDIE, and SACHIN PADMANABHAN. "MATCHING PRECLUSION AND CONDITIONAL MATCHING PRECLUSION FOR CROSSED CUBES." Parallel Processing Letters 22, no. 02 (2012): 1250005. http://dx.doi.org/10.1142/s0129626412500053.

Full text
Abstract:
The matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings. For many interconnection networks, the optimal sets are precisely those induced by a single vertex. Recently, the conditional matching preclusion number of a graph was introduced to look for obstruction sets beyond those induced by a single vertex. It is defined to be the minimum number of edges whose deletion results in a graph with no isolated vertices that has neither perfect matchings nor almost-perfect matchings. In thi
APA, Harvard, Vancouver, ISO, and other styles
8

Li, Xiaoyan, Hongbin Zhuang, Shuming Zhou, Hongju Cheng, Cheng-Kuan Lin, and Wenzhong Guo. "Reliability Evaluation of Generalized Exchanged X-Cubes Based on the Condition of g-Good-Neighbor." Wireless Communications and Mobile Computing 2020 (May 26, 2020): 1–16. http://dx.doi.org/10.1155/2020/9793082.

Full text
Abstract:
In the cloud computing environment with massive information services and decision-making resources, the accuracy and reliability of information are more important than previous single closed systems. Therefore, ensuring the reliability of information and the stable operation of the system are the core problems in the research fields such as the Internet Plus and the Internet of Things. The connectivity and diagnosability are two important measures for the fault tolerance of multiprocessor systems. The g-good-neighbor conditional connectivity (Rg-connectivity) is the minimum number of nodes tha
APA, Harvard, Vancouver, ISO, and other styles
9

Zerarka, M. F., S. Femmam, and R. Aschheim. "Embedding n-Dimensional Crossed Hypercube into Pancake Graphs." February 7, 2012. https://doi.org/10.5281/zenodo.8728.

Full text
Abstract:
Among Cayley graphs on the symmetric group, the pancake graph is one as a viable interconnection scheme for parallel computers, which has been examined by a number of researchers. The pancake was proposed as alternatives to the hypercube for interconnecting processors in parallel computers. Some good and attractive properties of this interconnection network include: vertex symmetry, small degree, a sub-logarithmic diameter, extendability, and high connectivity (robustness), easy routing, and regularity of topology, fault tolerance, extensibility and embeddability of other topologies. In this p
APA, Harvard, Vancouver, ISO, and other styles
10

Qiao, Hengji, Mingzu Zhang, Wenhuan Ma, and Xing Yang. "An O(log(N)) Algorithm View: Reliability Evaluation of Folded-crossed Hypercube in Terms of h-extra Edge-connectivity." Parallel Processing Letters, February 21, 2023. http://dx.doi.org/10.1142/s0129626423500032.

Full text
Abstract:
An interconnection network can be modelled as a connected graph [Formula: see text]. The reliability of interconnection networks is critical for multiprocessor systems. Several conditional edge-connectivities have been introduced in the past for accurately reflecting various realistic network situations, with the [Formula: see text]-extra edge-connectivity being one such conditional edge-connectivity. The [Formula: see text]-extra edge-connectivity of [Formula: see text], denoted by [Formula: see text], is the minimum cardinality of faulty edges whose deletion disconnects the graph [Formula: s
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Crossed hypercube networks"

1

Li, K., Y. Mu, K. Li, and Geyong Min. "Exchanged Crossed Cube: A Novel Interconnection Network for Parallel Computation." 2013. http://hdl.handle.net/10454/9679.

Full text
Abstract:
The topology of interconnection networks plays a key role in the performance of parallel computing systems. A new interconnection network called exchanged crossed cube (ECQ) is proposed and analyzed in this paper. We prove that ECQ has the better properties than other variations of the basic hypercube in terms of the smaller diameter, fewer links, and lower cost factor, which indicates the reduced communication overhead, lower hardware cost, and more balanced consideration among performance and cost. Furthermore, it maintains several attractive advantages including recursive structure, high pa
APA, Harvard, Vancouver, ISO, and other styles
2

(8300103), Shams R. Rahmani. "Digital Soil Mapping of the Purdue Agronomy Center for Research and Education." Thesis, 2020.

Find full text
Abstract:
This research work concentrate on developing digital soil maps to support field based plant phenotyping research. We have developed soil organic matter content (OM), cation exchange capacity (CEC), natural soil drainage class, and tile drainage line maps using topographic indices and aerial imagery. Various prediction models (universal kriging, cubist, random forest, C5.0, artificial neural network, and multinomial logistic regression) were used to estimate the soil properties of interest.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Crossed hypercube networks"

1

Ray, B. N. B., and Alok Ranjan Tripathy. "Extended Hypercube with Cross-Connection - A New Interconnection Fault Tolerant Network for Parallel Computers." In 2009 IEEE International Advance Computing Conference (IACC 2009). IEEE, 2009. http://dx.doi.org/10.1109/iadcc.2009.4809064.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Choi, Kwang-Jin, Jin-Hyuk Kim, and Kwang-Yong Kim. "Design Optimization of Circumferential Casing Grooves for a Transonic Axial Compressor to Enhance Stall Margin." In ASME Turbo Expo 2010: Power for Land, Sea, and Air. ASMEDC, 2010. http://dx.doi.org/10.1115/gt2010-22396.

Full text
Abstract:
This paper presents a design optimization of an axial compressor with NASA Rotor 37 and five circumferential casing grooves for enhancement of stall margin. Three-dimensional Reynolds-averaged Navier-Stokes equations with the shear stress transport turbulence model are discretized by finite volume approximations and solved on hexahedral grids for the flow analyses. The validation of the numerical results is performed in comparison with experimental data for pressure ratio and adiabatic efficiency. The Latin-hypercube sampling as design-of-experiments is used to generate the twelve design point
APA, Harvard, Vancouver, ISO, and other styles
3

Hendrick, W. Lee, Philippe J. Marchand, Frederick B. McCormick, Ilkan Çokgör, and Sadik C. Esener. "Optical Transpose Interconnection System: System Design and Component Development." In Optical Computing. Optica Publishing Group, 1995. http://dx.doi.org/10.1364/optcomp.1995.othb4.

Full text
Abstract:
The optical transpose interconnection system1 (OTIS) is a simple means of providing a transpose interconnection using only a pair of lenslet arrays. This system has been shown useful for shuffle based multi-stage interconnection networks, mesh-of-trees matrix processors, and hypercube interconnections. The transpose interconnection is a one-to-one interconnection between L transmitters and L receivers, where L is the product of two integers, M and N. To implement the interconnection a N×N array of lenslets is placed in front of the input plane, and a M×M array of lenslets is located before the
APA, Harvard, Vancouver, ISO, and other styles
4

Kim, Jin-Hyuk, Jae-Ho Choi, Afzal Husain, and Kwang-Yong Kim. "Design Optimization of a Centrifugal Compressor Impeller by Multi-Objective Genetic Algorithm." In ASME 2009 Fluids Engineering Division Summer Meeting. ASMEDC, 2009. http://dx.doi.org/10.1115/fedsm2009-78486.

Full text
Abstract:
This paper presents design optimization of a centrifugal compressor impeller with hybrid multi-objectives evolutionary algorithm (hybrid MOEA). Reynolds-averaged Navier-Stokes equations with shear stress transport turbulence model are discretized by finite volume approximations and solved on hexahedral grids for flow analyses. Latin hypercube sampling of design of experiments is used to generate design points within the selected design space. Two objectives, i.e., isentropic efficiency and total pressure ratio are selected with four design variables defining impeller hub and shroud contours in
APA, Harvard, Vancouver, ISO, and other styles
5

Amouzgar, Kaveh, Asim Rashid, and Niclas Stromberg. "Multi-Objective Optimization of a Disc Brake System by Using SPEA2 and RBFN." In ASME 2013 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2013. http://dx.doi.org/10.1115/detc2013-12809.

Full text
Abstract:
Many engineering design optimization problems involve multiple conflicting objectives, which today often are obtained by computational expensive finite element simulations. Evolutionary multi-objective optimization (EMO) methods based on surrogate modeling is one approach of solving this class of problems. In this paper, multi-objective optimization of a disc brake system to a heavy truck by using EMO and radial basis function networks (RBFN) is presented. Three conflicting objectives are considered. These are: 1) minimizing the maximum temperature of the disc brake, 2) maximizing the brake en
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Crossed hypercube networks' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography