Abstract
This is the artifact for the paper titled "POKER: Permutation-based SIMD Execution of Intensive Tree Search by Path Encoding" accepted at CGO 2018. This artifact helps reproduce the results presented in Figures 7 - 9 and Tables 2 - 3 in Section 4. For more information on how to use it, please refer to our paper and the README.txt file in this package. Please note that POKER is a work in progress. This artifact is a snapshot of this work and thus is only applicable under the experimental settings described in this paper. Please feel free to contact the authors if you have any questions.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
