Abstract
Network of workstations (NOW) is a cost-effective alternative to a multiprocessor system. Here we propose a centralized architecture for parallel query processing on network of workstations. We describe a three-level processing strategy and evaluate its performance. The top two levels use a space-sharing technique to assign a partition to a query. The third-level uses a chunk-based load sharing policy to accommodate dynamic local load present on the workstations. To evaluate the performance of this three-level strategy, we have implemented it using PVM on a Pentium-based NOW.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
T. Anderson, David Culler, David Patterson, and the NOW team, “A Case for NOW (Networks of Workstations)”, IEEE Micro, February 1995, pp. 54–64.
S. Dandamudi, “Using Networks of Workstations for Database Query Operations”, Int. Conf. Computers and Their Applications, Tempe, March 1997, pp. 100–105.
S. P. Dandamudi, “Sensitivity Evaluation of Dynamic Load Sharing in Distributed Systems”, IEEE Concurrency, July–September 1998, pp. 62–72.
S. Dandamudi and H. Yu, “Performance Sensitivity of Space-Sharing Processor Scheduling in Distributed-Memory Multicomputers”, 12th Int. Parallel Processing Symp., March 1998, Orlando, Florida, pp. 403–409.
S. Dandamudi and G. Jain, “Architectures for Parallel Query Processing on Networks of Workstations”, Int. Conf. Parallel and Distributed Computing Systems, New Orleans, October 1997, pp. 444–451.
A. Giest, A. Beguelin, J. Dongarra, W. Jiang, R. Mancheck V. Sunderam, PVM: Parallel Virtual Machine—A Users' Guide and Tutorial for Networked Parallel Computing, The MIT Press, 1994.
D. J. Lilja, “Exploiting the Parallelism Available in Loops”, Computer, February 1994, pp. 13–26.
E. Rosti, E. Smirni, L. W. Dowdy, G. Serazzi, B. M. Carlson. “Pobust Partitioning Policies of Multiprocessor Systems”, Performance Evaluation, Vol. 19, 1994, pp. 141–165.
E. Rosti, E. Smirni, L. W. Dowdy, G. Serrazi, and K. C. Sevcik, “Processor Saving Scheduling Policies for Multiprocessor Systems”, IEEE Trans. Computers, Vol. 47, No. 2, February 1998.
K. C. Sevcik, “Application Scheduling and Processor Allocation in Multiprogrammed Parallel Processing Systems”, Performance Evaluation 19, 1994, pp. 107–140.
N. G. Shivaratri, P. Krueger and M. Singhal, “Load Distributing for Locally Distributed Systems”, Computer, December 1992, pp. 33–44.
S. Zeng, Centralized Architecture for Query Processing on Networks of Workstations, MCS Thesis, School of Computer Science, Carleton University, 1998.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1999 Springer-Verlag
About this paper
Cite this paper
Zeng, S., Dandamudi, S.P. (1999). Centralized architecture for parallel query processing on networks of workstations. In: Sloot, P., Bubak, M., Hoekstra, A., Hertzberger, B. (eds) High-Performance Computing and Networking. HPCN-Europe 1999. Lecture Notes in Computer Science, vol 1593. Springer, Berlin, Heidelberg . https://doi.org/10.1007/BFb0100629
Download citation
DOI: https://doi.org/10.1007/BFb0100629
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65821-4
Online ISBN: 978-3-540-48933-7
eBook Packages: Springer Book Archive