Sciweavers

1221 search results - page 62 / 245
» Balanced graph partitioning
Sort
View
IWSOS
2009
Springer
14 years 3 months ago
Laying Pheromone Trails for Balanced and Dependable Component Mappings
This paper presents an optimization framework for finding efficient deployment mappings of replicated service components (to nodes), while accounting for multiple services simult...
Máté J. Csorba, Hein Meling, Poul E....
FPL
2000
Springer
124views Hardware» more  FPL 2000»
14 years 15 days ago
Balancing Logic Utilization and Area Efficiency in FPGAs
Abstract. In this paper we outline a procedure to determine appropriate partitioning of programmable logic and interconnect area to minimize overall device area across a broad rang...
Russell Tessier, Heather Giza
PVM
2010
Springer
13 years 6 months ago
Load Balancing for Regular Meshes on SMPs with MPI
Abstract. Domain decomposition for regular meshes on parallel computers has traditionally been performed by attempting to exactly partition the work among the available processors ...
Vivek Kale, William Gropp
COMAD
2009
13 years 10 months ago
Epsilon Equitable Partition: A positional analysis method for large social networks
Positional analysis is considered an important tool in the analysis of social networks. It involves partitioning of the set of actors into subsets such that actors in a subset are...
Kiran Kate, Balaraman Ravindran
ISAAC
2005
Springer
111views Algorithms» more  ISAAC 2005»
14 years 2 months ago
Boosting Spectral Partitioning by Sampling and Iteration
A partition of a set of n items is a grouping of the items into k disjoint classes of equal size. Any partition can be modeled as a graph: the items become the vertices of the grap...
Joachim Giesen, Dieter Mitsche