Abstract
This paper deals with the minimization of inter-task and inter-processor communication costs in the context of one SQL query mapping onto a shared nothing architecture, as far as the parallel decisional query processing is concerned. After setting both the models of the application handled and the target multiprocessor architecture, a study aimed at minimizing both inter-processor transfer times depending on the interconnection network topology, and the impact of pipeline starting/closing (start-up) times, is mainly presented.
Chapter PDF
Keywords
- Communication Cost
- Communication Mode
- Mapping Configuration
- Multiprocessor Architecture
- Expert System Application
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
BONNEAU, S. et al., “Placement d'un programme bases de données sur one architecture multiprocesseur à mémoire distribuée: minimisation des coots de communication”, Rapport de Recherche, No. IRIT/97-08-R, Lab. IRIT, Janvier 1997, 23 pages.
ENGLERT, S., et al., “Parallelism and its price: a case study of Nonstop SQL/MP”, Sigmod Record, vol. 24, no4, Dec. 1995, pp. 61–71.
HAMEURLAIN, A., et al., “An Optimization Method of Data Communication and Control for Parallel Execution of SQL Queries”, Intl. Conf. on Database and Expert Systems Applications, LNCS, no720, Prague, Sept. 6–9, 1993, pp. 301–312.
HAMEURLAIN, A., et al.,“A Cost Evaluator for Parallel Database Systems”, 6th Intl. Conf. on Database and Expert Systems Applications, DEXA'95, London, 4–8 Sept. 1995, LNCS, no978, pp. 146–156.
HAMEURLAIN, A., et al., “Scheduling and Mapping for Parallel Execution of Extended SQL Queries”, 4th Intl. Conf. on Information and Knowledge Management, ACM Press, Baltimore, Maryland, 28 Nov.–2 Dec. 1995, pp. 197–204.
HASAN, W., “Optimization of SQL queries for parallel machines”, dissertation fot the degree of Doctor of Philosophy, Stanford University, Dec. 1995.
LO, Y.L., et al., “Scheduling queries for parallel execution on multicomputer Database Management System”, 7th Intl. Conf. on Database and Expert Systems Applications, DEXA'96, Zurich, Sept. 1996, LNCS, no1134, pp. 698–707.
MAHIOUT, A., et al., “Modéliser les dépendances entre les tâches data-parallèles pour le placement et l'ordonnancement automatique”, 6ièmes Rencontres Francophones du parallélisme, Lyon, Juin 1994, pp. 37–40.
SCHNEIDER, D., et al.,“Tradeoffs in Processing Complex Join Queries via Hashing in Multiprocessor Database Machines”, Proc. of the 16th VLDB Conf., Brisbane, Australia 1990, pp. 469–480.
WOLF, J. L., et al., “A Hierarchical Approach to Parallel Multiquery Scheduling”, IEEE Transactions on Parallel and Distributed Systems, 1995, vol. 6, no6, pp. 578–589. *** DIRECT SUPPORT *** A0008C42 00040
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bonneau, S., Hameurlain, A. (1997). Database program mapping onto a shared-nothing multiprocessor architecture: Minimizing communication costs. In: Lengauer, C., Griebl, M., Gorlatch, S. (eds) Euro-Par'97 Parallel Processing. Euro-Par 1997. Lecture Notes in Computer Science, vol 1300. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0002866
Download citation
DOI: https://doi.org/10.1007/BFb0002866
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63440-9
Online ISBN: 978-3-540-69549-3
eBook Packages: Springer Book Archive