Peter Sanders  Home/Search
Context
Related
| mpisb.mpg.de/~sanders/...isaac99.ps.gz 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: mpisb.mpg.de/~sanders/pa...index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Many applications in parallel processing have to traverse large, implicitly defined trees with irregular shape. The receiver initiated load balancing algorithm random polling has long been known to be very efficient for these problems in practice. For any ffl ? 0, we prove that its parallel execution time is at most (1 + ffl)T seq =P + O(Tatomic + h( ffl +Trout +T split )) with high probability, where Trout , T split and Tatomic bound the time for sending a message, splitting a subproblem and... (Update)
Similar documents (at the sentence level):
57.5%: Randomized Receiver Initiated Load Balancing Algorithms for Tree.. - Sanders (Correct)
5.3%: Parallelizing NP-Complete Problems Using Tree Shaped Computations - Sanders (1999) (Correct)
Active bibliography (related documents): More All
2.1: Tree Shaped Computations as a Model for Parallel Applications - Sanders (1998) (Correct)
0.5: A Scalable Parallel Tree Search Library - Sanders (1996) (Correct)
0.5: Low-Contention Depth-First Scheduling of Parallel Computations.. - Fatourou (2001) (Correct)
Similar documents based on text: More All
0.5: Better Algorithms for Parallel Backtracking - Sanders (1995) (Correct)
0.5: Some Implementation Results on Random Polling Dynamic Load.. - Sanders (1995) (Correct)
0.4: A Detailed Analysis of Random Polling Dynamic Load Balancing - Sanders (1994) (Correct)
BibTeX entry: (Update)
@inproceedings{ sanders99asynchronous,
author = "Sanders",
title = "Asynchronous Random Polling Dynamic Load Balancing",
booktitle = "{ISAAC}: 10th International Symposium on Algorithms and Computation (formerly {SIGAL} International Symposium on Algorithms), Organized by Special Interest Group on Algorithms ({SIGAL}) of the Information Processing Society of Japan ({IPSJ}) and the Technical Group on Theoretical Foundation of Computing of the Institute of Electronics, Information and Communication Engineers ({IEICE}))",
year = "1999",
url = "citeseer.ist.psu.edu/504051.html" }
Citations (may not include all citations):1535 Cambridge University Press (context) - Press, Teukolsky et al. - 1992
531 LogP: Towards a realistic model of parallel computation - Culler, Karp et al. - 1993
278 Depth-first iterative-deepening: An optimal admissible tree .. (context) - Korf - 1985
229 Knapsack Problems -- Algorithms and Computer Implementations (context) - Martello, Toth - 1990
191 Introduction to Parallel Computing (context) - Kumar, Grama et al. - 1994
157 Scheduling multithreaded computations by work stealing - Blumofe, Leiserson - 1994
90 Randomized routing and sorting on fixed-connection networks - Leighton, Maggs et al. - 1994
75 Scalable load balancing techniques for parallel computers - Kumar, Ananth - 1991
67 Algorithms for distributed termination detection (context) - Mattern - 1987
51 Parallel depth first search (context) - Rao, Kumar - 1987
45 Thread scheduling for multiprogrammed multiprocessors - Arora, Blumofe et al. - 1998
37 ACM Transactions on Programming Languages and Systems (context) - Finkel, Manber et al. - 1987
29 Communication complexity of parallel divide-andconquer - Wu, Kung - 1991
21 Randomized load balancing for treestructured computation - Chakrabarti, Ranade et al. - 1994
18 A fast parallel SAT-solver -- efficient workload balancing (context) - Bohm, Speckenmeyer - 1996
17 Parallele Suche mit randomisiertem Wettbewerb in Inferenzsys.. (context) - Ertel - 1992
16 Superlinear speedup for parallel backtracking (context) - Speckenmeyer, Monien et al. - 1987
14 A detailed analysis of random polling dynamic load balancing - Sanders - 1994
12 Analysis of random polling dynamic load balancing - Sanders - 1994
12 Parallel logic programming systems (context) - Kergommeaux, Codognet - 1994
10 Lastverteilungsalgorithmen fur parallele Tiefensuche (context) - Sanders - 1997
10 Lastverteilungsalgorithmen fur parallele Tiefensuche (context) - Sanders - 1997
8 Studying overhead massively parallel minmax tree evaluation - Mysliwietz, overheads et al. - 1994
8 Applications of numbered undirected graphs (context) - Bloom, Golomb - 1977
8 An adaptive granularity control algorithm for the parallel e.. (context) - Aharoni, Barak et al. - 1993
7 Better algorithms for parallel backtracking - Sanders - 1995
6 Analyses of load stealing models based on differential equat.. - Mitzenmacher - 1998
6 A scalable parallel tree search library - Sanders - 1996
4 Efficient dynamic embedding of arbitrary binary trees into h.. (context) - Heun, Mayr - 1996
4 Parallel crew scheduling on workstation networks using PVM (context) - Goumopoulos, Housos et al. - 1997
4 Scheduling algorithms for strict multithreaded computations - Fatourou, Spirakis - 1996
3 Scalability of massively parallel depth-first search - Reinefeld - 1994
3 Liquid crystal simulation using automatic differentiation an.. (context) - Nonnenmacher, Mlynski - 1996
3 Tree shaped computations as a model for parallel application.. - Sanders - 1998
2 Automatic test pattern generator on parallel processors (context) - Arvindam, Kumar et al. - 1990
2 Special Issue on Parallel and Distributed Data Structures (context) - Wattenhofer, Widmayer et al. - 1998
2 A new scheduling algorithm for general strict multithreaded .. - Fatourou, Spirakis - 1999
Documents on the same site (http://www.mpi-sb.mpg.de/~sanders/papers/index.html): More
Better Algorithms for Parallel Backtracking - Sanders (1995) (Correct)
A Parallelization of Dijkstra's Shortest Path Algorithm - Crauser, Mehlhorn, Meyer.. (1998) (Correct)
On the Efficient Implementation of Massively Parallel Quicksort - Sanders, Hansch (1997) (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