Abstract
In this paper, we present a new, efficient, parallel text retrieval algorithm, appropriate for concurrent processing of multiple text queries in very low total execution times. Our approach is based on the widely-known vector space text processing model assuming the existence of a high-capacity interconnection network, such as the fully connected hypercube.We exploit the large number of available communication links of the hypercube and develop efficient parallel protocols under heavy query load, we give their detailed theoretical analysis and prove their optimal performance. We also prove the better performance of our protocols on hypercubes vs. other a) high capacity interconnection topologies like ideal fat-trees and b) single query parallel text retrieval methods. All the above results are also experimentally demonstrated via suitable embeddings on the Parsytec GCel3/512 supercomputer.
Chapter PDF
Keywords
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
P. Efraimidis, C. Glymidakis, B. Mamalis, P. Spirakis and B. Tampakas, “Parallel Text Retrieval on a High Performance Supercomputer Using the Vector Space Model”, ACM SIGIR’95 Conference, July 9–13, Seattle, pp. 58–66, 1995.
B. Mamalis, P. Spirakis and B. Tampakas, “Optimal High Performance Parallel Text Retrieval via Fat Trees”, (full version), to appear in the Theory of Computing Systems (TOCS) journal, Dec. 1997.
C. Stanfill, “Partitioned Posting Files: A Parallel Inverted File Structure for Information Retrieval”, ACM SIGIR’90, pp. 413–428, June 1990.
J. Cringean, M. Lynch, G. Manson and P. Willett, “Best Match Searching in Document Retrieval Systems Using Transputer Networks”, London: British Library Research and Developement Department, 1989.
G. Salton and McGill, “An Introduction to Information Retrieval”,2nd edition, MacGraw-Hill, c1983.
C. Leiserson, “Universal Networks for Hardware-Efficient Supercomputing”, IEEE Transactions on Computers, Vol. C-34, No. 10, October 1985.
F.T. Leighton, “Introduction to Parallel Algorithms and Architectures: Arrays, Trees and Hypercubes”, Morgan Kaufmann Publishers, Inc., c1992.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mamalis, B., Spirakis, P., Tampakas, B. (1999). Parallel Processing of Multiple Text Queries on Hypercube Interconnection Networks⋆. In: Amestoy, P., et al. Euro-Par’99 Parallel Processing. Euro-Par 1999. Lecture Notes in Computer Science, vol 1685. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48311-X_65
Download citation
DOI: https://doi.org/10.1007/3-540-48311-X_65
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66443-7
Online ISBN: 978-3-540-48311-3
eBook Packages: Springer Book Archive