Shietung Peng

Int. J. High Perform. Comput. Netw., 2015

2012

Hierarchical Dual-Net: A Flexible Interconnection Network and its Routing Algorithm.

[BibT_eX]

[DOI]

Int. J. Netw. Comput., 2012

2011

Node-to-set disjoint-path routing in perfect hierarchical hypercubes.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Computational Science, 2011

Parallel Prefix Computation and Sorting on a Recursive Dual-Net.

[BibT_eX]

[DOI]

J. Inf. Process. Syst., 2011

Node-to-Set Disjoint-Paths Routing in Recursive Dual-Net.

[BibT_eX]

[DOI]

Int. J. Netw. Comput., 2011

Disjoint-Paths and Fault-Tolerant Routing on Recursive Dual-Net.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2011

A New Node-to-Set Disjoint-Path Algorithm in Perfect Hierarchical Hypercubes.

[BibT_eX]

[DOI]

Comput. J., 2011

Finding a Hamiltonian Cycle in a Hierarchical Dual-Net with Base Network of p -Ary q -Cube.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Architectures for Parallel Processing, 2011

Set-to-Set Disjoint-Paths Routing in Recursive Dual-Net.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Architectures for Parallel Processing, 2011

2010

Metacube - a versatile family of interconnection networks for extremely large-scale supercomputers.

[BibT_eX]

[DOI]

J. Supercomput., 2010

Set-to-Set Disjoint-Path Routing in Metacube.

[BibT_eX]

[DOI]

Proceedings of the 2010 International Conference on Parallel and Distributed Computing, 2010

Parallel Sorting on Recursive Dual-Nets.

[BibT_eX]

[DOI]

Proceedings of the 2010 International Conference on Parallel and Distributed Computing, 2010

Parallel Prefix Computation in the Recursive Dual-Net.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Architectures for Parallel Processing, 2010

Fault-Tolerant Node-to-Set Disjoint-Path Routing in Hypercubes.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Architectures for Parallel Processing, 2010

Collective Communication in Recursive Dual-Net: An Interconnection Network for High-Performance Parallel Computer Systems of the Next Generation.

[BibT_eX]

[DOI]

Proceedings of the 10th IEEE International Conference on Computer and Information Technology, 2010

2009

Optimal Algorithms for Finding a Trunk on a Tree Network and its Applications.

[BibT_eX]

[DOI]

Comput. J., 2009

Node-to-Set Disjoint-path Routing in Metacube.

[BibT_eX]

[DOI]

Proceedings of the 2009 International Conference on Parallel and Distributed Computing, 2009

A Node-to-Set Disjoint-Path Routing Algorithm in Metacube.

[BibT_eX]

[DOI]

Proceedings of the 10th International Symposium on Pervasive Systems, 2009

Recursive Dual-Net: A New Universal Network for Supercomputers of the Next Generation.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Architectures for Parallel Processing, 2009

An Efficient Parallel Sorting Algorithm on Metacube Multiprocessors.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Architectures for Parallel Processing, 2009

The Recursive Dual-Net and Its Applications.

[BibT_eX]

[DOI]

Proceedings of the Advanced Parallel Processing Technologies, 8th International Symposium, 2009

Hamiltonian Connectedness of Recursive Dual-Net.

[BibT_eX]

[DOI]

Proceedings of the Ninth IEEE International Conference on Computer and Information Technology, 2009

2008

An Effective Structure for Algorithmic Design and a Parallel Prefix Algorithm on Metacube.

[BibT_eX]

[DOI]

Proceedings of the Ninth International Conference on Parallel and Distributed Computing, 2008

Set-to-Set Disjoint Paths Routing in Dual-Cubes.

[BibT_eX]

[DOI]

Proceedings of the Ninth International Conference on Parallel and Distributed Computing, 2008

K-Tree Trunk and a Distributed Algorithm for Effective Overlay Multicast on Mobile Ad Hoc Networks.

