Sciweavers

352 search results - page 4 / 71
» Parallel Algorithms for Hypercube Allocation
Sort
View
IPPS
2006
IEEE
14 years 1 months ago
Node-disjoint paths in hierarchical hypercube networks
The hierarchical hypercube network is suitable for massively parallel systems. An appealing property of this network is the low number of connections per processor, which can faci...
Ruei-Yu Wu, J. G. Chang, Gen-Huey Chen
IPPS
1999
IEEE
13 years 11 months ago
Fault-Tolerant Routing Algorithms for Hypercube Networks
For hypercube networks which have faulty nodes, a few ecient dynamic routing algorithms have been proposed by allowing each node to hold the status of neighbors. We propose two im...
Keiichi Kaneko, Hideo Ito
IPPS
1997
IEEE
13 years 11 months ago
Adaptive Fault-Tolerant Wormhole Routing Algorithms for Hypercube and Mesh Interconnection
In this paper, we present adaptive fault-tolerant deadlock-free routing algorithms for hypercubes and meshes by using only 3 virtual channels and 2 virtual channels respectively. ...
Jau-Der Shih
STACS
1991
Springer
13 years 11 months ago
Optimal Parallel Recognition of Bracket Languages on Hypercubes
Bracket languages play an important role in the syntax analysis of programming languages. We investigate the parallel recognition and analysis of these languages as a first step ...
Gisela Pitsch, Elmar Schömer
ALGORITHMICA
2000
72views more  ALGORITHMICA 2000»
13 years 7 months ago
Sorting-Based Selection Algorithms for Hypercubic Networks
This paper presents several deterministic algorithms for selecting the kth largest record from a set of n records on any n-node hypercubic network. All of the algorithms are based ...
Pascal Berthomé, Afonso Ferreira, Bruce M. ...