Abstract
Network of workstations (NOW) is an attractive alternative to parallel database systems. Here we present a distributed architecture for parallel query processing on networks of workstations. We describe a comprehensive design that synthesizes knowledge from parallel and distributed systems area on scheduling, load sharing and loop scheduling. To study the performance of this architecture, we have implemented the distributed architecture using PVM on a Pentium-based NOW system. Our results show that the distributed architecture achieves good speedups and scaleups.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Dandamudi S.P., “Using Network of Workstations for Database Query Operations,” Proceedings of International Conference on Computers and Their Applications, Tempe, Arizona, 1997, pp. 100–105.
Dandamudi S.P. and Jain G., “Architecture for Parallel Query Processing on Networks of Workstations,” Proceedings of International Conference on Parallel and Distributed Computing Systems, New Orleans, 1997, pp. 444–451.
Dandamudi S.P., “Sensitivity Evaluation of Dynamic Load Sharing in Distributed System,” IEEE Concurrency, July/September 1998, pp. 62–72.
Dewitt D. and Gary J., “Parallel Database System: The Future of High Performance Database Systems,” Communications of The ACM, 1992, Vol. 35, No. 6, pp. 85–98.
A. Giest, A. Beguelin, J. Dongarra, W. Jiang, R. Mancheck, and V. Sunderam, “PVM: Parallel Virtual Machine — A Users’ Guide and Tutorial for Networked Parallel Computing”, The MIT Press, 1994.
Invited Lecture, Workshop on High Performance Computing on Very Large Datasets, 7th Int. Conf. High Performance Computing and Networking, Amsterdam, April 1999.
Harris E.P. and Ramamohanarao K., “Join Algorithm Costs Revisited,” VLDB Journal, Vol. 5, No. 1, 1996, pp. 64–84.
Lilja D.J., “Exploiting the Parallelism Available in Loops,” IEEE Computer, Vol. 27, No. 2, 1994, pp. 13–26.
Mishra P. and Eich M., “Join Processing in Relational Databases,” ACM Computing Surveys, Vol. 24, No. 1, 1992, pp. 63–113.
Shivaratri N.G., Krueger P., and Singhal M., “Load Distributing for Locally Distributed Systems,” IEEE Computer, Vol. 25, No. 12, 1992, pp. 34–44.
Soleimany C., Distributed Parallel Query Processing on Network of Workstations, M.C.S. Thesis, School of Computer Science, Carleton University, Ottawa, 1998.
B. Xie and S. Dandamudi “Hierarchical Architecture for Parallel Query Processing on Networks of Workstations,” Proceedings of the Int. Conf. High Performance Computing, Chennai, India, 1998, pp. 351–358.
S. Zeng and S. Dandamudi “Centralized Architecture for Parallel Query Processing on Networks of Workstations,” High Performance Computing and Networking, 1999, Amsterdam, pp. 683–692.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Soleimany, C., Dandamudi, S.P. (2000). Distributed Parallel Query Processing on Networks of Workstations. In: Bubak, M., Afsarmanesh, H., Hertzberger, B., Williams, R. (eds) High Performance Computing and Networking. HPCN-Europe 2000. Lecture Notes in Computer Science, vol 1823. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45492-6_42
Download citation
DOI: https://doi.org/10.1007/3-540-45492-6_42
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67553-2
Online ISBN: 978-3-540-45492-2
eBook Packages: Springer Book Archive