On the allocations of documents in the distributed memory information retrieval system

Author

Ghazfan, Desra F. ; Srinivasan, Bala

Author_Institution

Dept. of Comput. Sci., Monash Univ., Clayton, Vic., Australia

fYear

1993

Firstpage

33

Abstract

A proper document allocation in a distributed memory information retrieval system is needed to improve the efficiency and the effectiveness of such a system. The allocation has to minimize the interprocessor communication traffic, at the same time maximizing the amount of parallelism. These requirements are NP-complete problems, and are conflicting. Genetic algorithms (GAs) are used to find an optimal allocation, and proved to be satisfactory. An improvement to a particular GA is successfully applied to refine the solution. During the experimentation, an interaction between the GA population size and its mutation probability is revealed

Keywords

computational complexity; distributed memory systems; genetic algorithms; information retrieval systems; NP-complete problems; distributed memory information retrieval system; documents allocation; genetic algorithms; mutation probability; Computer architecture; Computer science; Cost function; Databases; Distributed computing; Genetics; Information retrieval; Memory architecture; Scalability; Symmetric matrices;

fLanguage

English

Publisher

ieee

Conference_Titel

System Sciences, 1993, Proceeding of the Twenty-Sixth Hawaii International Conference on

Conference_Location

Wailea, HI

Print_ISBN

0-8186-3230-5

Type

conf

DOI

10.1109/HICSS.1993.284054

Filename

284054