The master-slave paradigm with heterogeneous processors

Proceedings - IEEE International Conference on Cluster Computing, ICCC

Volumn 2001-October, Issue , 2001, Pages

  Beaumont, Olivier ^a   Legrand, Arnaud ^a   Robert, Yves ^a  

^a CNRS   (France)

Author keywords

Communication; Complexity; Heterogeneous processors; Masterslave tasking; Matching

Indexed keywords

POLYNOMIALS;

ASYMPTOTICALLY OPTIMAL; COMPLEXITY; HETEROGENEOUS PROCESSORS; MASTER SLAVE; MASTER-SLAVE TASKING; MATCHINGS; OPTIMAL SOLUTIONS; POLYNOMIAL ALGORITHM; SLAVE PROCESSORS; TASK-PROCESSING;

APPROXIMATION ALGORITHMS;

EID: 2342585856     PISSN: 15525244     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CLUSTR.2001.960008     Document Type: Conference Paper

References (16)

1. R. Andonie, A. Chronopoulos, D. Grosu, and H. Galmeanu. Distributed backpropagation neural networks on a PVM heterogeneous system. In Parallel and Distributed Computing and Systems Conference (PDCS'98), pages 555-560. IASTED Press, 1998.
2. O. Beaumont, V. Boudet, F. Rastello, and Y. Robert. Matrix-matrix multiplication on heterogeneous platforms. In 2000 International Conference on Parallel Processing (ICPP'2000). IEEE Computer Society Press, 2000.
3. O. Beaumont, A. Legrand, and Y. Robert. The masterslave paradigm with heterogeneous processors. Technical Report RR-2001-13, LIP, ENS Lyon, Mar. 2001. Available at www.ens-lyon.fr/LIP/.
4. P. Boulet, J. Dongarra, F. Rastello, Y. Robert, and F. Vivien. Algorithmic issues on heterogeneous computing platforms. Parallel Processing Letters, 9(2):197-213, 1999.
5. P. Brucker, C. Dhaenens-Flipo, S. Knust, S. Kravchenko, and F. Werner. Complexity results for parallel machine problems with a single server. Technical Report Reihe P, No. 219, FachbereichMathematik Informatik, Universitt Osnabrck, 2000.
6. M. R. Garey and D. S. Johnson. Computers and Intractability, a Guide to the Theory of NP-Completeness. W. H. Freeman and Company, 1991.
7. A. Geist, A. Beguelin, J. Dongarra, W. Jiang, R. Manchek, and V. Sunderam. PVM Parallel Virtual Machine: A Users'Guide and Tutorial for Networked Parallel Computing. The MIT Press, 1996.
8. M. Gondran and M. Minoux. Graphs and Algorithms. John Wiley & Sons, 1984.
9. N. Hall, C. Potts, and C. Sriskandarajah. Parallel machine scheduling with a common server. Discrete Applied Mathematics, 102:223-243, 2000.
10. S. Hedetniemi. Open Problems in Combinatorial Optimization. World Wide Web document, URL: Http://www.cs.clemson.edu/hedet/algorithms.html.
11. S. Kravchenko and F.Werner. Parallel machine scheduling problems with a single server. Mathematical Computational Modelling, 26:1-11, 1997.
12. H. Lee and M. Guignard. A hybrid bounding procedure for the workload allocation problem on parallel unrelated machines with setups. Journal of the Operational Research Society, 47:1247-1261, 1996.
13. K. Soman, R. Fraczkiewicz, C. Mumenthaler, B. von Freyberg, and T. S.W. Braun. FANTOM-(Fast Newton-Raphson Torsion Angle Minimizer). World Wide Web document, URL: Http://www.scsb.utmb.edu/fantom/fm_home.html.
14. J. Stiles, T. Bartol, M. Salpeter, and M. Salpeter. Monte Carlo simulation of neuromuscular transmitter release using MCell, a general simulator of cellular physiological processes. Computational Neuroscience, pages 279-284, 1998.
15. J. Watts and S. Taylor. A practical approach to dynamic load balancing. IEEE Transactions on Parallel and Distributed Systems, 9(3):235-248, 1998.
16. D. West. Introduction to Graph Theory. Prentice Hall, 1996.