(Enter summary)
Abstract: Dawn E. Gregory Lixin Gao Arnold L. Rosenberg Paul R. Cohen
Department of Computer Science, University of Massachusetts
Amherst, MA 01003, USA
Abstract
We empirically analyze and compare two distributed,
low-overhead policies for scheduling dynamic treestructured
computations on rings of identical PEs. Our
experiments show that both policies give significant parallel
speedup on large classes of computations, and that
one yields almost optimal speedup on moderate size rings.
We believe that... (Update)
Context of citations to this paper: More
...multiple users and or multiple tasks. An adaptive scheduler which distributes computation based on supply and not demand was presented in [8] for a very special class of algorithms (tree structures) and multiprocessor topologies (rings) Despite the obvious difference in scope,...
...of two policies for balancing a computational load among the processors in a network. The details of this study are documented elsewhere [7]. Simulating network performance on randomly generated loads allows us to resolvetwo important questions empirically. First, it is...
Cited by: More
Experimental Analysis of Evolution Strategies - Overview and .. - Bartz-Beielstein
(Correct)
Integrating Many Techniques for Discovering Structure in Data - Gregory, Cohen
(Correct)
Intelligent Assistance for Computational Scientists.. - Gregory, Cohen (1996)
(Correct)
Active bibliography (related documents): More All
0.2: Some Models for Scheduling Parallel Programs with.. - Bampis, Guinand.. (1997)
(Correct)
0.2: Two Processor Scheduling with Large Communication Delays.. - Afrati, al.
(Correct)
0.2: Efficient Mining of Statistical Dependencies - Oates, Schmill, Cohen, Durfee (1999)
(Correct)
Similar documents based on text: More All
0.1: Optimal Clustering of Tree-Sweep Computations for.. - Gao, Rosenberg..
(Correct)
0.0: Toward Efficient Scheduling of Evolving Computations on Rings .. - Gao, Rosenberg (1996)
(Correct)
0.0: On Balancing Computational Load on Rings of Processors - Gao, Rosenberg (1994)
(Correct)
Related documents from co-citation: More All
4: Optimization by simulated annealing: An experimental evaluation (context) - Johnson, Aragon et al. - 1990
2: Adaptive search by evolutionary algorithms
- Back, Ho - 1992
2: Reidel Publishing Company (context) - van Laarhoven, Aarts et al. - 1987
BibTeX entry: (Update)
D.E. Gregory, L.-X. Gao, A.L. Rosenberg, P.R. Cohen (1996): An empirical study of dynamic scheduling on rings of processors. 8th IEEE Symp. on Parallel and Distr. Processing, 470-473. http://citeseer.ist.psu.edu/gregory96empirical.html More
@inproceedings{ gregoryempirical,
author = "D. E. Gregory and L. Gao and A. L. Rosenberg and P. R. Cohen",
title = "An Empirical Study of Dynamic Scheduling on Rings of Processors",
pages = "470--473",
url = "citeseer.ist.psu.edu/gregory96empirical.html" }
Citations (may not include all citations):
154
Empirical Methods for Artificial Intelligence (context) - Cohen - 1995
68
Communication efficient basic linear algebra computations on.. (context) - Johnsson - 1987
42
Randomized parallel algorithms for backtrack search and bran.. (context) - Karp, Zhang - 1988
38
Optimal speedup for backtrack search on a butterfly network (context) - Ranade - 1994
23
A fast static scheduling algorithm for dags on an unbounded ..
- Yang, Gerasoulis - 1991
4
Optimal architecture-independent scheduling of fine-grain tr..
- Gao, Rosenberg et al. - 1995
1
Toward efficient scheduling of evolving computations on ring..
- Gao, Rosenberg - 1996
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