Fat-trees: universal networks for hardware-efficient supercomputing
IEEE Transactions on Computers
Partitioned posting files: a parallel inverted file structure for information retrieval
SIGIR '90 Proceedings of the 13th annual international ACM SIGIR conference on Research and development in information retrieval
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Parallel text retrieval on a high performance supercomputer using the Vector Space Model
SIGIR '95 Proceedings of the 18th annual international ACM SIGIR conference on Research and development in information retrieval
Introduction to Modern Information Retrieval
Introduction to Modern Information Retrieval
| Hi-index | 0.00 |
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.