Results 1  10
of
21,213
Bipancyclicity of Hierarchical Hypercube Networks
"... Abstract The hierarchical hypercube network is suitable for massively parallel systems. The number of links in the hierarchical hypercube network forms a compromise between those of the hypercube and the cubeconnected cycles. Recently, some interesting properties of the hierarchical hypercube netw ..."
Abstract
 Add to MetaCart
network were investigated. Since the hierarchical hypercube is bipartite. A bipartite graph is bipancyclic if it contains cycles of every even length from 4 to V(G)  inclusively. In this paper, we show that the hierarchical hypercube network is bipancyclic.
Adjacent vertices faulttolerance for bipancyclicity of hypercube
 THE 25TH WORKSHOP ON COMBINATORIAL MATHEMATICS AND COMPUTATION THEORY
, 2008
"... A bipartite graph G =(V,E) is bipancyclic if it contains the cycles of every even length from 4 to V . Let Fa be the set of fa pairs of adjacent vertices and Fe be the set of fe faulty edges in the ndimensional hypercube Qn. In this paper, we will show that Qn − Fa − Fe is bipancyclic for fa + fe ..."
Abstract
 Add to MetaCart
A bipartite graph G =(V,E) is bipancyclic if it contains the cycles of every even length from 4 to V . Let Fa be the set of fa pairs of adjacent vertices and Fe be the set of fe faulty edges in the ndimensional hypercube Qn. In this paper, we will show that Qn − Fa − Fe is bipancyclic for fa
Completely conditionalfault edgebipancyclicity of hypercubes
 THE 29TH WORKSHOP ON COMBINATORIAL MATHEMATICS AND COMPUTATION THEORY
"... In this paper, we consider the conditionally faulty graphs G that each vertex of G is incident with at least m faultfree edges, 2 ≤ m ≤ δ(G) − 1. We extend the limitation m ≥ 2 in all previous results of edgebipancyclicity with faulty edges and faulty vertices. Let fe (respectively, fv) denotes t ..."
Abstract
 Add to MetaCart
In this paper, we consider the conditionally faulty graphs G that each vertex of G is incident with at least m faultfree edges, 2 ≤ m ≤ δ(G) − 1. We extend the limitation m ≥ 2 in all previous results of edgebipancyclicity with faulty edges and faulty vertices. Let fe (respectively, fv) denotes
Implementing data cubes efficiently
 In SIGMOD
, 1996
"... Decision support applications involve complex queries on very large databases. Since response times should be small, query optimization is critical. Users typically view the data as multidimensional data cubes. Each cell of the data cube is a view consisting of an aggregation of interest, like total ..."
Abstract

Cited by 545 (1 self)
 Add to MetaCart
to materialize. The greedy algorithm performs within a small constant factor of optimal under a variety of models. We then consider the most common case of the hypercube lattice and examine the choice of materialized views for hypercubes in detail, giving some good tradeoffs between the space used
Fast Folding and Comparison of RNA Secondary Structures (The Vienna RNA Package)
"... Computer codes for computation and comparison of RNA secondary structures, the Vienna RNA package, are presented, that are based on dynamic programming algorithms and aim at predictions of structures with minimum free energies as well as at computations of the equilibrium partition functions and bas ..."
Abstract

Cited by 812 (119 self)
 Add to MetaCart
implementations of modified algorithms on parallel computers with distributed memory. Performance analysis carried out on an Intel Hypercube shows that parallel computing becomes gradually more and more efficient the longer the sequences are.
The EdgeFaultTolerant Bipancyclicity
, 2009
"... The interconnection network considered in this paper is the kary ncube that is an attractive variance of the wellknown hypercube. Many interconnection networks, including the ring, torus and hypercube, that are attractive in both theoretical interests and practical systems can be regarded as the ..."
Abstract
 Add to MetaCart
The interconnection network considered in this paper is the kary ncube that is an attractive variance of the wellknown hypercube. Many interconnection networks, including the ring, torus and hypercube, that are attractive in both theoretical interests and practical systems can be regarded
Exact Sampling with Coupled Markov Chains and Applications to Statistical Mechanics
, 1996
"... For many applications it is useful to sample from a finite set of objects in accordance with some particular distribution. One approach is to run an ergodic (i.e., irreducible aperiodic) Markov chain whose stationary distribution is the desired distribution on this set; after the Markov chain has ..."
Abstract

Cited by 548 (13 self)
 Add to MetaCart
For many applications it is useful to sample from a finite set of objects in accordance with some particular distribution. One approach is to run an ergodic (i.e., irreducible aperiodic) Markov chain whose stationary distribution is the desired distribution on this set; after the Markov chain has run for M steps, with M sufficiently large, the distribution governing the state of the chain approximates the desired distribution. Unfortunately it can be difficult to determine how large M needs to be. We describe a simple variant of this method that determines on its own when to stop, and that outputs samples in exact accordance with the desired distribution. The method uses couplings, which have also played a role in other sampling schemes; however, rather than running the coupled chains from the present into the future, one runs from a distant point in the past up until the present, where the distance into the past that one needs to go is determined during the running of the al...
Pastry: Scalable, distributed object location and routing for largescale peertopeer systems
, 2001
"... This paper presents the design and evaluation of Pastry, a scalable, distributed object location and routing scheme for widearea peertopeer applications. Pastry provides applicationlevel routing and object location in a potentially very large overlay network of nodes connected via the Internet. ..."
Abstract

Cited by 2063 (50 self)
 Add to MetaCart
This paper presents the design and evaluation of Pastry, a scalable, distributed object location and routing scheme for widearea peertopeer applications. Pastry provides applicationlevel routing and object location in a potentially very large overlay network of nodes connected via the Internet. It can be used to support a wide range of peertopeer applications like global data storage, global data sharing, and naming. An insert operation in Pastry stores an object at a userdefined number of diverse nodes within the Pastry network. A lookup operation reliably retrieves a copy of the requested object if one exists. Moreover, a lookup is usually routed to the node nearest the client issuing the lookup (by some measure of proximity), among the nodes storing the requested object. Pastry is completely decentralized, scalable, and selfconfiguring; it automatically adapts to the arrival, departure and failure of nodes. Experimental results obtained with a prototype implementation on a simulated network of 100,000 nodes confirm Pastry's scalability, its ability to selfconfigure and adapt to node failures, and its good network locality properties.
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.
Statistical mechanics of complex networks
 Rev. Mod. Phys
"... Complex networks describe a wide range of systems in nature and society, much quoted examples including the cell, a network of chemicals linked by chemical reactions, or the Internet, a network of routers and computers connected by physical links. While traditionally these systems were modeled as ra ..."
Abstract

Cited by 2083 (10 self)
 Add to MetaCart
Complex networks describe a wide range of systems in nature and society, much quoted examples including the cell, a network of chemicals linked by chemical reactions, or the Internet, a network of routers and computers connected by physical links. While traditionally these systems were modeled as random graphs, it is increasingly recognized that the topology and evolution of real
Results 1  10
of
21,213