Results 1  10
of
18,773
Routing Permutations and 21 Routing Requests in the Hypercube
, 2000
"... Let H n be the directed symmetric ndimensional hypercube. Using the computer, we show that for any permutation of the vertices of H 4 , there exists a system of pairwise arcdisjoint directed paths from each vertex to its target in the permutation. This veries Szymanski's conjecture [8] for n ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Let H n be the directed symmetric ndimensional hypercube. Using the computer, we show that for any permutation of the vertices of H 4 , there exists a system of pairwise arcdisjoint directed paths from each vertex to its target in the permutation. This veries Szymanski's conjecture [8] for n
Routing Permutations in the Hypercube
, 1999
"... We study an ndimensional directed symmetric hypercube Hn , in which every pair of adjacent vertices is connected by two arcs of opposite directions. Using the computer, we show that for H4 and for any permutation on its vertices, there exists a system of pairwise arcdisjoint directed paths from ea ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
each vertex to its target in the permutation. This gives the answer to Szymanski's conjecture [Szy89] for dimension 4. In addition to this study, we consider in Hn the socalled 21 routing requests, that is routing requests where any vertex of Hn can be used twice as a source, but only once as a
A Review of Current Routing Protocols for AdHoc Mobile Wireless Networks
"... An adhoc mobile network is a collection of mobile nodes that are dynamically and arbitrarily located in such a manner that the interconnections between nodes are capable of changing on a continual basis. In order to facilitate communication within the network, a routing protocol is used to discove ..."
Abstract

Cited by 1261 (3 self)
 Add to MetaCart
An adhoc mobile network is a collection of mobile nodes that are dynamically and arbitrarily located in such a manner that the interconnections between nodes are capable of changing on a continual basis. In order to facilitate communication within the network, a routing protocol is used
Permutation Routing in the Hypercube and Grid Topologies
, 2005
"... The problem of edgedisjoint path routing arises from applications in distributed memory parallel computing. We examine this problem in both the directed hypercube and twodimensional grid topologies. Complexity results are obtained for these problems where the routing must consist entirely of short ..."
Abstract
 Add to MetaCart
of shortestlength paths. Additionally, approximation algorithms are presented for the case when the routing request is of a special form known as a permutation. Permutations simply require that no vertex in the graph may be used more than once as either a source or target for a routing request. Szymanski
Using Linear Algebra for Intelligent Information Retrieval
 SIAM REVIEW
, 1995
"... Currently, most approaches to retrieving textual materials from scientific databases depend on a lexical match between words in users' requests and those in or assigned to documents in a database. Because of the tremendous diversity in the words people use to describe the same document, lexical ..."
Abstract

Cited by 672 (18 self)
 Add to MetaCart
Currently, most approaches to retrieving textual materials from scientific databases depend on a lexical match between words in users' requests and those in or assigned to documents in a database. Because of the tremendous diversity in the words people use to describe the same document
Optimal Routing of Parentheses on the Hypercube
 IN PROCEEDINGS OF THE SYMPOSIUM ON PARALLEL ARCHITECTURES AND ALGORITHMS
, 1994
"... We consider a new class of routing requests or partial permutations for which we give optimal online routing algorithms on the hypercube and shuffleexchange network. For wellformed words of parentheses our algorithm establishes communication between all matching pairs in logarithmic time. It can ..."
Abstract

Cited by 15 (6 self)
 Add to MetaCart
We consider a new class of routing requests or partial permutations for which we give optimal online routing algorithms on the hypercube and shuffleexchange network. For wellformed words of parentheses our algorithm establishes communication between all matching pairs in logarithmic time
UNet: A UserLevel Network Interface for Parallel and Distributed Computing
 In Fifteenth ACM Symposium on Operating System Principles
, 1995
"... The UNet communication architecture provides processes with a virtual view of a network interface to enable userlevel access to highspeed communication devices. The architecture, implemented on standard workstations using offtheshelf ATM communication hardware, removes the kernel from the communi ..."
Abstract

Cited by 596 (17 self)
 Add to MetaCart
performance equivalent to Meiko CS2 and TMC CM5 supercomputers on a set of SplitC benchmarks. 1
LogP: Towards a Realistic Model of Parallel Computation
, 1993
"... A vast body of theoretical research has focused either on overly simplistic models of parallel computation, notably the PRAM, or overly specific models that have few representatives in the real world. Both kinds of models encourage exploitation of formal loopholes, rather than rewarding developme ..."
Abstract

Cited by 562 (15 self)
 Add to MetaCart
A vast body of theoretical research has focused either on overly simplistic models of parallel computation, notably the PRAM, or overly specific models that have few representatives in the real world. Both kinds of models encourage exploitation of formal loopholes, rather than rewarding development of techniques that yield performance across a range of current and future parallel machines. This paper offers a new parallel machine model, called LogP, that reflects the critical technology trends underlying parallel computers. It is intended to serve as a basis for developing fast, portable parallel algorithms and to offer guidelines to machine designers. Such a model must strike a balance between detail and simplicity in order to reveal important bottlenecks without making analysis of interesting problems intractable. The model is based on four parameters that specify abstractly the computing bandwidth, the communication bandwidth, the communication delay, and the efficiency of coupling communication and computation. Portable parallel algorithms typically adapt to the machine configuration, in terms of these parameters. The utility of the model is demonstrated through examples that are implemented on the CM5.
Fast Parallel Algorithms for ShortRange Molecular Dynamics
 JOURNAL OF COMPUTATIONAL PHYSICS
, 1995
"... Three parallel algorithms for classical molecular dynamics are presented. The first assigns each processor a fixed subset of atoms; the second assigns each a fixed subset of interatomic forces to compute; the third assigns each a fixed spatial region. The algorithms are suitable for molecular dyn ..."
Abstract

Cited by 622 (6 self)
 Add to MetaCart
. The algorithms are tested on a standard LennardJones benchmark problem for system sizes ranging from 500 to 100,000,000 atoms on several parallel supercomputers  the nCUBE 2, Intel iPSC/860 and Paragon, and Cray T3D. Comparing the results to the fastest reported vectorized Cray YMP and C90 algorithm shows
Results 1  10
of
18,773