An Approach to Implementing State Space Searches on Heterogeneous Systems of Multiprocessors
Barney Glickfeld, Ross Overbeek · CERN Document Server (European Organization for Nuclear Research) · 1987
We report on experiments run on a set of shared-memory multiprocessors. Our goal was to demonstrate that one could conveniently utilize a set of shared-memory multiprocessors cooperatively working on typical state-space searches. We utilized a technology for writing portable code for multiprocessors, coded three depth-first state-space searches, and ran them on a set of multiprocessors. The final problem used substantial resources (over 65 hours on a single processor) and was successfully distributed over four distinct shared memory multiprocessors (2 Sequents and 2 Encores), reducing the time to perform the computation to slightly over 2 hours.