Search results for "k-ary n-cube"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
3	D. Doreen Hephzibah Miriam, T. Srinivasan, R. Deepa	An Efficient SRA Based Isomorphic Task Allocation Scheme for k - ary n - cube Massively Parallel Processors.	PARELEC	2006	DBLP DOI BibTeX RDF	Full subcube recognition, k-ary n-cube systems, isomorphic partitioning, processor allocation
3	D. Doreen Hephzibah Miriam, T. Srinivasan	A Fast and Efficient Isomorphic Task Allocation Scheme for K-Ary N-Cube Systems.	DIPES	2006	DBLP DOI BibTeX RDF	Full subcube recognition, k-ary n-cube systems, isomorphic partitioning, processor allocation
3	Baback A. Izadi, Füsun Özgüner	Enhanced Cluster k-Ary n-Cube, A Fault-Tolerant Multiprocessor.	IEEE Trans. Computers	2003	DBLP DOI BibTeX RDF	spare allocation, augmented multiprocessor, wave switching, Fault tolerance, reconfiguration, hypercube, k-ary n-cube
3	Moonsoo Kang, Chansu Yu, Hee Yong Youn, Ben Lee, Myungchul Kim	Isomorphic Strategy for Processor Allocation in k-Ary n-Cube Systems.	IEEE Trans. Computers	2003	DBLP DOI BibTeX RDF	performance evaluation, partitioning, job scheduling, processor allocation, k-ary n-cube
3	Po-Jen Chuang, Chih-Ming Wu	An Efficient Recognition-Complete Processor Allocation Strategy for k-ary n-cube Multiprocessors.	IEEE Trans. Parallel Distrib. Syst.	2000	DBLP DOI BibTeX RDF	Full subcube recognition, internal and external fragmentation, k-ary n-cube multiprocessors, performance evaluation, time complexity, processor allocation
3	M. A. Sarwar, Alan D. George, David E. Collins	Reliability Modeling of SCI Ring-Based Topologies. (PDF / PS)	LCN	2000	DBLP DOI BibTeX RDF	SCI ring-based topologies, cluster interconnects, point-to-point ring-based interconnect, switched ring topologies, 1D k-ary n-cube switching fabrics, 2D k-ary n-cube switching fabrics, UltraSAN, single-ring system, redundant ring, fault tolerance, Petri nets, multiprocessor interconnection networks, network topology, reliability modeling, link failures, system buses, multiprocessor interconnects, scalable coherent interface
3	Ram Kesavan, Dhabaleswar K. Panda	Multiple Multicast with Minimized Node Contention on Wormhole k-ary n-cube Networks.	IEEE Trans. Parallel Distrib. Syst.	1999	DBLP DOI BibTeX RDF	$k$-ary $n$-cube, unicast and multidestination message passing, multicast, broadcast, meshes, wormhole routing, Collective communication, path-based routing
3	Timothy Mark Pinkston, Sugath Warnakulasuriya	Characterization of Deadlocks in k-ary n-Cube Networks.	IEEE Trans. Parallel Distrib. Syst.	1999	DBLP DOI BibTeX RDF	Deadlock characterization, true fully adaptive routing, $k$-ary $n$-cube interconnection networks, deadlock detection, deadlock recovery
3	Debashis Basak, Dhabaleswar K. Panda	Alleviating Consumption Channel Bottleneck in Wormhole-Routed k-ary n-Cube Systems.	IEEE Trans. Parallel Distrib. Syst.	1998	DBLP DOI BibTeX RDF	consumption channel, hot-spot traffic and interprocessor communication, wormhole routing, adaptive routing, virtual channel, k-ary n-cube, Parallel computer architecture, deterministic routing
3	Khaled Day, Abdel Elah Al-Ayyoub	Fault Diameter of k-ary n-cube Networks.	IEEE Trans. Parallel Distrib. Syst.	1997	DBLP DOI BibTeX RDF	interconnection networks, torus, k-ary n-cube, node-disjoint paths, Fault diameter
3	Baback A. Izadi, Füsun Özgüner	Design of a Circuit-Switched Highly Fault-Tolerant k-ary n-cube. (PDF / PS)	ICPP	1997	DBLP DOI BibTeX RDF	augmented multiprocessor, spare allocation, Fault tolerance, reconfiguration, k-ary n-cube
3	Po-Jen Chuang, Chih-Ming Wu	Processor Allocation in k-ary n-cube Multiprocessors.	ISPAN	1997	DBLP DOI BibTeX RDF	Full subcube recognition, internal and external fragmentations, k-ary n-cube multiprocessors, performance evaluation, processor allocation
3	Mongkol Raksapatcharawong, Timothy Mark Pinkston	An Optical Interconnect Model for k-ary n-cube Wormhole Networks. (PDF / PS)	IPPS	1996	DBLP DOI BibTeX RDF	free-space optical interconnects, optical interconnect model, performance evaluation, wormhole switching, k-ary n-cube networks
3	Steven L. Scott, James R. Goodman	The Impact of Pipelined Channels on k-ary n-Cube Networks.	IEEE Trans. Parallel Distrib. Syst.	1994	DBLP DOI BibTeX RDF	pipelined channels, bisection constraints, optimaldimensionality, pipelined-channel networks, switching overhead, performance evaluation, multiprocessor interconnection networks, pipeline processing, cycle time, k-ary n-cube networks, message lengths
2	Kai Hu, Zhe Wang	An Analytical Model of k-Ary n-Cube under Spatial Communication Locality.	AINA Workshops	2010	DBLP DOI BibTeX RDF	spatial communication locality, M/G/1 queuing model, virtual channel, k-ary n-cube, wormhole
2	Bin Yao, Haisen S. Li, Tian Zhou, Baowei Chen	Theoretical Research on Topological Properties of Generalized K-Ary n-Cube Interconnection Network.	ICYCS	2008	DBLP DOI BibTeX RDF
2	Sun-Yuan Hsieh, Tsong-Jie Lin	Embedding cycles and paths in a k-ary n-cube.	ICPADS	2007	DBLP DOI BibTeX RDF
2	Huaxi Gu, Jie Zhang, Kun Wang, Changshan Wang	rHALB: A New Load-Balanced Routing Algorithm for k-ary n-cube Networks.	APPT	2007	DBLP DOI BibTeX RDF
2	Rajib K. Das	Enhanced OTIS k-Ary n-Cube Networks.	ICDCIT	2006	DBLP DOI BibTeX RDF
2	Geyong Min, Mohamed Ould-Khaoua	Performance Modelling and Evaluation of k-Ary n-Cube Networks in the Presence of Bursty Traffi.	MASCOTS	2002	DBLP DOI BibTeX RDF
2	Mostafa I. Abd-El-Barr, C. Sundarram, A. S. Almulhem	VLSI considerations in the design of k-ary n-cube interconnection networks.	ISCAS	2001	DBLP DOI BibTeX RDF
2	Dhabaleswar K. Panda, Sanjay Singal, Ram Kesavan	Multidestination Message Passing in Wormhole k-ary n-cube Networks with Base Routing Conformed Paths.	IEEE Trans. Parallel Distrib. Syst.	1999	DBLP DOI BibTeX RDF	deadlock-freedom and interprocessor communication, multicast, interconnection networks, broadcast, meshes, Wormhole routing, collective communication, k-ary n-cubes
2	Ding-Ming Kwai, Behrooz Parhami	A Class of Fixed-Degree Cayley-Graph Interconnection Networks Derived by Pruning k-ary n-cubes. (PDF / PS)	ICPP	1997	DBLP DOI BibTeX RDF	fixed-degree network, pruning strategy, interconnection network, Cayley graph, k-ary n-cube, cube-connected cycles
2	Dianne Miller, Walid A. Najjar	Empirical Evaluation of Deterministic and Adaptive Routing with Constant-Area Routers.	IEEE PACT	1997	DBLP DOI BibTeX RDF	constant-area routers, router complexity, saturation points, performance, hypercube networks, hypercube networks, adaptive routing, deterministic routing, virtual cut-through switching, k-ary n-cube networks
2	C. S. Yang, Y. M. Tsai, Y. L. Tsai	Adaptive routing in k-ary n-cube multicomputers. (PDF / PS)	ICPADS	1996	DBLP DOI BibTeX RDF	k-ary n-cube multicomputers, distributed memory multiprocessor systems, virtual system, network congestion delay, performance evaluation, virtual reality, throughput, hypercube networks, wormhole routing, digital simulation, adaptive routing, distributed memory systems, simulation results, network routing, buffer size, deadlock-free routing, deadlock free routing, communication latency
2	José M. García, A. Flores	A Novel Approach to Improve the Performance of Interconnection Networks with Hot - Spots.	EUROMICRO	1996	DBLP DOI BibTeX RDF	physically distributed memory, single shared memory address space, two-dimensional k-ary n-cube networks, deterministic routing algorithm, interconnection networks, congestion control, message passing, multiprocessor interconnection networks, parallel machines, shared memory multiprocessors, wormhole routing, virtual channels, adaptive algorithms, performance improvement, hot-spots, reconfigurable networks, reconfigurable network
2	Anjan K. Venkatramani, Timothy Mark Pinkston, José Duato	Generalized Theory for Deadlock-Free Adaptive Wormhole Routing and its Application to Disha Concurrent. (PDF / PS)	IPPS	1996	DBLP DOI BibTeX RDF	deadlock-free adaptive wormhole routing, Disha Concurrent, central buffers, sequential recovery, resource cost, mutual exclusive access, deadlock-free lane, tree-based networks, performance evaluation, parallel architectures, fault tolerant computing, concurrency control, multiprocessor interconnection networks, multiprocessor interconnection networks, network routing, system recovery, edge, Token, Hamiltonian path, deadlock recovery, k-ary n-cube networks
2	Debashis Basak, Dhabaleswar K. Panda	Designing Clustered Multiprocessor Systems under Packaging and Technological Advancements.	IEEE Trans. Parallel Distrib. Syst.	1996	DBLP DOI BibTeX RDF	k-ary n-cube interconnection, packaging constraints, interconnection networks, parallel architectures, Multiprocessor systems, clustered architectures, hierarchical organization, scalable systems
2	Dhabaleswar K. Panda	Global reduction in wormhole k-ary n-cube networks with multidestination exchange worms. (PDF / PS)	IPPS	1995	DBLP DOI BibTeX RDF	global reduction, wormhole k-ary n-cube networks, multidestination exchange worms, multidestination message passing mechanism, pairwise exchange worms, complete global reduction, barrier synchronization operations, message passing interface standard, unicast-based message passing, communication startup time, data size, fast global reduction, message passing, synchronisation, hypercube networks, system size
2	Cheng-Zhong Xu, Burkhard Monien, Reinhard Lüling, Francis C. M. Lau	An analytical comparison of nearest neighbor algorithms for load balancing in parallel computers. (PDF / PS)	IPPS	1995	DBLP DOI BibTeX RDF	nearest neighbor load balancing, dimension exchange metho, performance evaluation, load balancing, parallel computers, resource allocation, hypercube, multiprocessor interconnection networks, mesh, parallel machines, communication networks, torus, k-ary n-cube, nearest neighbor algorithms
2	Raffaele Perego, G. De Petris	Minimizing network contention for mapping tasks onto massively parallel computers.	PDP	1995	DBLP DOI BibTeX RDF	network contention minimizing, compile-time determination, suboptimal solutions, K-ary n-cube family, processor networks, deterministic routing algorithm, wormhole flow control strategy, mapping heuristic, program-derived graphs, performance evaluation, parallel algorithms, parallel programming, parallel programs, concurrency control, multiprocessor interconnection networks, program compilers, network traffic, communication delays, massively parallel computers, message latencies, total completion time, mapping problem, task mapping
2	Vikram S. Adve, Mary K. Vernon	Performance Analysis of Mesh Interconnection Networks with Deterministic Routing.	IEEE Trans. Parallel Distrib. Syst.	1994	DBLP DOI BibTeX RDF	mesh interconnection networks, single-hit buffers, infinite buffers, nonadaptive deadlock-free routing scheme, closedqueueing network, message blocking, message pipelining, arbitrary source-destinationprobability distribution, 2D networks, shared-memory traffic, two dimensional network, performance evaluation, performance analysis, concurrency control, probability, multiprocessor interconnection networks, queueing theory, wormhole routing, network routing, virtual channels, deterministic routing, k-ary n-cube networks, deadlock-free routing algorithm, performance issues
2	William J. Dally	Performance Analysis of k-Ary n-Cube Interconnection Networks.	IEEE Trans. Computers	1990	DBLP DOI BibTeX RDF	k-ary n-cube interconnection networks, VLSI communication networks, average case throughput, low-dimensional networks, VLSI, multiprocessor interconnection networks, switches
1	Jing Li, Di Liu	k-Pancyclicity of k-ary n-Cube Networks under the Conditional Fault Model.	IEEE Trans. Parallel Distrib. Syst.	2012	DBLP DOI BibTeX RDF
1	Jing Li, Di Liu, Jun Yuan	Pancyclicity of k-ary n-cube networks with faulty vertices and edges.	Discrete Applied Mathematics	2012	DBLP DOI BibTeX RDF
1	Jywe-Fei Fang	The Edge-Fault-Tolerant Bipancyclicity of the Even k-ary n-cube.	Comput. J.	2011	DBLP DOI BibTeX RDF
1		k-ary n-cube.	Encyclopedia of Parallel Computing	2011	DBLP DOI BibTeX RDF
1	Jywe-Fei Fang	The Bipancycle-Connectivity and the m-Pancycle-Connectivity of the k-ary n-cube.	Comput. J.	2010	DBLP DOI BibTeX RDF
1	Chien-Hung Huang	Strongly Hamiltonian laceability of the even k-ary n-cube.	Computers & Electrical Engineering	2009	DBLP DOI BibTeX RDF
1	Ting Zhou, Youjian Zhao, Zhenhua Liu, Xiaoping Zhang	Locality-preserving randomized multicast routing on k-ary n-cube.	ICOIN	2009	DBLP BibTeX RDF
1	Hamid Hajabdolali Bazzaz, Marjan Sirjani, Ramtin Khosravi, Shamim Taheri	Modeling networking issues of network-on-chip: a coloured petri nets approach.	SimuTools	2009	DBLP DOI BibTeX RDF	modeling, network-on-chip, coloured petri nets
1	Keny T. Lucas	The Gossiping Algorithm for OTIS-k-Ary n-Cube Parallel Computer.	PDPTA	2008	DBLP BibTeX RDF
1	Iain A. Stewart, Yonghong Xiang	Embedding Long Paths in k-Ary n-Cubes with Faulty Nodes and Links.	IEEE Trans. Parallel Distrib. Syst.	2008	DBLP DOI BibTeX RDF
1	Aminollah Mahabadi, Hamid Sarbazi-Azad, Ebrahim Khodaie, Keivan Navi	Parallel Lagrange interpolation on k -ary n -cubes with maximum channel utilization.	The Journal of Supercomputing	2008	DBLP DOI BibTeX RDF	Link-disjoint Hamiltonian cycles, Parallel algorithms, Performance analysis, Interconnection networks, Multicomputers, k-ary n-cubes, Lagrange interpolation
1	Valentin Puente, José-Ángel Gregorio	Immucube: Scalable Fault-Tolerant Routing for k-ary n-cube Networks.	IEEE Trans. Parallel Distrib. Syst.	2007	DBLP DOI BibTeX RDF	k{hbox{-}}aryn{hbox{-}}cubes, Interconnection networks, fault-tolerant routing
1	Ahmad Khonsari, Alireza Shahrabi, Mohamed Ould-Khaoua	A Performance Model of Disha Routing in k-Ary n-Cube Networks.	Parallel Processing Letters	2007	DBLP DOI BibTeX RDF
1	Ahmad Khonsari, Mohamed Ould-Khaoua	A performance model of compressionless routing in k-ary n-cube networks.	Perform. Eval.	2006	DBLP DOI BibTeX RDF
1	Cruz Izu	Throughput fairness in k-ary n-cube networks.	ACSC	2006	DBLP DOI BibTeX RDF	interconnection networks, fairness, network throughput, channel utilization
1	Iain A. Stewart	Distributed Algorithms for Building Hamiltonian Cycles in k-ary n-cubes and Hypercubes with Faulty Links.	ICPADS	2006	DBLP DOI BibTeX RDF
1	Pedram Rajabzadeh, Hashem Hashemi Sarbazi-azad, Hamid Hashemi Najaf-abadi, Mohamed Ould-Khaoua	Performance modeling of fully adaptive wormhole routing in n-dimensional mesh-connected multicomputers.	IPCCC	2006	DBLP DOI BibTeX RDF
1	Taskin Koçak, Jacob Engel	Performance evaluation of wormhole routed network processor-memory interconnects.	IPDPS	2006	DBLP DOI BibTeX RDF
1	Milos Stojmenovic, Amiya Nayak	Broadcasting and routing in faulty mesh networks.	IPDPS	2006	DBLP DOI BibTeX RDF
1	Hamid Sarbazi-Azad, Mohamed Ould-Khaoua	Constraint-Based Performance Analysis of k Ary n -Cube Networks	I. J. Comput. Appl.	2005	DBLP BibTeX RDF
1	Richard West, Gary T. Wong, Gerald Fry	Comparison of k-ary n-cube and de Bruijn Overlays in QoS-constrained Multicast Applications.	PDPTA	2005	DBLP BibTeX RDF
1	Deqiang Wang, Mingyang Pan, Tong An, Kelun Wang, Shuyan Qu	Hamiltonian-like Properties of k-Ary n-Cubes.	PDCAT	2005	DBLP DOI BibTeX RDF
1	Mostafa Rezazad, Hamid Sarbazi-Azad	Analytic Performance Modeling of a Fully Adaptive Routing Algorithm in the Torus.	ISPA	2005	DBLP DOI BibTeX RDF
1	Jehad Al-Sadi, Khaled Day, Mohamed Ould-Khaoua	A New Fault-Tolerant Routing Algorithm for k-Ary n-Cube Networks.	International Journal of High Speed Computing	2004	DBLP DOI BibTeX RDF
1	Khaled Day	The Conditional Node Connectivity Of The k-Ary n-Cube.	Journal of Interconnection Networks	2004	DBLP DOI BibTeX RDF
1	Mithuna Thottethodi, Alvin R. Lebeck, Shubhendu S. Mukherjee	Exploiting Global Knowledge to Achieve Self-Tuned Congestion Control for k-Ary n-Cube Networks.	IEEE Trans. Parallel Distrib. Syst.	2004	DBLP DOI BibTeX RDF	k{hbox{-}rm ary}n{hbox{-}rm cubes}, Interconnection networks, congestion control, self-tuning, wormhole, global information
1	Abderezak Touzene	Optimal all-ports collective communication algorithms for the k-ary n-cube interconnection networks.	Journal of Systems Architecture	2004	DBLP DOI BibTeX RDF
1	Khaled Day	Optical transpose k-ary n-cube networks.	Journal of Systems Architecture	2004	DBLP DOI BibTeX RDF
1	Behrooz Parhami, Ding-Ming Kwai	Incomplete k-ary n-cube and its derivatives.	J. Parallel Distrib. Comput.	2004	DBLP DOI BibTeX RDF
1	José Miguel-Alonso, José A. Gregorio, Valentin Puente, Fernando Vallejo, Ramón Beivide	Load Unbalance in k-ary n-Cube Networks.	Euro-Par	2004	DBLP DOI BibTeX RDF
1	Gerald Fry, Richard West	Dynamic Characteristics of k-ary n-cube Networks for Real-time Communication.	Communications in Computing	2004	DBLP BibTeX RDF
1	Arjun Singh, William J. Dally, Amit K. Gupta, Brian Towles	Adaptive channel queue routing on k-ary n-cubes.	SPAA	2004	DBLP DOI BibTeX RDF	adaptive channel queue routing, k-ary n-cubes
1	Hashem Hashemi Najaf-abadi, Hamid Sarbazi-Azad	An Accurate Combinatorial Model for Performance Prediction of Deterministic Wormhole Routing in Torus Multicomputer Systems.	ICCD	2004	DBLP DOI BibTeX RDF
1	Geyong Min, Mohamed Ould-Khaoua, Demetres D. Kouvatsos, Irfan-Ullah Awan	A Queuing Model of Dimension-Ordered Routing under Self-Similar Traffic Loads.	IPDPS	2004	DBLP DOI BibTeX RDF
1	Gerald Fry, Richard West	Adaptive Routing of QoS-Constrained Media Streams over Scalable Overlay Topologies.	IEEE Real-Time and Embedded Technology and Applications Symposium	2004	DBLP DOI BibTeX RDF
1	R. Pranav, Lawrence Jenkins	Fast and Efficient Submesh Determination in Faulty Tori.	HiPC	2004	DBLP DOI BibTeX RDF
1	Jehad Al-Sadi, Khaled Day, Mohamed Ould-Khaoua	Analysis of fault-tolerant routing algorithms in k-ary n-cube networks.	Comput. Syst. Sci. Eng.	2003	DBLP BibTeX RDF
1	Valentin Puente, José A. Gregorio, Ramón Beivide, Fernando Vallejo	A Low Cost Fault Tolerant Packet Routing for Parallel Computers.	IPDPS	2003	DBLP DOI BibTeX RDF
1	Geyong Min, Mohamed Ould-Khaoua	A Performance Model for k-Ary n-Cube Networks with Self-Similar Traffic. (PDF / PS)	IPDPS	2002	DBLP DOI BibTeX RDF
1	Jehad Al-Sadi, Khaled Day, Mohamed Ould-Khaoua	A New Probabilistic Approach for Fault-Tolerant Routing in k-Ary n-Cubes.	ICPADS	2002	DBLP DOI BibTeX RDF	Performance Evaluation, Interconnection Networks, Multicomputers, Fault-Tolerant Routing, k-Ary n-Cube
1	Satoshi Fujita	Worst Case Analysis of a Greedy Multicast Algorithm in k-ary n-cubes. (PDF / PS)	ICPP	2002	DBLP DOI BibTeX RDF	analysis of algorithms, information dissemination, k-ary n-cube, multicast tree, approximation ratio
1	Jehad Al-Sadi, Khaled Day, Mohamed Ould-Khaoua	Probability vectors: a new fault-tolerant routing algorithm for k-ary n-cubes.	SAC	2002	DBLP DOI BibTeX RDF	performance analysis, probability, multicomputers, fault-tolerant routing, k-Ary n-Cubes
1	Seungjin Park, Steven Seidel, Jong-Hoon Youn	Fault-Tolerant Broadcasting in Wormhole-Routed Torus Networks. (PDF / PS)	IPDPS	2002	DBLP DOI BibTeX RDF
1	María del Carmen Carrión, Gregorio Díaz, Blanca Caminero-Herráez	Performance Issues of Deterministic and Adaptive Ghost-Packet Routers. (PDF / PS)	ICPP	2001	DBLP DOI BibTeX RDF	VLSI router de-sign, routing algorithms, k-ary n-cube networks
1	Behrooz Parhami, Ding-Ming Kwai	A Unified Formulation of Honeycomb and Diamond Networks.	IEEE Trans. Parallel Distrib. Syst.	2001	DBLP DOI BibTeX RDF	pruned torus network, network topology, Cayley graph, processor array, VLSI layout, k-ary n-cube
1	Geyong Min, Hamid Sarbazi-Azad, Mohamed Ould-Khaoua	Performance Analysis of k-Ary n-Cube Networks with Pipelined Circuit Switching.	International Journal of High Speed Computing	2000	DBLP DOI BibTeX RDF
1	Siu-Cheung Chau, Ada Wai-Chee Fu	An Improved Direct Dimension Exchange Method for Load Balancing in k-ary n-cube Multicomputers.	PDPTA	2000	DBLP BibTeX RDF
1	Hamid Sarbazi-Azad, Lewis M. Mackenzie, Mohamed Ould-Khaoua	An Analytic Model for Communication Latency in Wormhole-Switched k-ary n-Cube Interconnection Networks with Digit-Reversal Traffic.	ISHPC	2000	DBLP DOI BibTeX RDF
1	Carmen Carrión, José A. Gregorio, Ramón Beivide	Pipelining Router Design Improves Parallel System Performance.	ISPAN	2000	DBLP DOI BibTeX RDF	bubble algorithm, pipelined router design, k-ary n-cube networks, DSM systems
1	James R. Anderson, Seth Abraham	Performance-Based Constraints for Multidimensional Networks.	IEEE Trans. Parallel Distrib. Syst.	2000	DBLP DOI BibTeX RDF	multidimensional network, $k$-ary $n$-cube, direct-connected, queue waiting time, unity queue waiting time, performance analysis, Interconnection networks, message latency, maximum throughput
1	Chi-Hsiang Yeh, Emmanouel A. Varvarigos, Behrooz Parhami	Multilayer VLSI Layout for Interconnection Networks. (PDF / PS)	ICPP	2000	DBLP DOI BibTeX RDF
1	Geyong Min, Mohamed Ould-Khaoua, Hamid Sarbazi-Azad	Modeling of Pipelined Circuit Switching in Multicomputer Networks. (PDF / PS)	MASCOTS	2000	DBLP DOI BibTeX RDF	Performance Analysis, Adaptive Routing, Multicomputers, Virtual Channels, Queuing Theory, k-ary n-cubes, Message Latency
1	Moonsoo Kang, Chansu Yu	Isomorphic Allocation in k-ary n-cube Systems.	HiPC	1999	DBLP DOI BibTeX RDF
1	Khaled Day, Saad Harous, Abdel Elah Al-Ayyoub	The Conditional Node Connectivity of the k-ary n-Cube.	PDPTA	1999	DBLP BibTeX RDF
1	Yunseok Rhee, Joonwon Lee	A Scalable Cache Coherent Scheme Exploiting Wormhole Routing Networks.	HPCA	1999	DBLP DOI BibTeX RDF
1	Hamid Sarbazi-Azad, Lewis M. Mackenzie, Mohamed Ould-Khaoua	A Parallel Algorithm for Lagrange Interpolation on k-ary n-Cubes.	ACPC	1999	DBLP DOI BibTeX RDF
1	Dianne R. Kumar, Walid A. Najjar	Combining Adaptive and Deterministic Routing: Evaluation of a Hybrid Router.	CANPC	1999	DBLP DOI BibTeX RDF
1	Andrew A. Chien	A Cost and Speed Model for k-ary n-Cube Wormhole Routers.	IEEE Trans. Parallel Distrib. Syst.	1998	DBLP DOI BibTeX RDF	Routing networks, parallel computing, wormhole routing, adaptive routing, multicomputers, gate array, deadlock prevention
1	Mongkol Raksapatcharawong, Timothy Mark Pinkston	Modeling Free-Space Optical k-ary n-Cube Wormhole Networks.	J. Parallel Distrib. Comput.	1998	DBLP DOI BibTeX RDF
1	Cruz Izu, Agustin Arruabarrena	Applying Segment Routing to k-ary n-cube Networks.	International Conference on Supercomputing	1998	DBLP DOI BibTeX RDF
1	Yaagoub Ashir, Iain A. Stewart, Aqeel Ahmed	Communication Algorithms in k-Ary n-Cube Interconnection Networks.	Inf. Process. Lett.	1997	DBLP DOI BibTeX RDF
1	Abdel Elah Al-Ayyoub, Khaled Day	Errata: Parallel Solution of Dense Linear Systems on the k-Ary n-Cube Networks.	International Journal of High Speed Computing	1997	DBLP DOI BibTeX RDF
1	Abdel Elah Al-Ayyoub, Khaled Day	Parallel Solution of Dense Linear Systems on the k-Ary n-Cube Networks.	International Journal of High Speed Computing	1997	DBLP DOI BibTeX RDF
1	Ausif Mahmood, Donald J. Lynch, Roger B. Shaffer	Optimally Adaptive, Minimum-Distance, Circuit-Switched Routing in Hypercubes.	ACM Trans. Comput. Syst.	1997	DBLP DOI BibTeX RDF	parallel processing, interconnection networks, hypercube, routing algorithms, adaptive routing, k-ary n-cube, circuit switched
1	James R. Anderson, Seth Abraham	Multidimensional Network Performance with Unidirectional Links. (PDF / PS)	ICPP	1997	DBLP DOI BibTeX RDF	multidimensional network, direct connected, queue waiting time, parallel processing, interconnection networks, multiprocessors, k-ary n-cube
1	Myung M. Bae, Bella Bose	Resource Placement in Torus-Based Networks.	IEEE Trans. Computers	1997	DBLP DOI BibTeX RDF	Error-correcting code, k-ary n-cube, torus network, resource placement, Lee distance
1	Yaagoub Ashir, Iain A. Stewart	Embeddings of cycles, meshes and tori in faulty k-ary n-cubes. (PDF / PS)	ICPADS	1997	DBLP DOI BibTeX RDF	cycles embedding, faulty k-ary n-cubes, meshes, hypercube networks, tori