Issue No. 09 - September (1989 vol. 38)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.29470
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
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. , pp. 1314-1320, September 1989, doi:10.1109/12.29470