On scheduling parallel tasks at twilight

Theory of Computing Systems

Volumn 33, Issue 5-6, 2000, Pages 489-563

  Bast, H ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ESTIMATION; OPTIMIZATION;

A-PRIORI ESTIMATES; IDENTICALLY DISTRIBUTED RANDOM VARIABLES; INTENSIVE RESEARCH; MATHEMATICAL ANALYSIS; SCHEDULING PROBLEM; THEORETICAL MODELING; TRADITIONAL APPROACHES; UPPER AND LOWER BOUNDS;

SCHEDULING;

EID: 0034562037     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s002240010013     Document Type: Article

References (36)

1. Bast, H. (2000), Provably Optimal Scheduling of Similar Tasks, Ph.D. thesis, Universität des Saarlandes.
2. Bull, J. M. (1998), Feedback guided dynamic loop scheduling: algorithms and experiments, in Proceedings, European Conference on Parallel Computing (EURO-PAR '98), pp. 377-382, Lecture Notes in Computer Science 1470, Springer-Verlag, Berlin.
3. Coffman, E. G. (1976), Computer and Job-Shop Scheduling Theory, Wiley, New York.
4. Durand, M. D., Jalby, W., Kervella, L., and Montaut, T. (1996), Impact of memory contention on dynamic scheduling on NUMA multiprocessors, IEEE Transactions on Parallel and Distributed Systems, 11, 1201-1214.
5. Eager, D. L., and Subramaniam, S. (1994), Affinity scheduling of unbalanced workloads, in Proceedings, Supercomputing (SC '94), pp. 214-226.
6. Eager, D. L., and Zahorjan, J. (1992), Adaptive Guided Self-Scheduling, Technical Report 92-01-01, Department of Computer Science and Engineering, University of Washington.
7. Flynn, L. E., Hummel, S. F., and Schonberg, E. (1992), Factoring: a method for scheduling parallel loops, Communications of the ACM 35(8), 90-101.
8. Garey, M. R., and Johnson, D. S. (1979), Computers and Intractability, a Guide to the Theory of NP-Completeness, Freemann, San Francisco, California.
9. Graham, R. L. (1966) Bounds for certain multi-processing anomalies, Bell System Technical Journal 45, 1563-1581.
10. Grimmett, G. R., and Stirzaker, D. R. (1992), Probability and Random Processes (2nd edn.), Oxford University Press, Oxford.
11. Gumbel, E. J. (1954), The maxima of the mean largest value and of the range, Annals of Mathematical Statistics 25, 76-84.
12. Hagerup, T. (1996), Allocating independent tasks to parallel processors: an experimental study, in Proceedings, Parallel Algorithms for Irregularly Structured Problems (IRREGULAR 1996), pp. 1-33, Lecture Notes in Computer Science 1117, Springer-Verlag, Berlin.
13. Hagerup, T. (1997), Allocating independent tasks to parallel processors: an experimental study, Journal of Parallel and Distributed Computing 47, 185-197.
14. Hartley, H. O., and David, H. A. (1954), Universal bounds for mean range and extreme observation, Annals of Mathematical Statistics 25, 85-99.
15. Hummel, S. F., Banicescu, I., Wang, C., and Wein, J. (1995), Load balancing and data locality via fractiling: an experimental study, in Proceedings, 3rd Workshop on Languages, Compilers, and Run-Time Systems for Scalable Computers (LCR '95), pp. 85-98, Kluwer, Dordrecht.
16. Hummel, S. F., Kimelman, D., Schonberg, E., Tennehouse, M., and Zernik, D. (1997), Using program visualization for tuning parallel-loop scheduling, IEEE Concurrency 5, 26-40.
17. Hummel, S. F., Schmidt, J., Uma, R. N., and Wein, J. (1996), Load-sharing in heterogeneous systems via weighted factoring, in Proceedings, 8th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA '96), pp. 318-328.
18. Kruskal, C. P., and Weiss, A. (1985), Allocating independent subtasks on parallel processors, IEEE Transactions on Software Engineering 11, 1001-1016.
19. Liu, J., Lam B. Y., and Saletore, V. A. (1993), Scheduling non-uniform parallel loops on distributed memory machines, in Proceedings, Hawaii International Conference on System Sciences, vol. 2, pp. 516-525.
20. Liu, J., and Saletore, V. A. (1993), Self-scheduling on distributed-memory machines, in Proceedings, Supercomputing (SC '93), pp. 814-823.
21. Liu, J., Saletore, V. A., and Lewis, T. G. (1994), Safe self scheduling - a parallel loop scheduling scheme for shared-memory multiprocessors, International Journal of Parallel Programming 22(6), 589-616.
22. Lucco, S. (1992), A dynamic scheduling method for irregular parallel programs, in Proceedings, Conference on Programming Language Design and Implementation (PLDI '92), pp. 200-211.
23. Lusk, E. L., and Overbeek, R. A., (1983), Implementation of Monitors with Macros: a Programming Aid for the HEP and Other Parallel Processors, Technical Report ANL-83-97, Argonne National Laboratory, Argonne, Illinois.
24. Markatos, E. P., and LeBlanc, T. J. (1994), Using processor affinity in loop scheduling on shared-memory multiprocessors, IEEE Transactions on Parallel and Distributed Systems 5(4), 379-400.
25. Orlando, S., and Perego, R. (1998), A comparison of implementation strategies for nonuniform data-parallel computations, Journal of Parallel and Distributed Computing 52, 132-149.
26. Orlando, S., and Perego, R. (1998), Scheduling data-parallel computations on heterogeneous and time-shared environments, in Proceedings, European Conference on Parallel Computing (EURO-PAR '98), pp. 356-365, Lecture Notes in Computer Science 1470, Springer-Verlag, Berlin.
27. Petrov, V. V. (1995), Limit Theorems of Probability Theory, Oxford University Press, Oxford.
28. Pinedo, M. (1995), Scheduling: Theory, Algorithms, and Systems, Prentice-Hall, Englewood Cliffs, New Jersey.
29. Polychronopoulos, C. D., and Kuck, D. J. (1987), Guided self-scheduling: a practical scheduling scheme for parallel supercomputers, IEEE Transactions on Computers 36, 1425-1439.
30. Rudolph, D. C., and Polychronopoulos, C. D. (1989), An efficient message-passing scheduler based on guided self-scheduling, in Proceedings International Conference on Supercomputing (ICS '89), pp. 50-60.
31. Shmoys, D. B., Wein, J., and Williamson, D. P. (1995), Scheduling parallel machines online, SIAM Journal of Computing 24, 1313-1331.
32. Smith, B. (1981), Architecture and applications of the HEP multiprocessor computer system, in Proceedings, SPIE Symposium (Real Time Processing IV), pp. 241-248.
33. Tang, P., and Yew, P. C. (1986), Processor self-scheduling for multiple-nested parallel loops, in Proceedings, International Conference on Parallel Processing (ICPP '86), pp. 528-535.
34. Tzen, T. H., and Ni, L. M. (1993), Trapezoid self-scheduling - a practical scheduling scheme for parallel compilers, IEEE Transactions on Parallel and Distributed Systems 4(1), 87-98.
35. Wolfe, M. (1996) High Performance Compilers for Parallel Computing, Addison-Wesley, Amsterdam.
36. Yan, Y., Jin, C., and Zhang, X. (1997), Adaptively scheduling parallel loops in distributed shared-memory systems, IEEE Transactions on Parallel and Distributed Systems 8(1), 70-81.