Search results for "rearrangeability"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
73	Xuesong Tan, Shuo-Yen Robert Li, Yuxiu Shen	Rearrangeability of the Tandem Cascade of Banyan-type Networks.	PDCAT	2005	DBLP DOI BibTeX RDF
72	A. Abbinante, Pietro Camarda	GSN: A New Multihop Architecture for Optical Networks.	LCN	1996	DBLP DOI BibTeX RDF	optical fibre communication, multihop architecture, Generalized ShuffleNet, table free routing, distributed hardware based decisions, modularity, optical networks, high performance, computer program, necessary conditions, rearrangeability, virtual topology, sufficiency
68	Yuanyuan Yang 0001, Gerald M. Masson	Broadcast ring sandwich networks.	SPDP	1991	DBLP DOI BibTeX RDF
55	Kyungsook Y. Lee	On the Rearrangeability of 2(log2N) - 1 Stage Permutation Networks.	IEEE Trans. Computers	1985	DBLP DOI BibTeX RDF	hardware requirement, passable permutations, interconnection network, permutation, multistage networks, Control algorithm, rearrangeability, hardware redundancy
51	Rza Bashirov	On the Rearrangeability of Multistage Networks Employing Uniform Connection Patterns.	ADVIS	2000	DBLP DOI BibTeX RDF
49	José R. Correa, Michel X. Goemans	An approximate König's theorem for edge-coloring weighted bipartite graphs.	STOC	2004	DBLP DOI BibTeX RDF	bipartite edge coloring, rearrangeability of 3-stage clos networks, bin packing
28	Bey-Chi Lin	Rearrangeability and repackability of a multicast wavelength-space-wavelength elastic optical network.	Opt. Switch. Netw.	2023	DBLP DOI BibTeX RDF
28	Fitz Gerald Cabangcla, Daniele Izzi, Annalisa Massini	A New Perspective for Rearrangeability of MINs.	SoftCOM	2021	DBLP BibTeX RDF
28	Wojciech Kabacinski, Atyaf Al-Tameemi, Remigiusz Rajewski	Necessary and Sufficient Conditions for the Rearrangeability of WSW1 Switching Fabrics.	IEEE Access	2019	DBLP DOI BibTeX RDF
28	Wojciech Kabacinski, Atyaf Al-Tameemi, Remigiusz Rajewski	Rearrangeability of Wavelength-Space-Wavelength Switching Fabric Architecture for Elastic Optical Switches.	IEEE Access	2019	DBLP DOI BibTeX RDF
28	Li-Da Tong, Yun-Ruei Li	Rearrangeability of Multicast Banyan-Type Networks with Crosstalk Constraints.	J. Interconnect. Networks	2017	DBLP DOI BibTeX RDF
28	Ibrahima Sakho, Jean-Pierre Jung	One Step Ahead towards the Rearrangeability of 4D-Hypercube Interconnection Networks.	ACIIDS (2)	2014	DBLP DOI BibTeX RDF
28	Shuo-Yen Robert Li, Xuesong Jonathan Tan	On rearrangeability of tandem connection of banyan-type networks.	IEEE Trans. Commun.	2009	DBLP DOI BibTeX RDF
28	Xuesong Tan, Shuo-Yen Robert Li	Rearrangeability of Tandem Cascade of Banyan-Type Networks.	IEICE Trans. Inf. Syst.	2007	DBLP DOI BibTeX RDF
28	Xuewen Bao, Frank K. Hwang, Qiao Li	Rearrangeability of bit permutation networks.	Theor. Comput. Sci.	2006	DBLP DOI BibTeX RDF
28	Nabanita Das 0001	More on rearrangeability of combined (2n.	J. Syst. Archit.	2005	DBLP DOI BibTeX RDF
28	Xuesong Tan, Shuo-Yen Robert Li	On Rearrangeability of Cascaded Banyan-type Networks.	PDCS	2005	DBLP BibTeX RDF
28	Hasan Cam	Rearrangeability of (2n-1)-Stage Shuffle-Exchange Networks.	SIAM J. Comput.	2003	DBLP DOI BibTeX RDF
28	Andrzej Jajszczyk	Rearrangeability of multicast Clos networks with middle-stage fan-out.	IEEE Commun. Lett.	2003	DBLP DOI BibTeX RDF
28	Rza Bashirov	On the rearrangeability of (2s-1)-stage nonsymmetric interconnection networks.	PDPTA	2000	DBLP BibTeX RDF
28	Guo-Hui Lin, Ding-Zhu Du, Xiao-Dong Hu 0001, Guoliang Xue	On Rearrangeability of Multirate Clos Networks.	SIAM J. Comput.	1999	DBLP DOI BibTeX RDF
28	Guo-Hui Lin, Ding-Zhu Du, Weili Wu 0001, Kyeongah Yoo	On 3-rate rearrangeability of Clos networks.	Advances in Switching Networks	1997	DBLP DOI BibTeX RDF
28	Nabanita Das 0001, Jayasree Dattagupta	Two-Pass Rearrangeability in Faulty Benes Networks.	J. Parallel Distributed Comput.	1996	DBLP DOI BibTeX RDF
28	B. Park, Karan L. Watson	On the Rearrangeability of Reverse Shuffle/Exchange Networks.	ICPP (1)	1994	DBLP DOI BibTeX RDF
28	Dung T. Huynh, Hai N. Nguyen	On the Rearrangeability of Switching Networks Composed of Digital Symmetrical Matrices.	ICCI	1993	DBLP BibTeX RDF
28	Akram Abdennadher, Tse-Yun Feng	On Rearrangeability of Omega-Omega Networks.	ICPP (1)	1992	DBLP BibTeX RDF
28	Abdulraouf Y. Al-Hallaq	Rearrangeability of 2 log N-1 shuffle/exchange network.	TAI	1989	DBLP DOI BibTeX RDF
28	Anujan Varma, Cauligi S. Raghavendra	Rearrangeability of multistage shuffle/exchange networks.	IEEE Trans. Commun.	1988	DBLP DOI BibTeX RDF
28	Cauligi S. Raghavendra, Anujan Varma	Rearrangeability of the Five-Stage Shuffle/Exchange Network for N = 8.	IEEE Trans. Commun.	1987	DBLP DOI BibTeX RDF
28	Anujan Varma, Cauligi S. Raghavendra	Rearrangeability of Multistage Shuffle/Exchange Networks.	ISCA	1987	DBLP DOI BibTeX RDF
28	Anujan Varma, Cauligi S. Raghavendra	Rearrangeability of the 5-Stage Shuffle/Exchange Network for N=8 9.	ICPP	1986	DBLP BibTeX RDF
28	Suresh C. Kothari, S. Lakshmivarahan	A Condition Known to be Sufficient for Rearrangeability of the Benes Class of Interconnection Networks with 2x2 Switches Is Also Necessary.	ICPP	1983	DBLP BibTeX RDF
28	Frank K. Hwang	On the rearrangeability of some multistage connecting networks.	Bell Syst. Tech. J.	1976	DBLP DOI BibTeX RDF
28	Vaclav Edvard Benes	Proving the rearrangeability of connecting networks by group calculations.	Bell Syst. Tech. J.	1975	DBLP DOI BibTeX RDF
28	Vaclav Edvard Benes	Toward a group-theoretic proof of the rearrangeability theorem for clos' network.	Bell Syst. Tech. J.	1975	DBLP DOI BibTeX RDF
28	Frank K. Hwang	Rearrangeability of multi-connection three-stage clos networks.	Networks	1972	DBLP DOI BibTeX RDF
27	Serge Burckel, Emeric Gioan, Emmanuel Thomé	Mapping Computation with No Memory.	UC	2009	DBLP DOI BibTeX RDF	mapping computation, boolean mapping, linear mapping, processor optimization, multistage interconnection network, circuit design, memory optimization, butterfly, program design, rearrangeability
27	Rajgopal Kannan	The KR-Benes Network: A Control-Optimal Rearrangeable Permutation Network.	IEEE Trans. Computers	2005	DBLP DOI BibTeX RDF	optimal control algorithm, Benes network, rearrangeability
27	Hasan Cam, José A. B. Fortes	Frames: A Simple Characterization of Permutations Realized by Frequently Used Networks.	IEEE Trans. Computers	1995	DBLP DOI BibTeX RDF	topological equivalence, balanced matrices, Network, permutations, frames, rearrangeability
27	David Goldfeld, Tuvi Etzion	UPP Graphs and UMFA Networks-Architecture for Parallel Systems.	IEEE Trans. Computers	1992	DBLP DOI BibTeX RDF	UMFA networks, unique path property, uniform minimal full access, interconnection networks, parallel architectures, lower bound, multiprocessor interconnection networks, isomorphism, Omega network, rearrangeability
23	Badar Gillani, Robert D. Kent, Akshai K. Aggarwal	Topology Reconfiguration Mechanism for Traffic Engineering in WDM Optical Network.	HPCS	2005	DBLP DOI BibTeX RDF	wavelength division multiplexing (WDM) and single lightpath change (SLPC), reconfiguration, Lightpath (LP)
23	Mohammad R. Salehnamadi, Mehdi N. Fesharaki	A "Single-Box" Re-routing Architecture for a 3-Stage Rearrangeable CLOS Interconnection Networks.	PARA	2002	DBLP DOI BibTeX RDF
23	Mao-Hsu Yen, Sao-Jie Chen, Sanko Lan	A Three-Stage One-Sided Rearrangeable Polygonal Switching Network.	IEEE Trans. Computers	2001	DBLP DOI BibTeX RDF	polygonal switching network, switching network, Rearrangeable
23	Linjiang Ma, Tse-Yun Feng	Routing A Class of Concatenated Omega Networks.	FTDCS	1999	DBLP DOI BibTeX RDF	topological equivalence, omega + omega networks, labeling scheme, Benes networks
23	Dongsoo S. Kim, Ding-Zhu Du	Multirate Multicast Switching Networks.	COCOON	1998	DBLP DOI BibTeX RDF