This Article 
 Bibliographic References 
 Add to: 
Multiprocessor Document Allocation: A Genetic Algorithm Approach
July-August 1997 (vol. 9 no. 4)
pp. 640-642

Abstract—We formally define the Multiprocessor Document Allocation Problem (MDAP) and prove it to be computationally intractable (NP Complete). Once it is shown that MDAP is NP Complete, we describe a document allocation algorithm based on genetic algorithms. This algorithm assumes that the documents are clustered using any one of the many clustering techniques. We later show that our allocation algorithm probabilistically converges to a good solution. For a behavioral evaluation, we present sample experimental results.

[1] I.J. Aalbersberg and F. Sijstermans, "High-Quality and High Performance Full-Text Document Retrieval: The Parallel Infoguide System," Proc. IEEE Conf. Parallel and Distributed Information Systems, pp. 142-150, Dec. 1991.
[2] S.H. Bokhari, "On the Mapping Problem," IEEE Trans. Computers, vol. 30, no. 3, pp. 207-214, Mar. 1981.
[3] J. Cringean, R. England, G. Manson, and P. Willett,“Parallel text searching in serial files using a processor farm,”inProc. ACM SIGIR Conf., 1990, pp. 413–428.
[4] P. Efraimidis, C. Glymidakis, B. Mamalis, P. Spirakis, and B. Tampakas, "Parallel Text Retrieval on a High Performance Super Computer Using the Vector Space Model," Proc. ACM SIGIR, July 1995.
[5] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness.New York: W.H. Freeman, 1979.
[6] D. Grossman, O. Frieder, D. Holmes, and D. Roberts, "Integrating Structured Data and Text: A Relational Approach," J. Am. Soc. Information Science, Jan. 1997.
[7] D.E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning. Reading, Mass.: Addison-Wesley, 1989.
[8] D. Hawking and P. Thistlewaite, "Searching for Meaning with the Help of PADRE," Overview Third Text Retrieval Conf. (TREC 3), Apr. 1995.
[9] C.A. Pogue, E.M. Rasmussen, and P. Willett, "Searching and Clustering of Databases Using the icl Distributed Array Processor," Parallel Computing, vol. 8, pp. 399-407, Oct. 1988.
[10] G. Salton and C. Buckley,“Parallel text search methods,”CACM, vol. 31, no. 2, pp. 202–215, Feb. 1988.
[11] H.T. Siegelmann and O. Frieder, "Document Allocation in Multiprocessor Information Retrieval Systems," Lecture Note Series in Computer Science: Advanced Database Concepts and Research Issues, N.R. Adam and B. Bhargava, eds., Springer-Verlag, 1993.
[12] C. Stanfill,“Partitioned posting files: A parallel inverted file structure for information retrieval,”inProc. ACM SIGIR Conf,, 1990, pp. 413–428.

Index Terms:
Genetic algorithms, information systems, information retrieval, multiprocessor, parallel processing, data placement, data allocation.
Ophir Frieder, Hava T. Siegelmann, "Multiprocessor Document Allocation: A Genetic Algorithm Approach," IEEE Transactions on Knowledge and Data Engineering, vol. 9, no. 4, pp. 640-642, July-Aug. 1997, doi:10.1109/69.617055
Usage of this product signifies your acceptance of the Terms of Use.