Shietung Peng

Publication Activity (10 Years)

Years Active: 1986-2015
Publications (10 Years): 0

Top Topics

Undirected Graph

Routing Algorithm

Network On Chip

Top Venues

Int. J. High Perform. Comput. Netw.

Int. J. Netw. Comput.

Publications

Antoine Bossard, Keiichi Kaneko, Shietung Peng
Node-to-set disjoint paths routing in a metacube. Int. J. High Perform. Comput. Netw. 8 (4) (2015)
Yamin Li, Shietung Peng, Wanming Chu
Hierarchical Dual-Net: A Flexible Interconnection Network and its Routing Algorithm. Int. J. Netw. Comput. 2 (2) (2012)
Yamin Li, Shietung Peng, Wanming Chu
Node-to-Set Disjoint-Paths Routing in Recursive Dual-Net. Int. J. Netw. Comput. 1 (2) (2011)
Yamin Li, Shietung Peng, Wanming Chu
Parallel Prefix Computation and Sorting on a Recursive Dual-Net. J. Inf. Process. Syst. 7 (2) (2011)
Antoine Bossard, Keiichi Kaneko, Shietung Peng
A New Node-to-Set Disjoint-Path Algorithm in Perfect Hierarchical Hypercubes. Comput. J. 54 (8) (2011)
Antoine Bossard, Keiichi Kaneko, Shietung Peng
Node-to-set disjoint-path routing in perfect hierarchical hypercubes. ICCS (2011)
Yamin Li, Shietung Peng, Wanming Chu
Disjoint-Paths and Fault-Tolerant Routing on Recursive Dual-Net. Int. J. Found. Comput. Sci. 22 (5) (2011)
Yamin Li, Shietung Peng, Wanming Chu
Hierarchical Dual-Net: A Flexible Interconnection Network and Its Routing Algorithm. ICNC (2011)
Yamin Li, Shietung Peng, Wanming Chu
Set-to-Set Disjoint-Paths Routing in Recursive Dual-Net. ICA3PP (1) (2011)
Yamin Li, Shietung Peng, Wanming Chu
Finding a Hamiltonian Cycle in a Hierarchical Dual-Net with Base Network of p -Ary q -Cube. ICA3PP (1) (2011)
Yamin Li, Shietung Peng, Wanming Chu
Parallel Prefix Computation in the Recursive Dual-Net. ICA3PP (1) (2010)
Yamin Li, Shietung Peng, Wanming Chu
Parallel Sorting on Recursive Dual-Nets. PDCAT (2010)
Antoine Bossard, Keiichi Kaneko, Shietung Peng
Fault-Tolerant Node-to-Set Disjoint-Path Routing in Hypercubes. ICA3PP (1) (2010)
Yamin Li, Shietung Peng, Wanming Chu
Metacube - a versatile family of interconnection networks for extremely large-scale supercomputers. J. Supercomput. 53 (2) (2010)
Yamin Li, Shietung Peng, Wanming Chu
Node-to-Set Disjoint-Paths Routing in Recursive Dual-Net. ICNC (2010)
Shietung Peng, Keiichi Kaneko
Set-to-Set Disjoint-Path Routing in Metacube. PDCAT (2010)
Yamin Li, Shietung Peng, Wanming Chu
Collective Communication in Recursive Dual-Net: An Interconnection Network for High-Performance Parallel Computer Systems of the Next Generation. CIT (2010)
Yamin Li, Shietung Peng, Wanming Chu
An Efficient Parallel Sorting Algorithm on Metacube Multiprocessors. ICA3PP (2009)
Yamin Li, Shietung Peng, Wanming Chu
Optimal Algorithms for Finding a Trunk on a Tree Network and its Applications. Comput. J. 52 (2) (2009)
Antoine Bossard, Keiichi Kaneko, Shietung Peng
Node-to-Set Disjoint-path Routing in Metacube. PDCAT (2009)
Antoine Bossard, Keiichi Kaneko, Shietung Peng
A Node-to-Set Disjoint-Path Routing Algorithm in Metacube. ISPAN (2009)
Yamin Li, Shietung Peng, Wanming Chu
The Recursive Dual-Net and Its Applications. APPT (2009)
Yamin Li, Shietung Peng, Wanming Chu
Recursive Dual-Net: A New Universal Network for Supercomputers of the Next Generation. ICA3PP (2009)
Yamin Li, Shietung Peng, Wanming Chu
Disjoint-Paths and Fault-Tolerant Routing on Recursive Dual-Net. PDCAT (2009)
Yamin Li, Shietung Peng, Wanming Chu
Hamiltonian Connectedness of Recursive Dual-Net. CIT (1) (2009)
Yamin Li, Shietung Peng, Wanming Chu
K-Trunk and Efficient Algorithms for Finding a K-Trunk on a Tree Network. HICSS (2008)
Keiichi Kaneko, Shietung Peng
Node-to-Set Disjoint Paths Routing in Dual-Cube. ISPAN (2008)
Yamin Li, Shietung Peng, Wanming Chu
An Effective Structure for Algorithmic Design and a Parallel Prefix Algorithm on Metacube. PDCAT (2008)
Yamin Li, Shietung Peng, Wanming Chu
K-Tree Trunk and a Distributed Algorithm for Effective Overlay Multicast on Mobile Ad Hoc Networks. ISPAN (2008)
Yamin Li, Shietung Peng, Wanming Chu
A Distributed Algorithm for Finding a Tree Trunk and its Application for Multicast in Mobile Ad Hoc Networks. AINA (2008)
Keiichi Kaneko, Shietung Peng
Set-to-Set Disjoint Paths Routing in Dual-Cubes. PDCAT (2008)
Yamin Li, Shietung Peng, Wanming Chu
Prefix Computation and Sorting in Dual-Cube. ICPP (2008)
Yamin Li, Shietung Peng, Wanming Chu
Efficient Algorithms for Finding a Trunk on a Tree Network and Its Applications. PDCAT (2007)
Naoki Sawada, Keiichi Kaneko, Shietung Peng
Pairwise Disjoint Paths in Pancake Graphs. PDCAT (2007)
Tatsuro Watanabe, Keiichi Kaneko, Shietung Peng
A Node-to-set cluster-fault-tolerant disjoint routing algorithm in pancake graphs. PDCS (2007)
Yamin Li, Shietung Peng, Wanming Chu
An Algorithm for Constructing Hamiltonian Cycle in Metacube Networks. PDCAT (2007)
Biing-Feng Wang, Shietung Peng, Hong-Yi Yu, Shan-Chyun Ku
-tree core problem in a tree network. J. Algorithms 59 (2) (2006)
Keiichi Kaneko, Shietung Peng
Disjoint Paths Routing in Pancake Graphs. PDCAT (2006)
Yamin Li, Shietung Peng, Wanming Chu
K-MCore for Multicasting on Mobile Ad Hoc Networks. PDCAT (2006)
Yamin Li, Shietung Peng, Wanming Chu
An Efficient Algorithm for Finding an Almost Connected Dominating Set of Small Size on Wireless Ad Hoc Networks. MASS (2006)
Yamin Li, Shietung Peng, Wanming Chu
Fault-tolerant cycle embedding in dual-cube with node faults. Int. J. High Perform. Comput. Netw. 3 (1) (2005)
Yamin Li, Shietung Peng, Wanming Chu
Adaptive Box-Based Efficient Fault-tolerant Routing in 3D Torus. ICPADS (1) (2005)
Yamin Li, Shietung Peng, Wanming Chu
Online Adaptive Fault-Tolerant Routing in 2D Torus. ISPA (2005)
Yamin Li, Shietung Peng, Wanming Chu
An Efficient Distributed Broadcasting Algorithm forWireless Ad Hoc Networks. PDCAT (2005)
Yamin Li, Shietung Peng, Wanming Chu
Efficient Collective Communications in Dual-Cube. J. Supercomput. 28 (1) (2004)
Yamin Li, Shietung Peng, Wanming Chu
Fault-tolerant cycle embedding in hypercube with mixed link and node failures. Parallel and Distributed Computing and Networks (2004)
Yamin Li, Shietung Peng, Wanming Chu
An Efficient Algorithm for Fault Tolerant Routing Based on Adaptive Binomial-Tree Technique in Hypercubes. PDCAT (2004)
Yamin Li, Shietung Peng, Wanming Chu
Adaptive-Subcube Fault Tolerant Routing in Dual-Cube with Very Large Number of Faulty Nodes. PDCS (2004)
Yamin Li, Shietung Peng, Wanming Chu
Binomial-Tree Fault Tolerant Routing in Dual-Cubes with Large Number of Faulty Nodes. CIS (2004)
Qian-Ping Gu, Shietung Peng
Multihop All-to-All Broadcast on WDM Optical Networks. IEEE Trans. Parallel Distributed Syst. 14 (5) (2003)
Yamin Li, Shietung Peng, Wanming Chu
Efficient Communication in Metacube: A New Interconnection Network. ISPAN (2002)
Yamin Li, Shietung Peng, Wanming Chu
From Dual-Cube to Metacube: Efficient Low-Degree Alternatives to Hypercube. CW (2002)
Yamin Li, Shietung Peng
Fault-Tolerant Routing and Disjoint Paths in Dual-Cube: A New Interconnection Network. ICPADS (2001)
Qian-Ping Gu, Shietung Peng
Multi-hop All-to-All Broadcast on WDM Optical Networks. ICPP Workshops (2001)
Qian-Ping Gu, Shietung Peng
An Efficient Algorithm for the k-Pairwise Disjoint Paths Problem in Hypercubes. J. Parallel Distributed Comput. 60 (6) (2000)
Qian-Ping Gu, Shietung Peng
Cluster fault-tolerant routing in star graphs. Networks 35 (1) (2000)
Shietung Peng, Stanislav Sedukhin
Design of Multi-dimensional DCT Array Processors for Video Applications. Euro-Par (2000)
Qian-Ping Gu, Shietung Peng
Efficient Protocols for Permutation Routing on All-Optical Multistage Interconnection Networks. ICPP (2000)
Qian-Ping Gu, Shietung Peng
Wavelengths Requirement for Permutation Routing in All-Optical Multistage Interconnection Networks. IPDPS (2000)
Qian-Ping Gu, Shietung Peng
Unicast in Hypercubes with Large Number of Faulty Nodes. IEEE Trans. Parallel Distributed Syst. 10 (10) (1999)
Qian-Ping Gu, Shietung Peng, Ivan Hal Sudborough
A 2-Approximation Algorithm for Genome Rearrangements by Reversals and Transpositions. Theor. Comput. Sci. 210 (2) (1999)
Shietung Peng, Stanislav Sedukhin, Hiroshi Nagata
Design Of I/O Efficient, Scalable Array Processors for Multi-dimensional DFT. PDPTA (1999)
Shietung Peng, Stanislav Sedukhin, Hiroshi Nagata
A new scalable array processor for two-dimensional discrete Fourier transform. PARCO (1999)
Qian-Ping Gu, Shietung Peng
Node-to-Set and Set-to-Set Cluster Fault Tolerant Routing in Hypercubes. Parallel Comput. 24 (8) (1998)
Qian-Ping Gu, Shietung Peng
Routing in Hypercubes with Large Number of Faulty Nodes. ICPADS (1998)
Qian-Ping Gu, Shietung Peng
Cluster Fault Tolerant Routing in Hypercubes. ICPP (1998)
Qian-Ping Gu, Shietung Peng
-Pairwise Disjoint Paths in Star Graphs. Inf. Process. Lett. 67 (6) (1998)
Qian-Ping Gu, Shietung Peng
Node-To-Set Disjoint Paths Problem in Star Graphs. Inf. Process. Lett. 62 (4) (1997)
Qian-Ping Gu, Shietung Peng
k-Pairwise Cluster Fault Tolerant Routing in Hypercubes. IEEE Trans. Computers 46 (9) (1997)
Qian-Ping Gu, Shietung Peng
Node-to-Node Cluster Fault Tolerant Routing in Hypercubes. ISPAN (1997)
Qian-Ping Gu, Shietung Peng
An efficient algorithm for set-to-set node-disjoint paths problem in hypercubes. ICPADS (1996)
Shietung Peng, Stanislav Sedukhin
Array Processors Design for Division-free Linear System Solving. Comput. J. 39 (8) (1996)
Shietung Peng, Stanislav Sedukhin, Igor S. Sedukhin
Parallel Algorithm And Architecture For Two-Step Division-Free Gaussian Elimination. ASAP (1996)
Qian-Ping Gu, Shietung Peng
Fault Tolerant Routing in Hypercubes and Star Graphs. Parallel Process. Lett. 6 (1) (1996)
Qian-Ping Gu, Shietung Peng
An Efficient Algorithm for Node-to-Node Routing in Hypercubes with Faulty Clusters. Comput. J. 39 (1) (1996)
Qian-Ping Gu, Shietung Peng
Optimal Algorithms for Node-to-Node Fault Tolerant Routing in Hypercubes. Comput. J. 39 (7) (1996)
Shietung Peng, Win-Tsung Lo
Efficient Algorithms for Finding a Core of a Tree with a Specified Length. J. Algorithms 20 (3) (1996)
Qian-Ping Gu, Shietung Peng
Linear Time Algorithms for Fault Tolerant Routing in Hypercubes and Star Graphs. IEICE Trans. Inf. Syst. (9) (1995)
Qian-Ping Gu, Shietung Peng
Finding a Routing Path of Optimal Length in Hypercubes with Fault Clusters. Parallel and Distributed Computing and Systems (1995)
Qian-Ping Gu, Shietung Peng
Node-to-Node Cluster Fault Tolerant Routing in Star Graphs. Inf. Process. Lett. 56 (1) (1995)
Qian-Ping Gu, Shietung Peng
An efficient algorithm for k-pairwise node disjoint path problem in hypercubes. SPDP (1995)
Shietung Peng, Win-Tsung Lo
The Optimal Location of a Structured Facility in a Tree Network. Parallel Algorithms Appl. 2 (1-2) (1994)
Gur Saran Adhar, Shietung Peng
Parallel Algorithms for K-tree Recognition and its Applications. HICSS (2) (1994)
Shietung Peng, Win-Tsung Lo
A Simple Optimal Parallel Algorithm for a Core of a Tree. J. Parallel Distributed Comput. 20 (3) (1994)
Qian-Ping Gu, Shietung Peng
Advanced fault tolerant routing in hypercubes. ISPAN (1994)
Qian-Ping Gu, Shietung Peng
Algorithms for Node Disjoint Paths in Incomplete Star Networks. ICPADS (1994)
Qian-Ping Gu, Shietung Peng
k-Pairwise Cluster Fault Tolerant Routing in Hypercubes. ISAAC (1994)
Shietung Peng, A. B. Stephens, Yelena Yesha
Algorithms for a Core and k-Tree Core of a Tree. J. Algorithms 15 (1) (1993)
Win-Tsung Lo, Shietung Peng
An Optimal Parallel Algorithm for a Core of a Tree. ICPP (3) (1992)
Shietung Peng, A. B. Stephens, Yelena Yesha
Algorithms for a K-Tree Core of a Tree. ICCI (1992)
Gur Saran Adhar, Shietung Peng
Parallel algorithms for finding connected, independent and total domination in interval graphs. Algorithms and Parallel VLSI Architectures (1991)
Gur Saran Adhar, Shietung Peng
Parallel Algorithms for Cographs and Parity Graphs with Applications. J. Algorithms 11 (2) (1990)
Gur Saran Adhar, Shietung Peng
Parallel Algorithms for Path Covering, Hamiltonian Path and Hamiltonian Cycle in Cographs. ICPP (3) (1990)
Gur Saran Adhar, Shietung Peng
Parallel Algorithms for Cographs Recognition and Applications. WADS (1989)
Eliezer Dekel, Simeon C. Ntafos, Shietung Peng
Compression Trees and Their Applications. ICPP (1987)
Eliezer Dekel, Shietung Peng, Shietung Iyengar
Optimal Parallel Algorithms for Constructing Balanced m-Way Search Tree. ICPP (1986)
Eliezer Dekel, Simeon C. Ntafos, Shietung Peng
Parallel Tree Techniques and Code Optimization. Aegean Workshop on Computing (1986)
Eliezer Dekel, Shietung Peng, S. Sitharma Lyengar
-way search tree. Int. J. Parallel Program. 15 (6) (1986)