Search results for "hypercube"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
40	Charalampos Konstantopoulos, Christos Kaklamanis	Optimal hypercube simulation on the partitioned optical passive stars network.	J. Supercomput.	2007	DBLP DOI BibTeX RDF	Partitioned Optical Passive Stars (POPS) network, Network mapping, Routing, Hypercube, Optical networks
40	Stefan Porschen	A CNF Formula Hierarchy over the Hypercube.	Australian Conference on Artificial Intelligence	2007	DBLP DOI BibTeX RDF	hypercube formula, variable closure, satisfiability, hypergraph, transversal
40	Alessandro Mei, Romeo Rizzi	Hypercube Computations on Partitioned Optical Passive Stars Networks.	IEEE Trans. Parallel Distributed Syst.	2006	DBLP DOI BibTeX RDF	partitioned optical passive stars network, hypercube simulation, Parallel architectures, permutation routing, prefix sums
40	Yawen Chen 0001, Hong Shen 0001, Haibo Zhang 0001	Hypercube Communications on Optical Chordal Ring Networks with Chord Length of Three.	Asia-Pacific Computer Systems Architecture Conference	2006	DBLP DOI BibTeX RDF	hypercube communication, Wavelength Division Multiplexing (WDM), routing and wavelength assignment(RWA), chordal ring
40	Lei Wang 0015, Zhiping Chen 0002, Xinhua H. Jiang	Ringed Petersen Spheres Connected Hypercube Interconnection Networks.	ICECCS	2005	DBLP DOI BibTeX RDF	Petersen graph, Interconnection Networks, Hypercube, Ring
40	Gene Eu Jan, Yuan-Shin Hwang	An Efficient Algorithm for Perfect Load Balancing on Hypercube Multiprocessors.	J. Supercomput.	2003	DBLP DOI BibTeX RDF	dimension exchange, regular distributions, token distribution problem, load balancing, multiprocessors, hypercube
40	Luis Díaz de Cerio, Miguel Valero-García, Antonio González 0001	Hypercube Algorithms on Mesh Connected Multicomputers.	IEEE Trans. Parallel Distributed Syst.	2002	DBLP DOI BibTeX RDF	mesh interconnected multicomputers, standard embedding, communication pipelining, message-scheduling algorithms, Mapping algorithms, complete exchange, hypercube algorithms
40	Xiaolin Li 0001, Bharadwaj Veeravalli, Chi Chung Ko	Divisible Load Scheduling on a Hypercube Cluster with Finite-Size Buffers and Granularity Constraints.	CCGRID	2001	DBLP DOI BibTeX RDF	finite-size buffer, hypercube, granularity, communication delays, Divisible load theory
40	Guihai Chen, Francis C. M. Lau 0001	Shuffle-Ring: Overcoming the Increasing Degree of Hypercube.	HPCA	1996	DBLP DOI BibTeX RDF	r-Shuffle, Fault Tolerance, Interconnection Network, Hypercube, Layout
40	Yi-Long Chen, Jyh-Charn Liu	A Fault-Tolerant Distributed Subcube Management Scheme for Hypercube Multicomputer Systems.	IEEE Trans. Parallel Distributed Syst.	1995	DBLP DOI BibTeX RDF	Distributed subcube management, fault-tolerance, hypercube multicomputer, reliable broadcast
40	Christine Rüb	Lower Bounds for Merging on the Hypercube.	CIAC	1994	DBLP DOI BibTeX RDF	Lower bounds, Hypercube, Sorting, Merging
40	Zhiyong Liu, Jia-Huai You	Increasing Communication Bandwidth on Hypercube.	ICCI	1991	DBLP DOI BibTeX RDF	complexity, interconnection network, hypercube, permutations, Parallel and distributed processing, communication bandwidth
40	Abdou Youssef, Bhagirath Narahari	The Banyan-Hypercube Networks.	IEEE Trans. Parallel Distributed 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
39	Guo-Huang Hsu, Jimmy J. M. Tan	A Local Diagnosability Measure for Multiprocessor Systems.	IEEE Trans. Parallel Distributed Syst.	2007	DBLP DOI BibTeX RDF	local diagnosability, strong local diagnosability property, PMC model
39	Abbas Eslami Kiasari, Hamid Sarbazi-Azad	A comparative performance analysis of n-cubes and star graphs.	IPDPS	2006	DBLP DOI BibTeX RDF
39	Dajin Wang	An Algorithm to Embed Hamiltonian Cycles in Crossed Cubes.	PARELEC	2006	DBLP DOI BibTeX RDF
39	Pedro A. Diaz-Gomez, Dean F. Hougen	The snake in the box problem: mathematical conjecture and a genetic algorithm approach.	GECCO	2006	DBLP DOI BibTeX RDF	genetic algorithms, hypercubes
39	Jie Wu 0001	Extended Fibonacci Cubes.	IEEE Trans. Parallel Distributed Syst.	1997	DBLP DOI BibTeX RDF	hypercubes, graph embedding, interconnection topologies, Fibonacci numbers, Hamiltonian graphs
39	Yu-Hua Lee, Shi-Jinn Horng	Fast parallel chessboard distance transform algorithms.	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
39	Hong Shen 0001	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
39	Linda Gardner, Zevi Miller, Dan Pritikin, Ivan Hal Sudborough	Embedding hypercubes into pancake, cycle prefix and substring reversal networks.	HICSS (2)	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
39	Sing-Ban Tien, Cauligi S. Raghavendra	Algorithms and Bounds for Shortest Paths and Diameter in Faulty Hypercubes.	IEEE Trans. Parallel Distributed Syst.	1993	DBLP DOI BibTeX RDF	n-dimensional hypercube, parallel algorithms, computational complexity, complexity, fault tolerant computing, shortest paths, hypercube networks, diameter, bounds, faulty hypercubes
39	Ling Tony Chen, Larry S. Davis, Clyde P. Kruskal	Efficient Parallel Processing of Image Contours.	IEEE Trans. Pattern Anal. Mach. Intell.	1993	DBLP DOI BibTeX RDF	EREW model, CREW PRAM model, segmented scan operations, computer vision, computer vision, parallel algorithms, parallel algorithms, computational complexity, image processing, parallel processing, parallel processing, hypercube, hypercube networks, image contours, Connection Machine
36	Song Lu, Xiaodong Yang 0002	A Clustering Model for Multicast on Hypercube Network.	GPC	2008	DBLP DOI BibTeX RDF
36	John T. Rickard, Ronald R. Yager	Hypercube Graph Representations and Fuzzy Measures of Graph Properties.	IEEE Trans. Fuzzy Syst.	2007	DBLP DOI BibTeX RDF
36	Nghi H. Tran, Ha H. Nguyen 0001	Design and performance of BICM-ID systems with hypercube constellations.	IEEE Trans. Wirel. Commun.	2006	DBLP DOI BibTeX RDF
36	Christos Kaklamanis, Charalampos Konstantopoulos	Optimal Embedding of the Hypercube on Partitioned Optical Passive Stars Networks.	Euro-Par	2005	DBLP DOI BibTeX RDF
36	Shane S. Drew, Tito Homem-de-Mello	Some large deviations results for Latin hypercube sampling.	WSC	2005	DBLP DOI BibTeX RDF
36	Shaohuai Tian, Yingping Lu, Dafang Zhang	Optimal Fault-Tolerant Routing Scheme for Generalized Hypercube.	PRDC	2005	DBLP DOI BibTeX RDF
36	Pooya Shareghi, Hamid Sarbazi-Azad	The Stretched-Hypercube: A VLSI Efficient Network Topology.	ISPAN	2005	DBLP DOI BibTeX RDF
36	Hashem Hashemi Najaf-abadi, Hamid Sarbazi-Azad	Comparative Evaluation of Adaptive and Deterministic Routing in the OTIS-Hypercube.	Asia-Pacific Computer Systems Architecture Conference	2004	DBLP DOI BibTeX RDF
36	Chao-Tsun Chang, Chih-Yung Chang, Jang-Ping Sheu	BlueCube: Constructing a Hypercube Parallel Computing and Communication Environment over Bluetooth Radio System.	ICPP	2003	DBLP DOI BibTeX RDF
36	Roy Friedman, Shiri Manor, Katherine Guo	Scalable Stability Detection Using Logical Hypercube.	IEEE Trans. Parallel Distributed Syst.	2002	DBLP DOI BibTeX RDF	Distributed systems, scalability, group communication, reliable multicast
36	Ramesh A. Dandekar, Michael Cohen, Nancy Kirkendall	Sensitive Micro Data Protection Using Latin Hypercube Sampling Technique.	Inference Control in Statistical Databases	2002	DBLP DOI BibTeX RDF
36	Mitsunori Ogihara, Seinosuke Toda	The Complexity of Computing the Number of Self-Avoiding Walks in Two-Dimensional Grid Graphs and in Hypercube Graphs.	MFCS	2001	DBLP DOI BibTeX RDF
36	Hwakyung Rim, Ju-wook Jang, Sung-Chun Kim	An Efficient Dynamic Load Balancing using the Dimension Exchange Method for Balancing of Quantized Loads on Hypercube Multiprocessors.	IPPS/SPDP	1999	DBLP DOI BibTeX RDF
36	Roy Friedman, Shiri Manor, Katherine Guo	Scalable Stability Detection using Logical Hypercube.	SRDS	1999	DBLP DOI BibTeX RDF
36	Sajal K. Das 0001, Maria Cristina Pinotti	O(log log N) Time Algorithms for Hamiltonian-Suffix and Min-Max-Pair Heap Operations on Hypercube Multicomputers.	IPPS	1997	DBLP DOI BibTeX RDF
36	Alfredo Goldman, Denis Trystram	An Efficient Parallel Algorithm for Solving the Knapsack Problem on the Hypercube.	IPPS	1997	DBLP DOI BibTeX RDF
36	Qian-Ping Gu, Hisao Tamaki	Routing a Permutation in the Hypercube by Two Sets of Edge-Disjoint Paths.	IPPS	1996	DBLP DOI BibTeX RDF	algorithm, Permutation routing, edge-disjoint paths, circuit-switched networks
36	Cevdet Aykanat, Argun Dervis	Efficient Fast Hartley Transform Algorithms for Hypercube-Connected Multicomputers.	IEEE Trans. Parallel Distributed Syst.	1995	DBLP DOI BibTeX RDF
36	Derek C. W. Pao, W. N. Chau	Design of ATM switch using hypercube with distributed shared input buffers and dedicated output buffers.	ICNP	1995	DBLP DOI BibTeX RDF
36	Alan S. Wagner	Embedding all binary trees in the hypercube.	SPDP	1991	DBLP DOI BibTeX RDF
36	Suresh Rai, Jerry L. Trahan	ATARIC: an algebraic technique to analyse reconfiguration for fault tolerance in a hypercube.	SPDP	1991	DBLP DOI BibTeX RDF
36	Frank K. H. A. Dehne, Michel Gastaldo	A Note on the Load Balancing Problem for Coarse Grained Hypercube Dictionary Machines.	CONPAR	1990	DBLP DOI BibTeX RDF
36	Tsair-Chin Lin, Praveen Gupta	Higher Radix Hypercube as an Interconnection and Virtual Network.	ACM Conference on Computer Science	1989	DBLP DOI BibTeX RDF
35	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
35	Bing-rung Tsai, Kang G. Shin	Assignment of Task Modules in Hypercube Multicomputers with Component Failures for Communication Efficiency.	IEEE Trans. Computers	1994	DBLP DOI BibTeX RDF	task modules, indirect optimization, communication turnaround time, optimization, performance measure, hypercube networks, telecommunication traffic, communication cost, fault-tolerant routing, task assignment, NP hard problem, link failures, hypercube multicomputers, communication efficiency, component failures, communication traffic
35	Qing Yang 0001, Hong Wang 0003	A New Graph Approach to Minimizing Processor Fragmentation in Hypercube Multiprocessors.	IEEE Trans. Parallel Distributed Syst.	1993	DBLP DOI BibTeX RDF	graph approach, minimizing processor fragmentation, primecube graph, simulation, performance evaluation, multiprocessing systems, hypercube networks, digital simulation, hypercube multiprocessors
35	Tze Chiang Lee, John P. Hayes	A Fault-Tolerant Communication Scheme for Hypercube Computers.	IEEE Trans. Computers	1992	DBLP DOI BibTeX RDF	fault-tolerant communication scheme, near-optimal routing, fault-free nodes, computationally efficient routing algorithm, deadlock-free implementations, parallel architectures, fault tolerant computing, broadcasting, hypercube networks, node failures, hypercube computers
35	Krishna P. Belkhale, Prithviraj Banerjee	Parallel Algorithms for Geometric Connected Component Labeling on a Hypercube Multiprocessor.	IEEE Trans. Computers	1992	DBLP DOI BibTeX RDF	geometric connected component labeling, merging problem, parallel algorithms, parallel algorithms, complexity, computational geometry, hypercube networks, run time, memory requirements, hypercube multiprocessor
35	Po-Jen Chuang, Nian-Feng Tzeng	A Fast Recognition-Complete Processor Allocation Strategy for Hypercube Computers.	IEEE Trans. Computers	1992	DBLP DOI BibTeX RDF	processor allocation strategy, binary tree representations, complete subcube recognition, performance evaluation, computational complexity, resource allocation, performance measures, hypercube networks, hypercube computers, allocation strategies
35	Pierre Fraigniaud	Asymptotically Optimal Broadcasting and Gossiping in Faulty Hypercube Multicomputers.	IEEE Trans. Computers	1992	DBLP DOI BibTeX RDF	asymptotically optimal broadcasting, faulty hypercube multicomputers, store-and-forward model, computational complexity, fault tolerant computing, hypercube networks, gossiping, disjoint paths, faulty nodes
35	Patrick W. Dowd	Wavelength Division Multiple Access Channel Hypercube Processor Interconnection.	IEEE Trans. Computers	1992	DBLP DOI BibTeX RDF	wavelength division multiple access channel, hypercube-based structure, optical multiple access channels, star-coupled configurations, optical self-routing characteristic, optical fibres, performance, performance analysis, parallel architectures, computer networks, multiprocessor interconnection networks, hypercube networks, wavelength division multiplexing, optical communication, optical communication, system complexity
35	Edward Omiecinski, Eileen Tien Lin	The Adaptive-Hash Join Algorithm for a Hypercube Multicomputer.	IEEE Trans. Parallel Distributed Syst.	1992	DBLP DOI BibTeX RDF	adaptive-hash join algorithm, hybrid-hash, parallel algorithms, hypercube networks, file organisation, nested-loop, hypercube multicomputer
35	Kemal Efe	A Variation on the Hypercube with Lower Diameter.	IEEE Trans. Computers	1991	DBLP DOI BibTeX RDF	distributed-memory parallel computer architectures, large vertex connectivity, link complexity, routing, parallel architectures, hypercube, regularity, hypercube networks, broadcasting algorithms, interconnection structure
35	Guan-Ing Chen, Ten-Hwang Lai, Yao-Nan Lien	A Note on "Generalized Hypercube and Hyperbus Structures for a Computer Network".	IEEE Trans. Computers	1991	DBLP DOI BibTeX RDF	hyperbus structures, least-cost generalized hypercube, computer network, computer networks, hypercube networks, switching theory
35	Prithviraj Banerjee, Joseph T. Rahmeh, Craig B. Stunkel, V. S. S. Nair, Kaushik Roy 0001, Vijay Balasubramanian, Jacob A. Abraham	Algorithm-Based Fault Tolerance on a Hypercube Multiprocessor.	IEEE Trans. Computers	1990	DBLP DOI BibTeX RDF	Intel iPSC hypercube, fault tolerance, parallel architectures, fault tolerant computing, fast Fourier transform, multiprocessing systems, error detection, matrix multiplication, Gaussian elimination, multiprocessor architecture, hypercube multiprocessor, faulty processors
35	Jianxi Fan, Xiaola Lin	The t/k-Diagnosability of the BC Graphs.	IEEE Trans. Computers	2005	DBLP DOI BibTeX RDF	precise diagnosis strategy, pessimistic diagnosis strategy, t/k-diagnosis strategy, BC graph, Möbius cube, hypercube, Diagnosis, diagnosability, crossed cube, twisted cube
35	Evangelos Kranakis, Andrzej Pelc	Better Adaptive Diagnosis of Hypercubes.	IEEE Trans. Computers	2000	DBLP DOI BibTeX RDF	test, hypercube, fault, Adaptive diagnosis
35	Feng Gao, Zhongcheng Li	Fault-Tolerant Routing Algorithms Based on Optimal Path Matrices.	PRDC	1999	DBLP DOI BibTeX RDF	optimal path matrices, information pre-collecting, fault-tolerant routing, hypercube multicomputers, dynamical learning
35	Feng-Shr Jiang, Shi-Jinn Horng, Tzong-Wann Kao	Embedding of Generalized Fibonacci Cubes in Hypercubes with Faulty Nodes.	IEEE Trans. Parallel Distributed Syst.	1997	DBLP DOI BibTeX RDF	Direct embedding, generalized Fibonacci cubes, second-order Fibonacci cube, fault-tolerant, hypercubes, faulty hypercube
35	Hal Burch, Fikret Erçal	A Fast Algorithm for Complete Subcube Recognition.	ISPAN	1997	DBLP DOI BibTeX RDF	complete subcube recognition, order of complexity, parallel algorithms, processor allocation, hypercube topology
35	Khaled Day, Anand R. Tripathi	A Comparative Study of Topological Properties of Hypercubes and Star Graphs.	IEEE Trans. Parallel Distributed Syst.	1994	DBLP DOI BibTeX RDF	networktopology, interconnection network topologies, comparativestudy, parallel paths, asymptotically balanced, balanced spanning trees, graph theory, graph theory, hypercubes, multiprocessor interconnection networks, hypercube networks, spanning trees, star graphs, greedy
35	Anshul Gupta, Vipin Kumar 0001	The Scalability of FFT on Parallel Computers.	IEEE Trans. Parallel Distributed Syst.	1993	DBLP DOI BibTeX RDF	isoefficiency metric, problem size, Cooley-Tukey FFT algorithm, SIMDhypercube, parallel algorithms, scalability, parallel computers, hypercube, mesh, FFT, fast Fourier transforms, multicomputers, shared memory architecture, parallel fast Fourier transform
35	Evangelos Kranakis, Nicola Santoro	Distributed Computing on Anonymous Hypercubes with Faulty Components (Extended Abstract).	WDAG	1992	DBLP DOI BibTeX RDF	Anonymous labeled hypercube, faulty component, group of automorphisms, boolean function, diameter
32	Zhu Haibo	Analysis of Electronic Innovation of Securities Trading in China using a Hypercube Model.	ISECS	2008	DBLP DOI BibTeX RDF	Securities Trading, Hypercube Model, Innovation
32	HaiBo Zhu, Ying Zou 0012	Analysis of E-bank Innovation in China Using a Hypercube Model.	ACIS-ICIS	2008	DBLP DOI BibTeX RDF	Tele-bank, Hypercube model, Innovation, Internet bank, E-bank, Mobile bank
32	Antonia Gallardo, Luis Díaz de Cerio, Kana Sanjeevan	Self-configuring Resource Discovery on a Hypercube Grid Overlay.	Euro-Par	2008	DBLP DOI BibTeX RDF	Static resilience, Grid resource discovery, Self-configuring algorithm, Fault-tolerance, Hypercube
32	Lee-Juan Fan, Chang-Biau Yang, Shyue-Horng Shiau	Routing Algorithms on the Bus-Based Hypercube Network.	IEEE Trans. Parallel Distributed Syst.	2005	DBLP DOI BibTeX RDF	Multiple-bus network, fault tolerance, hypercube, routing algorithm, diameter
32	Gennady Veselovsky, Dobri Atanassov Batovski	A Study of the Permutation Capability of a Binary Hypercube under Deterministic Dimension-order Routing.	PDP	2003	DBLP DOI BibTeX RDF	binary hypercube, conflict-free routing, permutation capability, dimension-order routing
32	Micah Adler, Eran Halperin, Richard M. Karp, Vijay V. Vazirani	A stochastic process on the hypercube with applications to peer-to-peer networks.	STOC	2003	DBLP DOI BibTeX RDF	coupon collector, peer to peer, load balancing, hypercube, hash table
32	Hung Quang Ngo, Ding-Zhu Du, Ronald L. Graham	New Bounds on a Hypercube Coloring Problem and Linear Codes.	ITCC	2001	DBLP DOI BibTeX RDF	hypercube, coloring, linear codes
32	Moonsoo Kang, Chansu Yu	Job-Based Queue Delay Modeling in a Space-Shared Hypercube.	ICPP Workshops	1999	DBLP DOI BibTeX RDF	topological delay, processor allocation, space sharing, queue delay, Hypercube computer
32	Oh-Heum Kwon, Kyung-Yong Chwa	An Algorithm for Scheduling Jobs in Hypercube Systems.	IEEE Trans. Parallel Distributed Syst.	1998	DBLP DOI BibTeX RDF	subcube allocation, absolute performance ratio, approximation algorithm, job scheduling, Hypercube systems
32	Feng-Hsu Wang, Ferng-Ching Lin	On Routing Maskable Messages in Hypercube-Derived Multistage Interconnection Networks.	IEEE Trans. Parallel Distributed Syst.	1997	DBLP DOI BibTeX RDF	hypercube-derived multistage interconnection networks, network cycles, $left({_d^s} right)hbox{-}$masks, Circuit switching, message routing
32	Debendra Das Sharma, Dhiraj K. Pradhan	Processor Allocation in Hypercube Multicomputers: Fast and Efficient Strategies for Cubic and Noncubic Allocation.	IEEE Trans. Parallel Distributed Syst.	1995	DBLP DOI BibTeX RDF	Cubic allocation, deallocation, dynamic binary tree, noncubic allocation, hypercube, fragmentation
32	Qutaibah M. Malluhi, Magdy A. Bayoumi	The Hierarchical Hypercube: A New Interconnection Topology for Massively Parallel Systems.	IEEE Trans. Parallel Distributed Syst.	1994	DBLP DOI BibTeX RDF	hierarchicalhypercube, logarithmic diameter, one-to-one transfer, divide &conquer class, performance, parallel algorithms, computational complexity, parallels, time complexity, hypercube networks, symmetry, massively parallel systems, interconnection topology, one-to-all broadcasting
32	Joseph F. JáJá, Kwan Woo Ryu	Optimal Algorithms on the Pipelined Hypercube and Related Networks.	IEEE Trans. Parallel Distributed Syst.	1993	DBLP DOI BibTeX RDF	pipelined hypercube, monotone polygon, line packing, parallel algorithms, parallel algorithms, computational geometry, pipeline processing, combinatorial problems, combinatorial mathematics, cube-connected-cycles, shuffle-exchange
32	Pierre Fraigniaud	Fault-Tolerant Gossiping on Hypercube Multicomputers.	EDMCC	1991	DBLP DOI BibTeX RDF	fault tolerance, hypercube, time complexity, Gossiping, Total Exchange
32	A. L. Narasimha Reddy, Prithviraj Banerjee	Design, Analysis, and Simulation of I/O Architectures for Hypercube.	IEEE Trans. Parallel Distributed Syst.	1990	DBLP DOI BibTeX RDF	I/O architectures, I/O access, disk organizations, scientific workload, performance evaluation, parallelism, data structures, parallel architectures, multiprocessor interconnection networks, multiprocessing systems, memory architecture, matrices, hypercube multiprocessors, multiprocessor network
32	Ming-Syan Chen, Kang G. Shin	Depth-First Search Approach for Fault-Tolerant Routing in Hypercube.	IEEE Trans. Parallel Distributed Syst.	1990	DBLP DOI BibTeX RDF	obstructed node, performance evaluation, performance, fault tolerant computing, multiprocessor interconnection networks, multiprocessing systems, Hamming distance, fault-tolerant routing, depth-first search, hypercube multicomputers, destination node, component failures
32	Vijay Balasubramanian, Prithviraj Banerjee	Tradeoffs in the Design of Efficient Algorithm-Based Error Detection Schemes for Hypercube Multiprocessors.	IEEE Trans. Software Eng.	1990	DBLP DOI BibTeX RDF	algorithm-based error detection, 16-processor Intel iPSC-2/D4/MX, software engineering, multiprocessing systems, error detection, encoding, encoding, linear algebra, QR factorization, numerical linear algebra, hypercube multiprocessors, sum-of-squares, checksum
32	Viktor K. Prasanna, Venkatesh Krishnan	Efficient Parallel Algorithms for Image Template Matching on Hypercube SIMD Machines.	IEEE Trans. Pattern Anal. Mach. Intell.	1989	DBLP DOI BibTeX RDF	image template matching, hypercube SIMD machines, parallel algorithms, parallel algorithms, computational complexity, computerised picture processing, computerised picture processing, computerised pattern recognition, computerised pattern recognition, time complexities, bounds
31	Sina Meraji, Abbas Nayebi, Hamid Sarbazi-Azad	Empirical Performance Evaluation of Adaptive Routing in Necklace Hypercubes: A Comparative Study.	ICCTA	2007	DBLP DOI BibTeX RDF
31	Sina Meraji, Hamid Sarbazi-Azad, Ahmad Patooghy	Performance Modelling of Necklace Hypercubes.	IPDPS	2007	DBLP DOI BibTeX RDF
31	Sina Meraji, Abbas Nayebi, Hamid Sarbazi-Azad	Simulation-Based Performance Evaluation of Deterministic Routing in Necklace Hypercubes.	AICCSA	2007	DBLP DOI BibTeX RDF
31	Po-Jen Chuang, Bo-Yi Li, Tun-Hao Chao	Efficient Data Gathering Schemes for Wireless Sensor Networks.	MSN	2005	DBLP DOI BibTeX RDF
31	Omer Angel, Itai Benjamini, Eran Ofek, Udi Wieder	Routing complexity of faulty networks.	PODC	2005	DBLP DOI BibTeX RDF	fault tolerance, routing, random graphs, percolation
31	Hyosun Ko, Shahram Latifi, Pradip K. Srimani	Near-Optimal Broadcast in All-Port Wormhole-Routed Hypercubes Using Error-Correcting Codes.	IEEE Trans. Parallel Distributed Syst.	2000	DBLP DOI BibTeX RDF	multicasting, Broadcasting, hypercubes, wormhole routing, hamming codes, perfect codes
31	Cheng-Nan Lai, Gen-Huey Chen, Dyi-Rong Duh	Optimal One-to-Many Disjoint Paths in Folded Hypercubes.	ISPAN	2000	DBLP DOI BibTeX RDF
31	Hsing-Lung Chen, Nian-Feng Tzeng	A Boolean Expression-Based Approach for Maximum Incomplete Subcube Identification in Faulty Hypercubes.	IEEE Trans. Parallel Distributed Syst.	1997	DBLP DOI BibTeX RDF	incomplete subcubes, distributed algorithms, reconfiguration, Boolean expressions, faulty hypercubes
31	Kanad Ghose, Kiran Raghavendra Desai	Hierarchical Cubic Networks.	IEEE Trans. Parallel Distributed Syst.	1995	DBLP DOI BibTeX RDF
31	Selim G. Akl, Ke Qiu 0001	Parallel Minimum Spanning Forest Algorithms on the Star and Pancake Interconnection Networks.	CONPAR	1992	DBLP DOI BibTeX RDF
31	Alexander Wang, Robert Cypher, Ernst W. Mayr	Embedding complete binary trees in faulty hypercubes.	SPDP	1991	DBLP DOI BibTeX RDF
31	John L. Gustafson	Reevaluating Amdahl's Law.	Commun. ACM	1988	DBLP DOI BibTeX RDF
31	Laurence E. LaForge, Kirk F. Korver, M. Sami Fadali	What Designers of Bus and Network Architectures Should Know about Hypercubes.	IEEE Trans. Computers	2003	DBLP DOI BibTeX RDF	Hypercube fault tolerance, hypercube latency, Hamming graphs, K-cubes, Moore graphs, Moore Bound, C-cubes, performability, quorums, configuration architectures, Lee distance
31	Sook-Yeon Kim, Kyung-Yong Chwa	Optimal embeddings of multiple graphs into a hypermesh.	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
31	Yeimkuan Chang	Partitionability of the Multistage Interconnection Networks.	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
31	Ishfaq Ahmad, Yu-Kwong Kwok	A parallel approach for multiprocessor scheduling.	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