Robert Elsässer, Burkhard Monien  Home/Search
Context
Related
| unipaderborn.de/cs/agmonien...EM03.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: unipaderborn.de/c...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Di usive schemes have been widely analyzed for parallel and distributed load balancing. It is well known that their convergence rates depend on the eigenvalues of some associated matrices and on the expansion properties of the underlying graphs. In the rst part of this paper we make use of these relationships in order to obtain new spectral bounds on the edge and node expansion of graphs. We show that these new bounds are better than the classical bounds for several graph classes. In the... (Update)
Active bibliography (related documents): More All
0.5: Multiple-Choice Assignments on Uniformly Related Machines - Kontogiannis (2002) (Correct)
0.5: A Stochastic Approach To Error Estimates For Iterative Linear.. - Golub, Melbo (2000) (Correct)
0.5: On Non-Uniqueness Of Percolation On Nonamenable Cayley Graphs - Pak, Smirnova-Nagnibeda (Correct)
Similar documents based on text: More All
0.3: Diffusive Load Balancing Schemes on Heterogeneous Networks - Elsässer, Monien, Preis (Correct)
0.3: On Spectral Bounds for the k-Partitioning of Graphs - Elsässer, Lücking, Monien (Correct)
0.2: Parallel Sparse Cholesky Factorization - Monien, Schulze (Correct)
BibTeX entry: (Update)
@misc{ sser-load,
author = "Robert Elsässer and Burkhard Monien",
title = "Load Balancing of Unit Size Tokens and Expansion Properties of Graphs",
url = "citeseer.ist.psu.edu/623585.html" }
Citations (may not include all citations):309 Partitioning sparse matrices with eigenvectors of graphs (context) - Pothen, Simon et al. - 1990
126 Eigenvalues and expanders (context) - Alon - 1986
115 Approximating the permanent (context) - Jerrum, Sinclair - 1989
99 Information Processing Letters (context) - Hagerup, ub et al. - 1990
96 Parallel Computing Works (context) - Fox, Williams et al. - 1994
93 American Mathematical Society (context) - Chung, Theory et al. - 1997
54 Load balancing and poisson equation in a graph (context) - Boillat - 1990
45 Conductance and convergence of markov chains: a combinatoria.. (context) - Mihail - 1989
44 Isoperimetric numbers of graphs (context) - Mohar - 1989
43 A lower bound for the smallest eigenvalue of the laplacian (context) - Cheeger - 1970
40 isoperimetric inequalities for graphs (context) - Alon, Milman - 1985
37 the markov chain simulation method for uniform combinatorial.. (context) - Aldous - 1987
36 A measure of asymptotic eciency for tests of a hypothesis ba.. (context) - Cherno - 1952
35 Tight analyses of two local load balancing algorithms - Ghosh, Leighton et al. - 1999
28 Random walks in a convex body and an improved volume algorit.. (context) - Lov, Simonovits - 1993
25 Load balancing for distributed memory multiprocessors (context) - Cybenko - 1989
21 Explicit construction of concentrators from generalized n-go.. (context) - Tanner - 1984
21 Eigenvalue bounds on convergence to stationarity for nonreve.. (context) - Fill - 1991
20 Eigenvalues and expansion of regular graphs - Kahale - 1995
13 Better expanders and superconcentrators (context) - Alon, Galil et al. - 1987
10 Local divergence of markov chains and the analysis of iterat.. - Rabani, Sinclair et al. - 1998
10 bound for random walks on expander graphs (context) - Gillman, cherno - 1998
8 Ecient schemes for nearest neighbor load balancing (context) - Diekmann, Frommer et al. - 1999
5 First and second order di usive methods for rapid (context) - Muthukrishnan, Ghosh et al. - 1998
3 and rapidly mixing markov chains (context) - Sinclair, Jerrum et al. - 1989
2 a simple and tight analysis (context) - Raab, Steger et al. - 1998
2 errors in the richardson second order method (context) - Golub, the - 1962
2 and the spectrum of graphs (context) - Mohar, growth - 1988
1 An asynchronous and iterative load balancing algorithm for d.. (context) - Cortes, Ripoll et al. - 2002
1 usion schemes for load balancing on heterogeneous networks (context) - Els, Monien et al. - 2002
Documents on the same site (http://www.uni-paderborn.de/cs/ag-monien/PERSONAL/ELSA/publications.html): More
The Spider Poset is Macaulay - Bezrukov, Elsässer (1998) (Correct)
Edge-Isoperimetric Problems for Cartesian Powers of Regular.. - Bezrukov, Elsässer (2001) (Correct)
Edge-Isoperimetric Problems for Cartesian Powers of Regular.. - Bezrukov, Elsässer (2003) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC