A Comparative Analysis of Parallel Disk-Based Methods for Enumerating Implicit Graphs

It is only in the last five years that researchers have begun to use disk-based search techniques on a large scale. The primary examples of its use come from symbolic algebra and from artificial intelligence. In the field of parallel search, disk-based search has been forced on researchers because the historical growth in the amount of RAM per CPU core has now stopped. Indeed, the current trend toward multi-core CPUs now threatens to take one backwards. This paper makes an original contribution to the design of disk-based parallel search algorithms.