Olivier Beaumont, Arnaud Legrand  Home/Search
Context Related
| enslyon.fr/pub/LIP/R...RR200207.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: enslyon.fr/~yrobert/index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this paper, we consider the problem of allocating a large number of independent, equal-sized tasks to a heterogeneous processor farm. The master processor P 0 can process a task within w 0 time-units; it communicates a task in d i time-units to the i-th slave P i , 1 i p, which requires w i time-units to process it. We assume communication-computation overlap capabilities for each slave (and for the master), but the communication medium is exclusive: the master can only communicate ... (Update)
Similar documents based on text: More All
0.7: A Realistic Model and an Efficient Heuristic for.. - Beaumont, Boudet, Robert (2001) (Correct)
0.6: Conferences - Robert (Correct)
0.6: Dense Linear Algebra Kernels on Heterogeneous.. - Beaumont, Legrand, .. (2000) (Correct)
BibTeX entry: (Update)
O. Beaumont, A. Legrand, and Y. Robert. A polynomial-time algorithm for allocating independent tasks on heterogeneous fork-graphs. Technical Report 2002-07, LIP, ENS Lyon, France, February 2002. http://citeseer.ist.psu.edu/beaumont02polynomialtime.html More
@misc{ beaumont02polynomialtime,
author = "O. Beaumont and A. Legrand and Y. Robert",
title = "A polynomial-time algorithm for allocating independent tasks on heterogeneous
fork-graphs",
text = "O. Beaumont, A. Legrand, and Y. Robert. A polynomial-time algorithm for
allocating independent tasks on heterogeneous fork-graphs. Technical Report
2002-07, LIP, ENS Lyon, France, February 2002.",
year = "2002",
url = "citeseer.ist.psu.edu/beaumont02polynomialtime.html" }
Citations (may not include all citations):686 a Guide to the Theory of NP-Completeness (context) - Garey, Johnson et al. - 1991
116 Towards an architecture-independent analysis of parallel alg.. (context) - Papadimitriou, Yannakakis - 1990
72 LogP: A practical model of parallel computation (context) - Culler, Karp et al. - 1996
48 Gossiping in minimal time - Krumme, Cybenko et al. - 1992
46 Spanning graphs for optimum broadcasting and personalized co.. (context) - Johnsson, Ho - 1989
31 Bandwidth-centric allocation of independent tasks on heterog.. - Beaumont, Carter et al. - 2002
27 An enabling framework for master-worker applications on the .. - Goux, Kulkarni et al. - 2000
23 Scheduling with communication delays: a survey (context) - Chrtienne, Picouleau - 1995
19 Masterslave computing grid - Berman, slave et al. - 2000
16 Adaptive scheduling masterworker application distributed com.. - scheduling, worker et al. - 2001
15 Adaptive scheduling for master-worker applications on the co.. - Heymann, Senar et al. - 2000
8 The master-slave paradigm with heterogeneous processors - Beaumont, Legrand et al. - 2001
7 Scheduling multi-component applications in heterogeneous wid.. (context) - Weissman - 2000
6 cient collective communication in distributed heterogeneous .. (context) - Bhat, Prasanna et al. - 1999
6 Sharing partitionable workloads in heterogeneous NOWs: greed.. (context) - Rosenberg - 2001
[Article contains additional citations not shown here]
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.ens-lyon.fr/~yrobert/index.html): More
Determining the Idle Time of a Tiling: New Results - Desprez, Dongarra, Rastello, .. (1997) (Correct)
TransTool: A Restructuring Tool for the.. - Darte, Desprez.. (1996) (Correct)
Scheduling Block-Cyclic Array Redistribution - Desprez, Dongarra, Petitet.. (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