Results 1  10
of
197
Geometric Mesh Partitioning: Implementation and Experiments
"... We investigate a method of dividing an irregular mesh into equalsized pieces with few interconnecting edges. The method’s novel feature is that it exploits the geometric coordinates of the mesh vertices. It is based on theoretical work of Miller, Teng, Thurston, and Vavasis, who showed that certain ..."
Abstract

Cited by 112 (20 self)
 Add to MetaCart
We investigate a method of dividing an irregular mesh into equalsized pieces with few interconnecting edges. The method’s novel feature is that it exploits the geometric coordinates of the mesh vertices. It is based on theoretical work of Miller, Teng, Thurston, and Vavasis, who showed
Geometric Spectral Partitioning
, 1995
"... We investigate a new method for partitioning a graph into two equalsized pieces with few connecting edges. We combine ideas from two recently suggested partitioning algorithms, spectral bisection (which uses an eigenvector of a matrix associated with the graph) and geometric bisection (which applie ..."
Abstract

Cited by 16 (2 self)
 Add to MetaCart
We investigate a new method for partitioning a graph into two equalsized pieces with few connecting edges. We combine ideas from two recently suggested partitioning algorithms, spectral bisection (which uses an eigenvector of a matrix associated with the graph) and geometric bisection (which
An Experimental Study of kSplittable Scheduling for DNSBased Traffic Allocation
 EUROPAR 2003 PARALLEL PROCESSING, 9TH INTERNATIONAL EUROPAR CONFERENCE
, 2003
"... The Internet domain name system (DNS) uses rotation of address lists to perform load distribution among replicated servers. We model this kind of load balancing mechanism in form of a set of request streams with different rates that should be mapped to a set of servers. Rotating a list of length k ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
corresponds to breaking streams into k equally sized pieces. We compare this and other strategies of how to break the streams into a bounded number of pieces and how to map these pieces to the servers. One of the strategies that we study computes an optimal ksplittable allocation using a scheduling algorithm
How Good is Recursive Bisection?
 SIAM J. Sci. Comput
, 1995
"... . The most commonly used pway partitioning method is recursive bisection (RB). It first divides a graph or a mesh into two equal sized pieces, by a "good" bisection algorithm, and then recursively divides the two pieces. Ideally, we would like to use an optimal bisection algorithm. Becaus ..."
Abstract

Cited by 100 (5 self)
 Add to MetaCart
. The most commonly used pway partitioning method is recursive bisection (RB). It first divides a graph or a mesh into two equal sized pieces, by a "good" bisection algorithm, and then recursively divides the two pieces. Ideally, we would like to use an optimal bisection algorithm
BIOINFORMATICS APPLICATIONS NOTE Parallel BLAST on split databases
"... Summary: BLAST programs often run on large SMP machines where multiple threads can work simultaneously and there is enough memory to cache the databases between program runs. A group of programs is described which allows comparable performance to be achieved with a Beowulf configuration in which no ..."
Abstract
 Add to MetaCart
no node has enough memory to cache a database but the cluster as an aggregate does. To achieve this result, databases are split into equal sized pieces and stored locally on each node. Each query is run on all nodes in parallel and the resultant BLAST output files from all nodes merged to yield the final
A Key Based Parallel Adaptive Refinement Technique for Finite Element Methods
, 1998
"... This paper investigates the use of spatial keys to uniquely identify and order the objects defining a triangular mesh. By associating a key to each object in a mesh we obtain an order of the objects in one dimension. This makes decomposition much easier, since we simply divide the ordering into equa ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
into equalsized pieces and let each processor have a piece. Keys based on the position ensure that objects which are close spatially generally have close key values, which tends to form decompositions with low communication costs. We present an adaptive refinement algorithm based on these ideas, and show
Equipartitions of Graphs
 B C E D (a) Connectivity graph
, 1991
"... Let G be an undirected graph on n nodes, and let k be an integer that divides n.Akequipartition # of G is a partition of V (G)into k equalsized pieces V 1 , ..., V k . A pair V i , V j of distinct sets in # is called a bad pair if there is at least one edge v i  v j of E(G) such that v i # ..."
Abstract
 Add to MetaCart
Let G be an undirected graph on n nodes, and let k be an integer that divides n.Akequipartition # of G is a partition of V (G)into k equalsized pieces V 1 , ..., V k . A pair V i , V j of distinct sets in # is called a bad pair if there is at least one edge v i  v j of E(G) such that v i
Cutting a Pie Is Not a Piece of Cake
, 2005
"... Gale (1993) posed the question of whether there is necessarily an undominated, envyfree allocation of a pie when it is cut into wedgeshaped pieces or sectors. For two players, we give constructive procedures for obtaining such an allocation, whether the pie is cut into equalsize sectors by a sing ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
Gale (1993) posed the question of whether there is necessarily an undominated, envyfree allocation of a pie when it is cut into wedgeshaped pieces or sectors. For two players, we give constructive procedures for obtaining such an allocation, whether the pie is cut into equalsize sectors by a
unknown title
"... Throughout this course, we have seen a couple of techniques for dividing a tree into smaller substructures: the preferred path and heavylight decompositions. In this lecture, we discuss two new techniques of decomposing trees into smaller subtrees: the separator decomposition and ART/leaftrimming d ..."
Abstract
 Add to MetaCart
s • heavylight: also used in the analysis of linkcut trees • separator decomposition: split the tree into roughly equallysized pieces and recurse • ART/leaftrimming decomposition: we trim (groups of) lg n nodes from the tree We have discussed the first two in the past, and we will discuss
PacketDispersion Techniques and a CapacityEstimation Methodology
 IEEE/ACM Trans. Netw
, 2004
"... The packetpair technique aims to estimate the capacity of a path (bottleneck bandwidth) from the dispersion of two equalsized probing packets sent back to back. It has been also argued that the dispersion of longer packet bursts (packet trains) can estimate the available bandwidth of a path. This ..."
Abstract

Cited by 90 (2 self)
 Add to MetaCart
The packetpair technique aims to estimate the capacity of a path (bottleneck bandwidth) from the dispersion of two equalsized probing packets sent back to back. It has been also argued that the dispersion of longer packet bursts (packet trains) can estimate the available bandwidth of a path
Results 1  10
of
197