Results 1  10
of
554
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
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
A dynamic survey of graph labellings
 Electron. J. Combin., Dynamic Surveys(6):95pp
, 2001
"... A graph labeling is an assignment of integers to the vertices or edges, or both, subject to certain conditions. Graph labelings were first introduced in the late 1960s. In the intervening years dozens of graph labelings techniques have been studied in over 1000 papers. Finding out what has been done ..."
Abstract

Cited by 167 (0 self)
 Add to MetaCart
done for any particular kind of labeling and keeping up with new discoveries is difficult because of the sheer number of papers and because many of the papers have appeared in journals that are not widely available. In this survey I have collected everything I could find on graph labeling
Shallow Excluded Minors and Improved Graph Decompositions
, 1994
"... In this paper we introduce the notion of the limiteddepth minor exclusion and show that graphs that exclude small limiteddepth minors have relatively small separators. In particular, we prove that for any graph that excludes K h as a depth l minor, we can find a separator of size O(lh 2 log n n=l) ..."
Abstract

Cited by 50 (2 self)
 Add to MetaCart
, exclude K h minors of depth L for h = \Omega\Gamma L d\Gamma1 ) when d is a constant. These graphs arise in finite element computations. Our proof of separator existence is constructive and gives an algorithm to find the tcutcovers decomposition, introduced by Kaklamanis, Krizanc, and Rao, in graphs
Optimal Emulation of Meshes on Meshes of Trees
, 1995
"... . Many problems can be solved more efficiently on a mesh of trees network than on a mesh. Until now it has been an open problem whether the mesh of trees is always at least as fast as the mesh. In this paper, we present an emulation of Nnode meshes on O(N)node meshes of trees with constant slowdow ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
. Many problems can be solved more efficiently on a mesh of trees network than on a mesh. Until now it has been an open problem whether the mesh of trees is always at least as fast as the mesh. In this paper, we present an emulation of Nnode meshes on O(N)node meshes of trees with constant
Cayley Graphs and Interconnection Networks
, 1997
"... In this report, we will focus on routing problems including connectivity, diameter and loads of routings. We place the emphasis on load problems, since new classes of vertextransitive graphs (see quasiCayley graphs in Section 5.3) or edgetransitive graphs (see regular orbital graphs in Section 5. ..."
Abstract

Cited by 72 (3 self)
 Add to MetaCart
In this report, we will focus on routing problems including connectivity, diameter and loads of routings. We place the emphasis on load problems, since new classes of vertextransitive graphs (see quasiCayley graphs in Section 5.3) or edgetransitive graphs (see regular orbital graphs in Section 5
Emulation of a Virtual Shared Memory Architecture
 Department of Computer Science, University of Bristol, Bristol
, 1993
"... In designing a multiprocessor architecture, the motivating factors are that the architecture should be general purpose, easier to program and at the same time scalable. The Data Diffusion Machine (DDM) seeks to fulfil such criteria. The DDM provides shareddata access on distributed memory hardware, ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
is central in maintaining coherence of data. The linkbased protocol exploits the combining properties of the DDM network to minimise traffic in the DDM hierarchy. The protocol also contains efficient and general support for synchronisation. To evaluate the design and performance of new architectures, trace
Survey of Research towards Robust PeertoPeer Networks: Search Methods
 COMPUTER NETWORKS
, 2004
"... ..."
New results on edgebandwidth
 Theoret. Comput. Sci
"... The edgebandwidth problem is an analog of the classical bandwidth problem, in which one has to label the edges of a graph by distinct integers such that the maximum difference of labels of any two incident edges is minimized. We prove tight bounds on the edgebandwidth of hypercube and butterfly gr ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The edgebandwidth problem is an analog of the classical bandwidth problem, in which one has to label the edges of a graph by distinct integers such that the maximum difference of labels of any two incident edges is minimized. We prove tight bounds on the edgebandwidth of hypercube and butterfly
Results 1  10
of
554