Abstract
We investigate a class of scheduling problems that arise in the optimization of SQL queries for parallel machines (Chekuri et al. in PODS’95, pp. 255–265, 1995). In these problems, an undirected graph is used to represent communication and inter-operator parallelism. The goal is to minimize the global response time of the system.
We provide a polynomial time approximation scheme for the special cases where the operator graph is a tree, thereby improving on a polynomial time 2.87-approximation algorithm by Chekuri et al. The approximation scheme is generalized to the case where the operator graph has treewidth bounded by a constant. We analyze instances with small response times for general operator graphs: Deciding whether a response time of four time units can be reached is easy, but deciding whether a response time of six time units can be reached is NP-hard. Finally, we prove that for general operator graphs the existence of a polynomial time approximation algorithm with worst case performance guarantee better than 4/3 would imply P=NP.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Alon, N., Azar, Y., Woeginger, G. J., & Yadid, T. (1998). Approximation schemes for scheduling on parallel machines. Journal of Scheduling, 1, 55–66.
Bodlaender, H. L. (1996). A linear time algorithm for finding tree-decompositions of small treewidth. SIAM Journal on Computing, 25, 1305–1317.
Bodlaender, H. L. (1997). Treewidth: Algorithmic techniques and results. In I. Privara & P. Ruzicka (Eds.), LNCS: Vol. 1295. Proceedings of the 22nd international symposium on mathematical foundations of computer science (MFCS’1997) (pp. 19–36). Berlin: Springer.
Bodlaender, H. L. (1998). A partial k-arboretum of graphs with bounded treewidth. Theoretical Computer Science, 209, 1–45.
Borie, R. B., Parker, R. G., & Tovey, C. A. (1991). Deterministic decomposition of recursive graph classes. SIAM Journal on Discrete Mathematics, 4, 481–501.
Chekuri, C., Hasan, W., & Motwani, R. (1995). Scheduling problems in parallel query optimization. In Proceedings of the 14th ACM symposium on principles of database systems (PODS’95) (pp. 255–265).
Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: a guide to the theory of NP -completeness. San Francisco: Freeman.
Gray, J. (1988). The cost of messages. In Proceedings of the 7th ACM symposium on principles of distributed computing (PODC’88) (pp. 1–7).
Hasan, W., & Motwani, R. (1994). Optimization algorithms for exploiting the parallelism-communication tradeoff in pipelined parallelism. In Proceedings of the 20th international conference on very large databases (pp. 36–47).
Hochbaum, D. S., & Shmoys, D. B. (1987). Using dual approximation algorithms for scheduling problems: theoretical and practical results. Journal of the Association of Computing Machinery, 34, 144–162.
Ibarra, O., & Kim, C. E. (1975). Fast approximation algorithms for the knapsack and sum of subset problems. Journal of the Association of Computing Machinery, 22, 463–468.
Lenstra, H. W. (1983). Integer programming with a fixed number of variables. Mathematics of Operations Research, 8, 538–548.
Veltman, B., Lageweg, B. J., & Lenstra, J. K. (1990). Multiprocessor scheduling with communication delays. Parallel Computing, 16, 173–182.
Wimer, T. V. (1987). Linear algorithms on k-terminal graphs. PhD thesis, Dept. of Computer Science, Clemson University.
Woeginger, G. J. (2000). When does a dynamic programming formulation guarantee the existence of an FPTAS? INFORMS Journal on Computing, 12, 57–75.
Author information
Authors and Affiliations
Corresponding author
Additional information
This research has been supported by the Netherlands Organization for Scientific Research (NWO), grant 639.033.403; by DIAMANT (an NWO mathematics cluster); and by BSIK grant 03018 (BRICKS: Basic Research in Informatics for Creating the Knowledge Society).
A preliminary version of this paper has appeared as an extended abstract in the proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, California: P. Schuurman and G.J. Woeginger, Scheduling a pipelined operator graph, pp. 207–212.
Rights and permissions
Open Access This is an open access article distributed under the terms of the Creative Commons Attribution Noncommercial License (https://creativecommons.org/licenses/by-nc/2.0), which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
About this article
Cite this article
Bodlaender, H.L., Schuurman, P. & Woeginger, G.J. Scheduling of pipelined operator graphs. J Sched 15, 323–332 (2012). https://doi.org/10.1007/s10951-011-0225-1
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10951-011-0225-1