[BibT_eX]

[DOI]

Proceedings of the 9th International Symposium on Parallel Architectures, 2008

Node-to-Set Disjoint Paths Routing in Dual-Cube.

[BibT_eX]

[DOI]

Proceedings of the 9th International Symposium on Parallel Architectures, 2008

Prefix Computation and Sorting in Dual-Cube.

[BibT_eX]

[DOI]

Proceedings of the 2008 International Conference on Parallel Processing, 2008

K-Trunk and Efficient Algorithms for Finding a K-Trunk on a Tree Network.

[BibT_eX]

[DOI]

Proceedings of the 41st Hawaii International International Conference on Systems Science (HICSS-41 2008), 2008

A Distributed Algorithm for Finding a Tree Trunk and its Application for Multicast in Mobile Ad Hoc Networks.

[BibT_eX]

[DOI]

Proceedings of the 22nd International Conference on Advanced Information Networking and Applications, 2008

2007

Pairwise Disjoint Paths in Pancake Graphs.

[BibT_eX]

[DOI]

Naoki Sawada

Proceedings of the Eighth International Conference on Parallel and Distributed Computing, 2007

Efficient Algorithms for Finding a Trunk on a Tree Network and Its Applications.

[BibT_eX]

[DOI]

Proceedings of the Eighth International Conference on Parallel and Distributed Computing, 2007

An Algorithm for Constructing Hamiltonian Cycle in Metacube Networks.

[BibT_eX]

[DOI]

Proceedings of the Eighth International Conference on Parallel and Distributed Computing, 2007

A Node-to-set cluster-fault-tolerant disjoint routing algorithm in pancake graphs.

[BibT_eX]

Tatsuro Watanabe

Proceedings of the ISCA 20th International Conference on Parallel and Distributed Computing Systems, 2007

2006

Efficient algorithms for a constrained k-tree core problem in a tree network.

[BibT_eX]

[DOI]

J. Algorithms, 2006

K-MCore for Multicasting on Mobile Ad Hoc Networks.

[BibT_eX]

[DOI]

Proceedings of the Seventh International Conference on Parallel and Distributed Computing, 2006

Disjoint Paths Routing in Pancake Graphs.

[BibT_eX]

[DOI]

Proceedings of the Seventh International Conference on Parallel and Distributed Computing, 2006

An Efficient Algorithm for Finding an Almost Connected Dominating Set of Small Size on Wireless Ad Hoc Networks.

[BibT_eX]

[DOI]

Proceedings of the IEEE 3rd International Conference on Mobile Adhoc and Sensor Systems, 2006

2005

Fault-tolerant cycle embedding in dual-cube with node faults.

[BibT_eX]

[DOI]

Int. J. High Perform. Comput. Netw., 2005

An Efficient Distributed Broadcasting Algorithm forWireless Ad Hoc Networks.

[BibT_eX]

[DOI]

Proceedings of the Sixth International Conference on Parallel and Distributed Computing, 2005

Online Adaptive Fault-Tolerant Routing in 2D Torus.

[BibT_eX]

[DOI]

Proceedings of the Parallel and Distributed Processing and Applications, 2005

Adaptive Box-Based Efficient Fault-tolerant Routing in 3D Torus.

[BibT_eX]

[DOI]

Proceedings of the 11th International Conference on Parallel and Distributed Systems, 2005

2004

Efficient Collective Communications in Dual-Cube.

[BibT_eX]

[DOI]

J. Supercomput., 2004

Fault-tolerant cycle embedding in hypercube with mixed link and node failures.

[BibT_eX]

Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Networks, 2004

An Efficient Algorithm for Fault Tolerant Routing Based on Adaptive Binomial-Tree Technique in Hypercubes.

[BibT_eX]

[DOI]

Proceedings of the Parallel and Distributed Computing: Applications and Technologies, 2004

Binomial-Tree Fault Tolerant Routing in Dual-Cubes with Large Number of Faulty Nodes.

