This Article 
 Bibliographic References 
 Add to: 
Optimal Search Policies for Searches with I/O Bound Tasks
September 1989 (vol. 38 no. 9)
pp. 1314-1320
Two models are presented for conducting simple searches under the assumption that the tasks within the search tree are complex and may be I/O bound. The objective is to achieve the minimum expected time to completion. The simpler model assumes that the search paths are disjoint. The optimal policy in the general case is to run the tasks with the highest ratio of success probability per cycle ex

[1] M. R. Garey, "Simple binary identification problems,"IEEE Trans. Comput., vol. C-21, pp. 588-590, 1972.
[2] G. J. Li and B. W. Wah, "How good are parallel and ordered depth-first searches?" inProc. 1986 Int. Conf. Parallel Processing, 1986.
[3] K. S. Natarajan, "Optimizing depth-first search of AND-OR trees," Rep. RC-11842, IBM T. J. Watson Res. Cent., Apr. 23, 1986.
[4] H. Simon and J. B. Kadane, "Optimal problem-solving search: All-or-none solutions,"Artif. Intell., vol. 6, no. 3, pp. 235-247, 1975.

Index Terms:
optimal search policies; searches; I/O bound tasks; models; search tree; optimal policy; optimum scheduling policy; scheduling; search problems; trees (mathematics).
H.S. Stone, "Optimal Search Policies for Searches with I/O Bound Tasks," IEEE Transactions on Computers, vol. 38, no. 9, pp. 1314-1320, Sept. 1989, doi:10.1109/12.29470
Usage of this product signifies your acceptance of the Terms of Use.