Formal Verification of Parallel Stream Compaction and Summed-Area Table Algorithms. Safari, M. & Huisman, M. In Pun, V. K. I., Stolz, V., & Simao, A., editors, Theoretical Aspects of Computing – ICTAC 2020, pages 181-199, Cham, 2020. Springer International Publishing.
Formal Verification of Parallel Stream Compaction and Summed-Area Table Algorithms [link]Paper  abstract   bibtex   1 download  
Dedicated many-core processors such as GPGPUs, enable programmers to design and implement parallel algorithms to optimize performance. The stream compaction and summed-area table algorithms are two examples where parallel versions have been proposed in the literature with substantial speed ups compared to sequential counterparts.
@InProceedings{10.1007/978-3-030-64276-1_10,
author={Safari, Mohsen
and Huisman, Marieke},
editor={Pun, Violet Ka I.
and Stolz, Volker
and Simao, Adenilso},
title={Formal Verification of Parallel Stream Compaction and Summed-Area Table Algorithms},
booktitle={Theoretical Aspects of Computing -- ICTAC 2020},
year={2020},
publisher={Springer International Publishing},
address={Cham},
pages={181-199},
abstract={Dedicated many-core processors such as GPGPUs, enable programmers to design and implement parallel algorithms to optimize performance. The stream compaction and summed-area table algorithms are two examples where parallel versions have been proposed in the literature with substantial speed ups compared to sequential counterparts.},
isbn={978-3-030-64276-1},
url={https://doi.org/10.1007/978-3-030-64276-1_10}
}

Downloads: 1