[BibT_eX]

[DOI]

Proceedings of the Computational and Information Science, First International Symposium, 2004

Adaptive-Subcube Fault Tolerant Routing in Dual-Cube with Very Large Number of Faulty Nodes.

[BibT_eX]

Proceedings of the ISCA 17th International Conference on Parallel and Distributed Computing Systems, 2004

2003

Multihop All-to-All Broadcast on WDM Optical Networks.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 2003

2002

Efficient Communication in Metacube: A New Interconnection Network.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Parallel Architectures, 2002

From Dual-Cube to Metacube: Efficient Low-Degree Alternatives to Hypercube.

[BibT_eX]

[DOI]

Proceedings of the 1st International Symposium on Cyber Worlds (CW 2002), 2002

2001

Multi-hop All-to-All Broadcast on WDM Optical Networks.

[BibT_eX]

[DOI]

Proceedings of the 30th International Workshops on Parallel Processing (ICPP 2001 Workshops), 2001

Fault-Tolerant Routing and Disjoint Paths in Dual-Cube: A New Interconnection Network.

[BibT_eX]

[DOI]

Proceedings of the Eigth International Conference on Parallel and Distributed Systems, 2001

2000

Cluster fault-tolerant routing in star graphs.

[BibT_eX]

[DOI]

Networks, 2000

An Efficient Algorithm for the k-Pairwise Disjoint Paths Problem in Hypercubes.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2000

Wavelengths Requirement for Permutation Routing in All-Optical Multistage Interconnection Networks.

[BibT_eX]

[DOI]

