General bounds for the assignment of irregular dependency graphs
Given an irregular dependency graph consisting of interdependent tasks, the problem of finding an optimal assignment on a number of parallel execution units is NP-complete. Assignment schemes thus settle for some heuristics that produce sub-optimal solutions. Most popular of these are the work-greedy assignment schemes. This paper presents new bounds on the performance of work-greedy schemes, taking into account the degree of parallelism visible between the tasks and the inter-task communication delays.
KeywordsAllocation Dependency graphs Instruction-level parallelism Scheduling Processor assignment
Unable to display preview. Download preview PDF.
- 2.Coffman, E. G., Ed. Computer and Job Shop Scheduling Theory. John Wiley and Sons, 1976.Google Scholar
- 4.Fernandez, E. B., and Bussell, B. Bounds on the number of processors and time for multiprocessor optimal schedules. IEEE Transactions on Computers C-22, 8 (August 1973), 745–751.Google Scholar
- 5.Gerasoulis, A., Venugopal, S., and Yang, T. Clustering task graphs for message passing architectures. In Proceedings of the International Conference on Supercomputing. ACM Press, Amsterdam, The Netherlands, June 11–15, 1990, pp. 447–456.Google Scholar
- 6.Graham, R. L. Bounds on the performance of scheduling algorithms. In Computer and Job Shop Scheduling Theory, E. G. Coffman, Ed. John Wiley and Sons, 1976, pp. 165–227.Google Scholar
- 10.Kruatrachue, B., and Lewis, T. Duplication scheduling heuristics, a new precedence task scheduler for parallel systems. Tech. Rep. 87-60-3, Computer Science Department, Oregon State University, Corvallis OR, 1987.Google Scholar
- 12.Manoharan, S., and Thanisch, P. Assigning dependency graphs onto processor networks. Parallel Computing 17, 1 (April 1991), 63–73.Google Scholar
- 14.McNaughton, R. Scheduling with deadlines and loss functions. Management Science 6 (October 1959).Google Scholar
- 16.Sarkar, V.Partitioning and Scheduling Parallel Programs for Multiprocessors. MIT Press, Cambridge MA, 1989.Google Scholar
- 17.Ullman, J. D. Complexity of sequencing problems. In Computer and Job Shop Scheduling Theory, E. G. Coffman, Ed. John Wiley and Sons, 1976, pp. 139–164.Google Scholar