Allocating independent tasks to parallel processors: An experimental study

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1117, Issue , 1996, Pages 1-33

  Hagerup, Torben ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

PARALLEL ALGORITHMS;

ALLOCATION PROBLEMS; ALLOCATION STRATEGY; FINISHING TIME; FIXED-DELAY; INDEPENDENT TASKS; PARALLEL MACHINE; PARALLEL PROCESSOR; VARIABLE NUMBER;

PARALLEL PROCESSING SYSTEMS;

EID: 21344450927     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0030094     Document Type: Conference Paper

References (17)

1. Banicescu, I., and Hummel, S. F., Balancing processor loads and exploiting data locality in jV-body simulations, in Proc. Supercomputing 1995 (http://www.sdsc.edu/SC95/techpapers.html).
2. Bratley, P., Fox, B. L., and Schrage, L. E., A Guide to Simulation, Springer-Verlag, New York, 1983.
3. Cheng, R. C. H., The generation of gamma variables with non-integral shape parameter, Appl. Statist. 26 (1977), pp. 71-75.
4. Devroye, L., Non-Uniform Random Variate Generation, Springer-Verlag, New York, 1986.
5. Flynn, L. E., and Hummel, S. F., A mathematical analysis of scheduling parallel loops in decreasing-size chunks, manuscript. A preliminary version is available as IBM Research Report No. RC 18462, Oct. 1992.
6. Grimmett, G. R., and Stirzaker, D. R., Probability and Random Processes (2nd ed.), Oxford University Press, Oxford, 1992.
7. Gumbel, E. J., The maxima of the mean largest value and of the range, Ann. Math. Statist. 25 (1954), pp. 76-84.
8. Gut, A., An Intermediate Course in Probability, Springer-Verlag, New York, 1995.
9. Hartley, H. O., and David, H. A., Universal bounds for mean range and extreme observation, Ann. Math. Statist. 25 (1954), pp. 85-99.
10. Hummel, S. F., Schmidt, J., Uma, R. N., and Wein, J., Load-sharing in heterogeneous systems via weighted factoring, in Proc. 8th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA 1996), to appear.
11. Hummel, S. F., Schonberg, E., and Flynn, L. E., Factoring: A method for scheduling parallel loops, Comm. Assoc. Comput. Mach. 35:8 (1992), pp. 90-101.
12. Kruskal, C. P., and Weiss, A., Allocating independent subtasks on parallel processors, IEEE Trans. Software Eng. 11 (1985), pp. 1001-1016.
13. McGeoch, C. C., Toward an Experimental Method for Algorithm Simulation, INFORMS J. Comput. 8 (1996), pp. 1-15.
14. Mehlhom, K., and Näher, S., LEDA: A platform for combinatorial and geometric computing, Comm. Assoc. Comput. Mach. 38:1 (1995), pp. 96-102.
15. Polychronopoulos, C. D., and Kuck, D. J., Guided self-scheduling: A practical scheduling scheme for parallel supercomputers, IEEE Trans. Comput 36 (1987), pp 1425-1439.
16. Tzen, T. H., and Ni, L. M., Dynamic loop scheduling for shared-memory multiprocessors, in Proc. International Conference on Parallel Processing (ICPP 1991) pp II247-II250.
17. Walker, A. J., An efficient method for generating discrete random variables with general distributions, ACM Trans. Math. Software 3 (1977), pp. 253-256.