Title

Documents Allocation In Distributed Information Retrieval Systems: An Application Of Simulated Annealing

Abstract

To support the computational demands of information retrieval systems, in which a vast amount of documents are stored, distributed techniques have been developed. As a result, efficient data placement plays an increasingly significant role in enhancing the performance of information retrieval systems. It has been demonstrated that simulated annealing provides high-quality results for combinatorial optimization problems. However, existing simulated annealing schemes are memory-based algorithms; they are not suited for solving large problems which typically are too big to fit in the memory space in its entirety. Various buffer replacement policies, assuming either temporal or spatial locality, are not useful in this case since simulated annealing is based on a randomized search process. Poor locality of references will cause the memory to thrash because too many replacements are required. This phenomenon will incur excessive disk accesses and force the machine to run at the speed of the I/O subsystem. In this paper, we propose a random sampling approach to address the issue of excessive disk accesses during annealing. Both the analytical and experimental studies indicate that the new simulated annealing scheme can dramatically reduce the costly disk I/O activities while obtaining excellent optimized results.

Publication Date

12-1-1995

Publication Title

Microcomputer Applications

Volume

14

Issue

3

Number of Pages

129-136

Document Type

Article

Personal Identifier

scopus

Socpus ID

0029516912 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/0029516912

This document is currently not available here.

Share

COinS