1221 search results - page 79 / 245 » Balanced graph partitioning |
COLT
2004
Springer
14 years 2 months ago
2004
Springer
Given a set of n randomly drawn sample points, spectral clustering in its simplest form uses the second eigenvector of the graph Laplacian matrix, constructed on the similarity gra...
SIGMOD
2011
ACM
12 years 11 months ago
2011
ACM
Conventional OLTP systems assign each transaction to a worker thread and that thread accesses data, depending on what the transaction dictates. This thread-to-transaction work ass...
IPPS
2000
IEEE
14 years 1 months ago
2000
IEEE
Parallel simulation techniques are often employed to meet the computational requirements of large hardware simulations in order to reduce simulation time. In addition, partitionin...
ASPDAC
1999
ACM
14 years 1 months ago
1999
ACM
The spectral method can lead to a high quality of multi-way partition due to its ability to capture global netlist information. For spectral partition, n netlist modules are mappe...
ISPD
2005
ACM
14 years 2 months ago
2005
ACM
In this paper, we present a hierarchical ratio partitioning based placement algorithm for large-scale mixed-size designs. The placement algorithm consists of three steps: global p...