By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
D. F. Ghazfan ; Dept. of Comput. Sci., Monash Univ., Clayton, Vic., Australia ; B. Srinivasan

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

Published in:

System Sciences, 1993, Proceeding of the Twenty-Sixth Hawaii International Conference on  (Volume:ii )

Date of Conference:

5-8 Jan 1993