Zobrazeno 1 - 10
of 38
pro vyhledávání: '"Hong-Chun Hsu"'
Autor:
Hong-Chun Hsu, 許弘駿
92
Interconnection networks have been an important research topic for parallel and distributed computer systems. We usually use a graph $G=(V,E)$ to represent a network''s topology where vertices represent processors and edges represent links be
Interconnection networks have been an important research topic for parallel and distributed computer systems. We usually use a graph $G=(V,E)$ to represent a network''s topology where vertices represent processors and edges represent links be
Externí odkaz:
http://ndltd.ncl.edu.tw/handle/79351246812601427064
Autor:
Hong-Chun Hsu, 許弘駿
87
A path with v0!=vm that includes all vertices of G is called a hamiltonian path. A graph G is called a hamiltonian connected if there exists a hamiltonian path joining any two different vertices in G. A hamiltonian connected graph is optimal
A path with v0!=vm that includes all vertices of G is called a hamiltonian path. A graph G is called a hamiltonian connected if there exists a hamiltonian path joining any two different vertices in G. A hamiltonian connected graph is optimal
Externí odkaz:
http://ndltd.ncl.edu.tw/handle/05998463084561555686
Publikováno v:
Parallel Processing Letters. 32
Balanced hypercube is a variant of the hypercube structure; it offers desirable properties such as connectivity, diameter, and fault-tolerance. Cycles and tori are popular interconnection topologies and have been widely used in distributed-memory par
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::71f6ee83e971054f45fbb01431d5b20d
https://doi.org/10.1142/s0129626422500025
https://doi.org/10.1142/s0129626422500025
Publikováno v:
IEEE Transactions on Computers. 63:2894-2904
In microprocessor-based systems, such as the cloud computing infrastructure, high reliability is essential. As multiprocessor systems become more widespread and increasingly complex, system-level diagnosis will increasingly be adopted to determine th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ca3feb0f33b16fe10408f8a6ac0d8c73
https://doi.org/10.1109/tc.2013.172
https://doi.org/10.1109/tc.2013.172
Publikováno v:
Applied Mechanics and Materials. :2047-2050
The twisted cubeTQnis an alternative to the popular hypercube network and some interesting properties of aTQnwere investigated recently. The problem of how to embed paths into a host graph has attracted a great attention in recent years. However, the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a92ec371bda505bf0cafd0f0aad30c4b
https://doi.org/10.4028/www.scientific.net/amm.411-414.2047
https://doi.org/10.4028/www.scientific.net/amm.411-414.2047
Publikováno v:
Information Sciences. 187:291-297
Diagnosis of reliability is an important topic for interconnection networks. Under the classical PMC model, Dahura and Masson [5] proposed a polynomial time algorithm with time complexity O(N^2^.^5) to identify all faulty nodes in an N-node network.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1067a9846d0857abed91e05bf10ea063
https://doi.org/10.1016/j.ins.2011.10.022
https://doi.org/10.1016/j.ins.2011.10.022
Publikováno v:
Information Sciences. 180:5090-5100
The torus is a popular interconnection topology and several commercial multicomputers use a torus as the basis of their communication network. Moreover, there are many parallel algorithms with torus-structured and mesh-structured task graphs have bee
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3e6fe0ce38518eed016165c38f584ce5
https://doi.org/10.1016/j.ins.2010.08.029
https://doi.org/10.1016/j.ins.2010.08.029
Publikováno v:
Theoretical computer science, 2010, Vol.411(31-33), pp.2912-2924 [Peer Reviewed Journal]
We study some topological and algorithmic properties of a recently defined hierarchical interconnection network, the hierarchical crossed cube HCC(k,n), which draws upon constructions used within the well-known hypercube and also the crossed cube. In
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::87973e4efff60f56607f17e0dd101bad
https://doi.org/10.1016/j.tcs.2010.04.022
https://doi.org/10.1016/j.tcs.2010.04.022
Autor:
Hong-Chun Hsu, Pao-Lien Lai
Publikováno v:
Information Sciences. 179:2487-2493
A graph G is panconnected if each pair of distinct vertices u,v@?V(G) are joined by a path of length l for all d"G(u,v)=
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2656097e56d391ce04c63ab832d18667
https://doi.org/10.1016/j.ins.2009.02.018
https://doi.org/10.1016/j.ins.2009.02.018
Publikováno v:
Discrete Mathematics. 309:1931-1946
A k-containerC(x,y) in a graph G=(V,E) is a set of k internally node-disjoint paths between vertices x and y. A k^*-containerC(x,y) of G is a k-container such that every vertex of G is incident with a certain path in C(x,y). A bipartite graph G=(B@?W
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5bcf0a0ddbe7b69c816a32a7cd6cc695
https://doi.org/10.1016/j.disc.2008.03.015
https://doi.org/10.1016/j.disc.2008.03.015