ALPS is a framework for implementing and parallelizing tree search algorithms. It employs a number of features to improve scalability and is designed specifically to support the implementation of data intensive algorithms, in which large amounts of knowledge are generated and must be maintained and shared during the search. Implementing such algorithms in a scalable manner is challenging both because of storage requirements and because of communications overhead incurred in the sharing of data. In this abstract, we describe the design of ALPS and how the design addresses these challenges. We present two sample applications built with ALPS and preliminary computational results. © 2005 Springer Science+Business Media, Inc.
CITATION STYLE
Xu, Y., Ralphs, T. K., Ladányi, L., & Saltzman, M. J. (2005). Alps: A framework for implementing parallel tree search algorithms. Operations Research/ Computer Science Interfaces Series, 29, 319–334. https://doi.org/10.1007/0-387-23529-9_21
Mendeley helps you to discover research relevant for your work.