Abstract
Parallel database systems try to accomplish two objectives. Parallelism within a single query aims at shorter response time, parallelism among different queries aims at higher throughput. The problem to process a given set of parallel queries in parallel can be interpreted as a 2-dimensionai packing and cutting problem. The objective is to minimize the makespan, i.e., the last job’s completion time. Two algorithms, sequential deterministic arrangement and a shelf-algorithm, are evaluated under different conditions. The simulation model assumes a single bottleneck resource on each processing node. Both algorithms perform 20% to 30% better than processing in random order, but neither is superior to the other one under all conditions. Depending on the load, their relative performance depends on the correctness of the load estimates that are used for planning, and the degree to which the set of processing nodes for a single query can be chosen freely.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A. Burger. Steuerung der Anfragebearbeitung in parallelen Datenbanksystemen auf der Basis von OR-Verfahren zur Verschnittminimierung. Diplomarbeit, Universität Karlsruhe, Fakultät für Wirtschaftswissenschaften, Karlsruhe, Germany, July 1994.
D.J. DeWitt and J. Gray. Parallel Database Systems: The Future of High Performance Database Systems. Communications of the ACM, 35(6):85–98, June 1992.
H. Dyckhoff. A Typology of Cutting and Packing Problems. European Journal of Operations Research, 44(2):145–159, 1990.
R. Kramer. Steuerung der Anfragebearbeitung in parallelen Datenbanksystemen. PhD thesis, Universität Karlsruhe, Fakultät für Informatik, Karlsruhe, Germany, December 1992.
J. Melton and A. R. Simon. Understanding the New SQL: A Complete Guide. Morgan Kaufmann Publishers, San Mateo, California, USA, 1993.
P.E. Sweeney and E. Ridenour-Paternoster. Cutting and Packing Problems: A Categorized, Application-Oriented Research Bibliography. Journal of the Operations Research Society, 43(7):691–706, 1992.
J. Terno, R. Lindemann, and G. Scheithauer. Zuschnittprobleme und ihre praktische Lösung; Mathematische Modelle von Layout-Problemen. Verlag Harri Deutsch, Thun, Frankfurt/Main, 1987.
J. Turek, J. L. Wolf, K. R. Pattipati, and P. S. Yu. Scheduling Parallelizable Tasks: Putting it all on the Shelf. In ACM Sigmetrics and Performance’92, volume 20, pages 225–236, June 1992.
G. v. Bültzingsloewen, R. Kramer, and M. Schryro. PANDA: A Testbed for Investigating Strategies for Parallel Query Execution. In Proc. 2nd IEEE Intl. Conf. on Parallel and Distributed Information Systems, pages 103 – 106, San Diego, California, USA, January 1993.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kramer, R., Morlock, M. (1996). Scheduling Parallel Database Queries Using Heuristics for 2-Dimensional Packing and Cutting Problems. In: Kleinschmidt, P., Bachem, A., Derigs, U., Fischer, D., Leopold-Wildburger, U., Möhring, R. (eds) Operations Research Proceedings 1995. Operations Research Proceedings, vol 1995. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-80117-4_27
Download citation
DOI: https://doi.org/10.1007/978-3-642-80117-4_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60806-6
Online ISBN: 978-3-642-80117-4
eBook Packages: Springer Book Archive