Search results for "hypercube networks"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
3	Abdelghani Bellaachia, Abdou Youssef	Personalized broadcasting in banyan-hypercube networks.	ICCCN	1995	DBLP DOI BibTeX RDF	personalized broadcasting, banyan-hypercube networks, hypercube based interconnection networks, multiprocessing environment, near optimal personalized broadcasting algorithm, single port communication, multiple port communication, packet switching, hypercube networks, system performance, communication time
3	Michael Harrington, Arun K. Somani	Synchronizing Hypercube Networks in the Presence of Faults.	IEEE Trans. Computers	1994	DBLP DOI BibTeX RDF	hypercube networks synchronisation, redundant results, fault tolerant hardware synchronization schemes, multistage synchronizers, Proteus parallel computer system, circuit switching communication network, reliability, fault tolerant computing, application specific integrated circuits, synchronisation, hypercube networks, distributed networks, phased locked loops, fault tolerant systems, Byzantine faults, synchronous programs, ASIC design
2	Ozgur Sinanoglu, Mehmet Hakan Karaata, Bader F. AlBdaiwi	An Inherently Stabilizing Algorithm for Node-To-Node Routing over All Shortest Node-Disjoint Paths in Hypercube Networks.	IEEE Trans. Computers	2010	DBLP DOI BibTeX RDF	inherent stabilization, Fault-tolerance, stabilization, hypercube networks, node-disjoint paths
2	Fangai Liu, Ying Song	Broadcast in the Locally k-Subcube-Connected Hypercube Networks with Faulty Tolerance.	ICCNMC	2005	DBLP DOI BibTeX RDF
2	Xiaolin Xiao, Guojun Wang, Jianer Chen	Fault Tolerant Routing Algorithm in Hypercube Networks with Load Balancing Support.	ISPA	2004	DBLP DOI BibTeX RDF
2	Tiziana Calamoneri, Annalisa Massini	Nearly Optimal Three Dimensional Layout of Hypercube Networks.	Graph Drawing	2003	DBLP DOI BibTeX RDF	Three Dimensional Layout, VLSI layout volume, Hypercube Network
2	Jianer Chen, Guojun Wang, Songqiao Chen	Locally Subcube-Connected Hypercube Networks: Theoretical Analysis and Experimental Results.	IEEE Trans. Computers	2002	DBLP DOI BibTeX RDF	fault tolerance, Interconnection network, hypercube, routing algorithm
2	Keiichi Kaneko, Hideo Ito	Fault-Tolerant Routing Algorithms for Hypercube Networks. (PDF / PS)	IPPS/SPDP	1999	DBLP DOI BibTeX RDF
2	Mounir Hamdi, Siang W. Song	Embedding Hierarchical Hypercube Networks into the Hypercube.	IEEE Trans. Parallel Distrib. Syst.	1997	DBLP DOI BibTeX RDF	interconnection networks, hypercube, embedding, Dilation, hierarchical networks
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	Zevi Miller, Dan Pritikin, Ivan Hal Sudborough	Near Embeddings of Hypercubes into Cayley Graphs on the Symmetric Group.	IEEE Trans. Computers	1994	DBLP DOI BibTeX RDF	one-to-many maps, interprocessor communication time, toggling bit i, one-to-one embedding, parallel computation, graph theory, hypercubes, hypercube networks, hypercube networks, Cayley graphs, group theory, star network, symmetric group
2	Abdou Youssef, Bhagirath Narahari	The Banyan-Hypercube Networks.	IEEE Trans. Parallel Distrib. Syst.	1990	DBLP DOI BibTeX RDF	banyan-hypercube networks, communication capabilities, interconnecting hypercubes, embedding of rings, partitioning strategy, performance evaluation, routing, parallel architectures, partitioning, multiprocessor interconnection networks, optimal routing algorithm
1	Jianping Ou	On maximal 3-restricted edge connectivity and reliability analysis of hypercube networks.	Applied Mathematics and Computation	2010	DBLP DOI BibTeX RDF
1	Sithy Shameema Yasim, Shahram Latifi	Reliability Modeling of Augmented Hypercube Networks.	I. J. Comput. Appl.	2009	DBLP BibTeX RDF
1	Hongmei Liu	The Structural Features of Enhanced Hypercube Networks.	ICNC	2009	DBLP DOI BibTeX RDF
1	Ruei-Yu Wu, Gen-Huey Chen, Jung-Sheng Fu, Gerard J. Chang	Finding cycles in hierarchical hypercube networks.	Inf. Process. Lett.	2008	DBLP DOI BibTeX RDF
1	Syed Sajjad Rizvi, Adil Sheikh, Aasia Riasat	Faulty Links Optimization for Hypercube Networks via Stored and Forward One-Bit Round Robin Routing Algorithm.	TeNe	2008	DBLP DOI BibTeX RDF
1	Hongmei Liu	Properties and Performance of Enhanced Hypercube Networks.	NCM	2008	DBLP DOI BibTeX RDF	routing, network
1	Song Lu, Xiaodong Yang	A Clustering Model for Multicast on Hypercube Network.	GPC	2008	DBLP DOI BibTeX RDF
1	Sina Meraji, Hamid Sarbazi-Azad	Mathematical Performance Modelling of Stretched Hypercubes.	ICDCN	2008	DBLP DOI BibTeX RDF	stretched hypercube, performance evaluation, analytical model, wormhole routing
1	Ruei-Yu Wu, Gen-Huey Chen, Yu-Liang Kuo, Gerard J. Chang	Node-disjoint paths in hierarchical hypercube networks.	Inf. Sci.	2007	DBLP DOI BibTeX RDF
1	Ruei-Yu Wu, Gen-Huey Chen, Jung-Sheng Fu, Gerard J. Chang	Bipancyclicity of Hierarchical Hypercube Networks.	PDPTA	2007	DBLP BibTeX RDF
1	Sina Meraji, Abbas Nayebi, Hamid Sarbazi-Azad	Simulation-Based Performance Evaluation of Deterministic Routing in Necklace Hypercubes.	AICCSA	2007	DBLP DOI BibTeX RDF
1	Michael T. Helmick, Fred S. Annexstein	Depth-Latency Tradeoffs in Multicast Tree Algorithms.	AINA	2007	DBLP DOI BibTeX RDF
1	Sina Meraji, Hamid Sarbazi-Azad, Ahmad Patooghy	Performance Modelling of Necklace Hypercubes.	IPDPS	2007	DBLP DOI BibTeX RDF
1	Andrej Taranenko, Aleksander Vesel	Fast Recognition of Fibonacci Cubes.	Algorithmica	2007	DBLP DOI BibTeX RDF	Resonance graph, Recognition algorithm, Fibonacci cube
1	Tiziana Calamoneri, Annalisa Massini	Nearly optimal three dimensional layout of hypercube networks.	Networks	2006	DBLP DOI BibTeX RDF
1	Ruei-Yu Wu, J. G. Chang, Gen-Huey Chen	Node-disjoint paths in hierarchical hypercube networks.	IPDPS	2006	DBLP DOI BibTeX RDF
1	Ahmad Patooghy, Hamid Sarbazi-Azad	Performance Comparison of Partially Adaptive Routing Algorithms.	AINA	2006	DBLP DOI BibTeX RDF
1	Abbas Eslami Kiasari, Hamid Sarbazi-Azad	A comparative performance analysis of n-cubes and star graphs.	IPDPS	2006	DBLP DOI BibTeX RDF
1	Mostafa Rezazad, Hamid Sarbazi-Azad	The Effect of Virtual Channel Organization on the Performance of Interconnection Networks.	IPDPS	2005	DBLP DOI BibTeX RDF
1	Gaocai Wang, Jianer Chen, Guojun Wang	On Fault Tolerance of 3-Dimensional Mesh Networks.	ISPAN	2004	DBLP DOI BibTeX RDF
1	Yamin Li, Shietung Peng, Wanming Chu	An Efficient Algorithm for Fault Tolerant Routing Based on Adaptive Binomial-Tree Technique in Hypercubes.	PDCAT	2004	DBLP DOI BibTeX RDF
1	Jau-Der Shih	Fault-tolerant wormhole routing for hypercube networks.	Inf. Process. Lett.	2003	DBLP DOI BibTeX RDF
1	Geyong Min, Mohamed Ould-Khaoua	Performance analysis of hypercube networks under LRD traffic.	Comput. Syst. Sci. Eng.	2003	DBLP BibTeX RDF
1	Li Sheng, Jie Wu	Maximum-shortest-path (MSP) is not optimal for a general N×N torus.	IEEE Transactions on Reliability	2003	DBLP DOI BibTeX RDF
1	Yamin Li, Shietung Peng, Wanming Chu	From Dual-Cube to Metacube: Efficient Low-Degree Alternatives to Hypercube.	CW	2002	DBLP DOI BibTeX RDF
1	Trong-Yen Lee, Pao-Ann Hsiung, Sao-Jie Chen	TCN: Scalable Hierarchical Hypercubes.	ICPADS	2002	DBLP DOI BibTeX RDF
1	Jianer Chen, Iyad A. Kanj, Guojun Wang	Hypercube Network Fault Tolerance: A Probabilistic Approach. (PDF / PS)	ICPP	2002	DBLP DOI BibTeX RDF
1	Jianer Chen, Guojun Wang, Songqiao Chen	Routing in Hypercube Networks with a Constant Fraction of Faulty Nodes.	Journal of Interconnection Networks	2001	DBLP BibTeX RDF
1	Eunseuk Oh, Jianer Chen	Parallel Routing in Hypercube Networks with Faulty Nodes.	ICPADS	2001	DBLP BibTeX RDF
1	Berthold Vöcking	Almost optimal permutation routing on hypercubes.	STOC	2001	DBLP DOI BibTeX RDF
1	Jonathan P. Lang, Vishal Sharma, Emmanouel A. Varvarigos	An analysis of oblivious and adaptive routing in optical networks with wavelength translation.	IEEE/ACM Trans. Netw.	2001	DBLP DOI BibTeX RDF	multi-fiber networks, wavelength translation, performance analysis, hypercube, Adaptive routing, wavelength division multiplexing, torus, oblivious routing, all-optical networks
1	Mahmoud Al-Omari	Routing in Quad Tree-Hypercube Networks.	SAC	2000	DBLP BibTeX RDF
1	Siu-Cheung Chau, Ada Wai-Chee Fu	A reconfigurable fault-tolerant hypercube architecture with global sparing.	PRDC	2000	DBLP DOI BibTeX RDF	reconfigurable fault-tolerant hypercube architecture, global sparing, reliability, fault tolerant computing, reconfigurable architectures, hypercube networks, switching networks, switching networks
1	Thomas Rauber, Gudula Rünger	Deriving Array Distributions by Optimization Techniques.	The Journal of Supercomputing	2000	DBLP DOI BibTeX RDF	array distributions, runtime prediction, hypercube networks, optimization techniques, LU decomposition
1	Chi-Hsiang Yeh, Emmanouel A. Varvarigos, Behrooz Parhami	Multilayer VLSI Layout for Interconnection Networks. (PDF / PS)	ICPP	2000	DBLP DOI BibTeX RDF
1	Jianer Chen, Lihua Liu, Songqiao Chen, Weijia Jia	An Intuitive and Effective New Representation for Interconnection Network Structures.	ISAAC	2000	DBLP DOI BibTeX RDF
1	Saulo Rodrigues do Nascimento, Marco Aurélio Amaral Henriques	An Analysis and Comparison of Algorithms for Broadcasting in Injured Hypercube Networks.	PDPTA	1999	DBLP BibTeX RDF
1	Frank Thomson Leighton, Eric J. Schwabe	Efficient Algorithms for Dynamic Allocation of Distributed Memo.	Algorithmica	1999	DBLP DOI BibTeX RDF	Allocation algorithms, Memory allocation, Parallel and distributed systems, Dynamic allocation
1	Huan-Chao Keh, Jen-Chih Lin	Simulation of Complete Binary Tree Structures in a Faulty Flexible Hypercube.	J. Sci. Comput.	1999	DBLP DOI BibTeX RDF	Flexible hypercube, embedding, complete binary tree
1	Peng-Jun Wan	TWDM Multichannel Lightwave Hypercube Networks.	Theor. Comput. Sci.	1998	DBLP DOI BibTeX RDF
1	Ayan Banerjee, Emmanouel A. Varvarigos	A Dynamic Scheduling Communication Protocol and Its Analysis for Hypercube Networks.	Int. J. Found. Comput. Sci.	1998	DBLP BibTeX RDF
1	Mahmoud Al-Omari, Hani Abu-Salem	Routing algorithms for tree-hypercube networks.	SAC	1998	DBLP DOI BibTeX RDF	point-to-point routing, interconnection networks, parallel systems
1	Evangelos Kranakis, Danny Krizanc	Distributed Computing on Anonymous Hypercube Networks.	J. Algorithms	1997	DBLP DOI BibTeX RDF
1	Trevor Williams, Jack Tan, Chungti Liang	Efficient implementation strategies for the DRB approach in fault-tolerant hypercubes. (PDF / PS)	COMPSAC	1997	DBLP DOI BibTeX RDF	distributed recovery block approach, fault-tolerant hypercubes, application tasks graph, processor nodes, primary cost factors, dilation bound, expansion factor, DRB approach, spare processors, hypercube networks, congestion, real-time applications, software faults, implementation strategies, hardware faults
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
1	Nak-Keun Joo, Hyeong-Seok Lim	A new interconnection network for parallel computer with low diameter. (PDF / PS)	ICPADS	1997	DBLP DOI BibTeX RDF	low diameter, graycube, dialation 2, hypercube embedding, routing, parallel computer, interconnection network, hypercube networks, broadcasting algorithms, recursive structure
1	Sook-Yeon Kim, Kyung-Yong Chwa	Optimal embeddings of multiple graphs into a hypermesh. (PDF / PS)	ICPADS	1997	DBLP DOI BibTeX RDF	optimal embeddings, multiple graphs, hypermesh, versatile parallel architecture, 2-dimensional mesh, linear connection, hyper-edge, labeling strategy, optimal expansion, N-node graph, hypercube, hypercube networks, congestion, torus, dilation
1	Jie Wu, Eduardo B. Fernández, Yingquiu Luo	Embedding of binomial trees in hypercubes with link faults. (PDF / PS)	ICPP	1997	DBLP DOI BibTeX RDF	binomial trees embedding, variable roots, faulty links, n-level binomial tree, spanning binomial trees, fault tolerance property, reduction operations, binomial tree structure, performance, broadcasting, hypercubes, hypercube networks, n-cubes, link faults
1	Chien-Ping Chang, Ting-Yi Sung, Lih-Hsing Hsu	A new shortest path routing algorithm and embedding cycles of crossed cube.	ISPAN	1997	DBLP DOI BibTeX RDF	embedding cycles, CQ/sub n/, n-dimensional crossed cube, pancyclic network, hypercubes, hypercube networks, shortest path routing, crossed cube
1	Chi-Chang Chen, Jianer Chen	Nearly Optimal One-To-Many Parallel Routing in Star Networks. (PDF / PS)	IPPS	1997	DBLP DOI BibTeX RDF
1	Michael Mitzenmacher	Constant Time per Edge is Optimal on Rooted Tree Networks.	Distributed Computing	1997	DBLP DOI BibTeX RDF	Increasing convex ordering, Queueing theory, Tree networks, Stochastic comparisons
1	Sang Kyun Yun, Kyu Ho Park	Hierarchical Hypercube Networks (HHN) for Massively Parallel Computers.	J. Parallel Distrib. Comput.	1996	DBLP DOI BibTeX RDF
1	Ge-Ming Chiu, Kai-Shung Chen	Fault-tolerant routing strategy using routing capability in hypercube multicomputers. (PDF / PS)	ICPADS	1996	DBLP DOI BibTeX RDF	fault-tolerant routing strategy, routing capability, feasible minimum paths, fault tolerant computing, message passing, hypercube networks, upper bound, network routing, message routing, link failures, shortest path routing, hypercube multicomputers, faulty hypercube
1	Qian-Ping Gu, Shietung Peng	An efficient algorithm for set-to-set node-disjoint paths problem in hypercubes. (PDF / PS)	ICPADS	1996	DBLP DOI BibTeX RDF	set-to-set node-disjoint paths, interconnection networks, graph theory, hypercubes, Graph algorithms, hypercube networks, undirect graphs, node-disjoint paths
1	Yu-Hua Lee, Shi-Jinn Horng	Fast parallel chessboard distance transform algorithms. (PDF / PS)	ICPADS	1996	DBLP DOI BibTeX RDF	fast parallel chessboard distance transform algorithms, diagonal propagation approach, O(N2) time sequential algorithm, 2-D binary image array, parallel algorithms, computational complexity, image processing, computational geometry, hypercube networks, medial axis transform, EREW PRAM model, hypercube computer, CRCW PRAM model
1	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
1	Yeimkuan Chang	Partitionability of the Multistage Interconnection Networks. (PDF / PS)	IPPS	1996	DBLP DOI BibTeX RDF	network partitionability, physically independent subsystems, communication interference, permutation functions, mapping scheme, hypercube structure, fault tolerance, parallel architectures, fault tolerant computing, hypercube networks, multistage interconnection networks, multistage interconnection networks, MIN, switches
1	Mounir Hamdi, Siang W. Song	On Embedding Various Networks into the Hypercube Using Matrix Transformations. (PDF / PS)	IPPS	1996	DBLP DOI BibTeX RDF	matrix transformations, binary n-cube, r-ary m-cubes, reflected Gray code, parallel algorithms, parallel algorithms, parallel architectures, hypercube, problem solving, hypercube networks, matrix algebra, dilation, Gray codes, divide and conquer methods, embedding method, divide-and-conquer algorithms
1	Hiroyuki Hashimoto, Hiroshi Masuyama, Toshihiko Sasama	Fault tolerant subcube allocation in hypercube.	ISPAN	1996	DBLP DOI BibTeX RDF	subcube allocation, fault-free subcubes, fault tolerant, parallel architectures, fault tolerant computing, hypercube, hypercube networks, degradation, faulty hypercubes
1	Hong Shen	Fault-tolerant multicast with traffic-balancing in hypercubes.	ISPAN	1996	DBLP DOI BibTeX RDF	traffic-balancing, fault-tolerant multicast, fault-tolerant multicasting, computational complexity, parallel architectures, fault tolerant computing, hypercubes, time complexity, hypercube networks, interprocessor communication, hypercube computers
1	John Lloyd	Parallel Formulations of Matrix-Vector Multiplication for Matrices with Large Aspect Ratios.	PDP	1996	DBLP DOI BibTeX RDF	parallel formulations, large aspect ratio matrices, square matrices, square meshes, wraparound connections, parallel algorithms, parallel algorithms, parallel architectures, parallel architectures, partitioning, hypercubes, hypercube networks, matrix multiplication, communication overhead, matrix-vector multiplication
1	Erich Schikuta, Peter Kirkovits	Analysis and Evaluation of Sorting on Hypercube-Based Systems.	PDP	1996	DBLP DOI BibTeX RDF	hypercube-based systems, disk based sorting, parallel merge sort, bitonic sort algorithms, performance, parallel algorithms, benchmark, distributed databases, sorting, sorting, database theory, hypercube networks, software performance evaluation, merging, parallel database systems, database operations
1	Fouzia Moussouni, Christian Lavault	Distributed String Matching Algorithm on the N-cube.	Euro-Par, Vol. I	1996	DBLP DOI BibTeX RDF
1	Daniel G. Rice, José G. Delgado-Frias, Douglas H. Summerville	A Pattern-Associative Router for Adaptive Algorithms in Hypercube Networks.	Parallel and Distributed Computing and Systems	1995	DBLP BibTeX RDF
1	Sajal K. Das, Falguni Sarkar	A hypercube algorithm for GVT computation and its application in optimistic parallel simulation.	Annual Simulation Symposium	1995	DBLP DOI BibTeX RDF	GVT computation, optimistic parallel simulation, global virtual time, distributed memory hypercube architecture, 3N messages, logical processors, simulation system, spanning binomial tree, GVT manager, physical processor, hierarchical load balancing, transient messages, parallel algorithms, computational complexity, discrete event simulation, discrete event simulation, memory management, hypercube networks, distributed memory systems, tree data structures, hypercube algorithm
1	Richard Cole, Bruce M. Maggs, Ramesh K. Sitaraman	Routing on Butterfly Networks with Random Faults.	FOCS	1995	DBLP DOI BibTeX RDF	constant probability, reliability, fault tolerant computing, probability, packet switching, routing algorithm, hypercube networks, packet routing, butterfly networks, random faults
1	C. Greg Plaxton	Tight Bounds for a Distributed Selection Game with Applications to Fixed-Connection Machines.	FOCS	1995	DBLP DOI BibTeX RDF	distributed selection game, fixed-connection machines, abstract communication game, hypercubic machine, computational complexity, lower bound, hypercube networks, tight bounds
1	Linda Gardner, Zevi Miller, Dan Pritikin, Ivan Hal Sudborough	Embedding hypercubes into pancake, cycle prefix and substring reversal networks.	HICSS	1995	DBLP DOI BibTeX RDF	hypercube embedding, graph diameter, pancake network, burnt pancake network, cycle prefix network, substring reversal network, low dilation embeddings, graph theory, generators, hypercube networks, Cayley graphs, group theory, star network, symmetric group
1	Sabine R. Öhring, Falguni Sarkar, Sajal K. Das, Dirk H. Hohndel	Cayley graph connected cycles: A new class of fixed-degree interconnection networks.	HICSS	1995	DBLP DOI BibTeX RDF	Cayley graph connected cycles, fixed-degree interconnection networks, vertex-symmetric networks, maximally fault tolerant networks, abelian generator-sets, graph theory, fault tolerant computing, multiprocessor interconnection networks, routing algorithms, hypercube networks, network routing, broadcasting algorithms, cube-connected cycles, average distance
1	Toshinori Yamada, Koji Yamamoto, Shuichi Ueno	Fault-tolerant graphs for hypercubes and tori.	HICSS	1995	DBLP DOI BibTeX RDF	fault-tolerant graphs, fault-tolerant multiprocessor interconnection networks, graph theory, fault tolerant computing, hypercubes, multiprocessor interconnection networks, hypercube networks, subgraph, tori
1	Hiroshi Masuyama, Toshihiko Sasama, Hiroyuki Hashimoto	The maximum dimensional fault-free subcube allocatable in faulty hypercube.	ICCCN	1995	DBLP DOI BibTeX RDF	maximum dimensional fault-free subcube, reconfiguration problem, fault-free (n-2)-subcube, parallel algorithms, hypercube networks, degradation, faulty hypercube, n-cube
1	Ishfaq Ahmad, Yu-Kwong Kwok	A parallel approach for multiprocessor scheduling. (PDF / PS)	IPPS	1995	DBLP DOI BibTeX RDF	parallel approach, low complexity static scheduling, arbitrary network topologies, iPSC/860 hypercube, task graph size, communication-to-computation ratio, target system topology, scheduling, parallel algorithms, parallel algorithm, computational complexity, delays, message passing, multiprocessing systems, network topology, hypercube networks, multiprocessor scheduling, communication delays, task graph, message routing, parallel tasks, message-passing architectures, link contention
1	Marilyn G. Andrews, Mikhail J. Atallah, Danny Z. Chen, D. T. Lee	Parallel algorithms for maximum matching in interval graphs. (PDF / PS)	IPPS	1995	DBLP DOI BibTeX RDF	disjoint intervals, maximum cardinality matchings, hypercube model, unsorted input, sorted input, optimal sequential algorithms, parallel algorithms, parallel algorithms, computational complexity, graph theory, hypercube networks, processors, computation time, interval graphs, maximum matching, EREW PRAM, EREW PRAM model
1	Xiaojun Guan, Richard J. Mural, Edward C. Uberbacher	Sequence comparison on a cluster of workstations using the PVM system. (PDF / PS)	IPPS	1995	DBLP DOI BibTeX RDF	PVM system, molecular biology research, DNA data, Intel iPSC/860 hypercube, Internet servers GRAIL, GENQUEST, Internet, performance, hypercube networks, DNA, cluster of workstations, massively parallel computer, medical computing, sequence comparison, molecular biophysics
1	Guanghua Lin, Nian-Feng Tzeng	Reconfiguration and experiments on a faulty hypercube. (PDF / PS)	IPPS	1995	DBLP DOI BibTeX RDF	Intel iPSC/860, fault-free nodes, fault tolerant computing, reconfiguration, reconfigurable architectures, hypercube networks, faulty hypercube, subcube
1	Amitabh Mishra, Yeimkuan Chang, Laxmi N. Bhuyan, Fabrizio Lombardi	Fault-tolerant sorting in SIMD hypercubes. (PDF / PS)	IPPS	1995	DBLP DOI BibTeX RDF	fault-tolerant sorting, SIMD hypercubes, fault tolerant computing, multiprocessors, sorting, multiprocessing systems, hypercube networks, node failures, radix sort
1	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
1	Hyunmin Park, Dharma P. Agrawal	A novel deadlock-free routing technique for a class of de Bruijn graph based networks. (PDF / PS)	IPPS	1995	DBLP DOI BibTeX RDF	deadlock-free routing technique, de Bruijn graph based networks, maximum message path length, dBCube graph, outcluster channels, cluster-to-cluster path, concurrency control, hypercube networks, virtual channels
1	Xiaodong Wang, Vwani P. Roychowdhury	Minimizing communication overhead for matrix inversion algorithms on hypercubes. (PDF / PS)	IPPS	1995	DBLP DOI BibTeX RDF	matrix inversion algorithms, Gauss-Jordan inversion algorithms, parallel inversion algorithms, MIMD hypercube, parallel algorithms, performance analysis, hypercubes, communication complexity, hypercube networks, minimisation, data partitioning, communication overhead, matrix inversion, interrupt handling, asynchronous message passing
1	Ishfaq Ahmad	Study and Comparison of Bisectional and Hypercube Networks for Dynamic Task Reallocation.	HICSS	1994	DBLP BibTeX RDF
1	Prithviraj Banerjee, Michael Peercy	Design and Evaluation of Hardware Strategies for Reconfiguring Hypercubes and Meshes Under Faults.	IEEE Trans. Computers	1994	DBLP DOI BibTeX RDF	hardware strategies, reconfiguring hypercubes, distributed memory multicomputer architectures, embedding technique, logical links mapping, performance evaluation, virtual machine, discrete event simulation, reconfigurable architectures, hypercube networks, distributed memory systems, trace-driven simulation, performance degradation, reconfiguring meshes
1	Hsing-Lung Chen, Nian-Feng Tzeng	Efficient Resource Placement in Hypercubes Using Multiple-Adjacency Codes.	IEEE Trans. Computers	1994	DBLP DOI BibTeX RDF	multiple-adjacency codes, access contention, parallel algorithms, resource allocation, hypercubes, encoding, hypercube networks, system performance, performance degradation, binary sequences, minimisation of switching nets, Hamming codes, resource placement, linear block codes
1	Rajib K. Das, Krishnendu Mukhopadhyaya, Bhabani P. Sinha	A New Family of Bridged and Twisted Hypercubes.	IEEE Trans. Computers	1994	DBLP DOI BibTeX RDF	routing, hypercubes, interconnection, hypercube networks, bridged, twisting
1	Patrick W. Dowd, Kalyani Bogineni, Khaled A. Aly, James A. Perreault	Addendum to "Hierarchical Scalable Photonic Architectures for High-Performance Processor Interconnection".	IEEE Trans. Computers	1994	DBLP DOI BibTeX RDF	hierarchical scalable photonic architectures, high-performance processor interconnection, all-optical wavelength division multiplexed network, time multiplexed access protocol, static slot assignment, cycle synchronization, hypercube networks, wavelength division multiplexing, bandwidth allocation, optical information processing, distributed shared memory system, processor numbering
1	David A. Hoelzeman, Saïd Bettayeb	On the Genus of Star Graphs.	IEEE Trans. Computers	1994	DBLP DOI BibTeX RDF	genus of star graphs, symmetry properties, fault-tolerant characteristics, maximum vertex degree, reliability, fault tolerant computing, hypercube, hypercube networks
1	T. V. Lakshman, Victor K. Wei	Distributed Computing on Regular Networks with Anonymous Nodes.	IEEE Trans. Computers	1994	DBLP DOI BibTeX RDF	anonymous nodes, communication-delay product, efficiency objective, sumlike operations, finite projective planes, metrically regular graphs, distributed algorithms, distributed algorithms, distributed computing, distributed computations, message passing, hypercubes, hypercube networks, information dissemination, trade-off, message complexity, sparse graphs, regular networks
1	Shahram Latifi, Manju V. Hegde, Morteza Naraghi-Pour	Conditional Connectivity Measures for Large Multiprocessor Systems.	IEEE Trans. Computers	1994	DBLP DOI BibTeX RDF	conditional connectivity, large regular graphs, n-dimensional cube, fault tolerant computing, hypercube, multiprocessing systems, multiprocessor systems, hypercube networks, vertex connectivity
1	Fadi N. Sibai, N. K. Sharma, Abdullah A. Abonamah	Comparison of Reconfiguration Schemes for the C2SC MIN Operating in the Broadcast Mode.	IEEE Trans. Computers	1994	DBLP DOI BibTeX RDF	C2SC MIN, broadcast mode, complementary two-stage cube, multiple-path multistage interconnection networks, destination discriminator, divide and broadcast, decoded routing tag, conservative schemes, cost/performance analysis, reliability, fault tolerant computing, modularity, regularity, synchronisation, reconfigurable architectures, hypercube networks, simulation results, reconfiguration schemes