Proceedings of the 14th International Parallel & Distributed Processing Symposium (IPDPS'00), 2000

Efficient Protocols for Permutation Routing on All-Optical Multistage Interconnection Networks.

[BibT_eX]

[DOI]

Proceedings of the 2000 International Conference on Parallel Processing, 2000

Design of Multi-dimensional DCT Array Processors for Video Applications.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2000, Parallel Processing, 6th International Euro-Par Conference, Munich, Germany, August 29, 2000

1999

Unicast in Hypercubes with Large Number of Faulty Nodes.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 1999

A 2-Approximation Algorithm for Genome Rearrangements by Reversals and Transpositions.

[BibT_eX]

[DOI]

Ivan Hal Sudborough

Theor. Comput. Sci., 1999

Design Of I/O Efficient, Scalable Array Processors for Multi-dimensional DFT.

[BibT_eX]

Hiroshi Nagata

Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 1999

A new scalable array processor for two-dimensional discrete Fourier transform.

[BibT_eX]

Hiroshi Nagata

Proceedings of the Parallel Computing: Fundamentals & Applications, 1999

1998

Node-to-Set and Set-to-Set Cluster Fault Tolerant Routing in Hypercubes.

[BibT_eX]

[DOI]

Parallel Comput., 1998

An Efficient Algorithm for k-Pairwise Disjoint Paths in Star Graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1998

Cluster Fault Tolerant Routing in Hypercubes.

[BibT_eX]

[DOI]

Proceedings of the 1998 International Conference on Parallel Processing (ICPP '98), 1998

Routing in Hypercubes with Large Number of Faulty Nodes.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Parallel and Distributed Systems, 1998

1997

k-Pairwise Cluster Fault Tolerant Routing in Hypercubes.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1997

Node-To-Set Disjoint Paths Problem in Star Graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1997

Node-to-Node Cluster Fault Tolerant Routing in Hypercubes.

[BibT_eX]

[DOI]

Proceedings of the 1997 International Symposium on Parallel Architectures, 1997

1996

Fault Tolerant Routing in Hypercubes and Star Graphs.

[BibT_eX]

[DOI]

Parallel Process. Lett., 1996

Efficient Algorithms for Finding a Core of a Tree with a Specified Length.

[BibT_eX]

[DOI]

J. Algorithms, 1996

Array Processors Design for Division-free Linear System Solving.

[BibT_eX]

[DOI]

Comput. J., 1996

An Efficient Algorithm for Node-to-Node Routing in Hypercubes with Faulty Clusters.

[BibT_eX]

[DOI]

Comput. J., 1996

Optimal Algorithms for Node-to-Node Fault Tolerant Routing in Hypercubes.

[BibT_eX]

[DOI]

Comput. J., 1996

An efficient algorithm for set-to-set node-disjoint paths problem in hypercubes.

[BibT_eX]

[DOI]

Proceedings of the 1996 International Conference on Parallel and Distributed Systems (ICPADS '96), 1996

Parallel Algorithm And Architecture For Two-Step Division-Free Gaussian Elimination.

[BibT_eX]

[DOI]

Igor S. Sedukhin

Proceedings of the 1996 International Conference on Application-Specific Systems, 1996

1995

Node-to-Node Cluster Fault Tolerant Routing in Star Graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1995

Linear Time Algorithms for Fault Tolerant Routing in Hypercubes and Star Graphs.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 1995

An efficient algorithm for k-pairwise node disjoint path problem in hypercubes.

[BibT_eX]

[DOI]

Proceedings of the Seventh IEEE Symposium on Parallel and Distributed Processing, 1995

Finding a Routing Path of Optimal Length in Hypercubes with Fault Clusters.

[BibT_eX]

Proceedings of the Seventh IASTED/ISMM International Conference on Parallel and Distributed Computing and Systems, 1995

1994

The Optimal Location of a Structured Facility in a Tree Network.

[BibT_eX]

[DOI]

Parallel Algorithms Appl., 1994

A Simple Optimal Parallel Algorithm for a Core of a Tree.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 1994

Advanced fault tolerant routing in hypercubes.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Parallel Architectures, 1994

Algorithms for Node Disjoint Paths in Incomplete Star Networks.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 1994 International Conference on Parallel and Distributed Systems, 1994

Parallel Algorithms for K-tree Recognition and its Applications.

[BibT_eX]

Proceedings of the 27th Annual Hawaii International Conference on System Sciences (HICSS-27), 1994

1993

Algorithms for a Core and k-Tree Core of a Tree.

[BibT_eX]

[DOI]

A. B. Stephens

Yelena Yesha

J. Algorithms, 1993

1992

An Optimal Parallel Algorithm for a Core of a Tree.

[BibT_eX]

Proceedings of the 1992 International Conference on Parallel Processing, 1992

Algorithms for a K-Tree Core of a Tree.

[BibT_eX]

A. B. Stephens

Yelena Yesha

Proceedings of the Computing and Information, 1992

1991

Parallel algorithms for finding connected, independent and total domination in interval graphs.

[BibT_eX]

Proceedings of the Algorithms and Parallel VLSI Architectures II, 1991

1990

Parallel Algorithms for Cographs and Parity Graphs with Applications.

[BibT_eX]

[DOI]

J. Algorithms, 1990

Parallel Algorithms for Path Covering, Hamiltonian Path and Hamiltonian Cycle in Cographs.

[BibT_eX]

Proceedings of the 1990 International Conference on Parallel Processing, 1990

1989

Parallel Algorithms for Cographs Recognition and Applications.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 1989

1987

Compression Trees and Their Applications.

[BibT_eX]

Simeon C. Ntafos

Proceedings of the International Conference on Parallel Processing, 1987

1986

Optimal parallel algorithms for constructing and maintaining a balancedm-way search tree.

[BibT_eX]

[DOI]

S. Sitharma Lyengar

Int. J. Parallel Program., 1986

Optimal Parallel Algorithms for Constructing Balanced m-Way Search Tree.

[BibT_eX]

Shietung Iyengar

Proceedings of the International Conference on Parallel Processing, 1986

Parallel Tree Techniques and Code Optimization.

[BibT_eX]

[DOI]

Simeon C. Ntafos