Complexity of master-slave tasking on heterogeneous trees

European Journal of Operational Research

Volumn 164, Issue 3 SPEC. ISS., 2005, Pages 690-695

  Dutot, Pierre François ^a  

^a ID IMAG   (France)

Author keywords

Complexity theory; Heterogeneous platforms; Master slave tasking

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; MATHEMATICAL MODELS; PARALLEL PROCESSING SYSTEMS; POLYNOMIALS; PROBLEM SOLVING; SCHEDULING; TELECOMMUNICATION LINKS; THEOREM PROVING;

COMPLEXITY THEORY; HETEROGENEOUS PLATFORMS; MASTER-SLAVE TASKING; UNIT EXECUTION TIME (UET);

TREES (MATHEMATICS);

EID: 12244311232     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2003.10.051     Document Type: Conference Paper

References (11)

1. Bataineh S., Hsiung T.-Y., Robertazzi T.G. Closed form solutions for bus and tree networks of processors load sharing a divisible job. IEEE Transactions on Computers. 43(10):1994;1184-1196
2. O. Beaumont, L. Carter, J. Ferrante, A. Legrand, Y. Robert, Bandwidth-centric allocation of independent tasks on heterogeneous platforms, in: International Parallel and Distributed Processing Symposium, 2002, Technical report available at http://www.ens-lyon.fr/~yrobert
3. O. Beaumont, A. Legrand, Y. Robert, Static scheduling strategies for heterogeneous systems. Technical Report 2002, 29, École Normale Supérieure de Lyon, July 2002, Available at http://www.ens-lyon.fr/~yrobert
4. Charcranoon S., Robertazzi T.G., Luryi S. Optimizing computing costs using divisible load analysis. IEEE Transactions on Computers. 49(9):2000;987-991
5. Cheng Y.C., Robertazzi T.G. Distributed computation for a tree network with communication delays. IEEE Transactions on Aerospace and Electronic Systems. 24:1988;700-712
6. P.F. Dutot, Complexity of master-slave tasking on heterogeneous trees (extended version), Technical report, Laboratory ID-IMAG, 2003, URL: http://www-id.imag.fr/~pfdutot/perso.html
7. P.F. Dutot, Master-slave tasking on heterogeneous processors, in: International Parallel and Distributed Processing Symposium, IEEE Computer Society Press, April 2003
8. Garey M.R., Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-completeness. 1979;W.H. Freeman and Company, San Francisco
9. Mersenne Prime Search, URL: http://www.mersenne.org
10. SETI at home, URL: http://setiathome.ssl.berkeley.edu
11. Sohn J., Robertazzi T.G., Luryi S. Optimizing computing costs using divisible load analysis. IEEE Transactions on Parallel and Distributed Systems. 9(3):1998;225-234