{"_id":"oo2jDC8zGs8mdSMbs","bibbaseid":"safari-huisman-formalverificationofparallelstreamcompactionandsummedareatablealgorithms-2020","authorIDs":[],"author_short":["Safari, M.","Huisman, M."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"propositions":[],"lastnames":["Safari"],"firstnames":["Mohsen"],"suffixes":[]},{"propositions":[],"lastnames":["Huisman"],"firstnames":["Marieke"],"suffixes":[]}],"editor":[{"propositions":[],"lastnames":["Pun"],"firstnames":["Violet","Ka","I."],"suffixes":[]},{"propositions":[],"lastnames":["Stolz"],"firstnames":["Volker"],"suffixes":[]},{"propositions":[],"lastnames":["Simao"],"firstnames":["Adenilso"],"suffixes":[]}],"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","bibtex":"@InProceedings{10.1007/978-3-030-64276-1_10,\nauthor={Safari, Mohsen\nand Huisman, Marieke},\neditor={Pun, Violet Ka I.\nand Stolz, Volker\nand Simao, Adenilso},\ntitle={Formal Verification of Parallel Stream Compaction and Summed-Area Table Algorithms},\nbooktitle={Theoretical Aspects of Computing -- ICTAC 2020},\nyear={2020},\npublisher={Springer International Publishing},\naddress={Cham},\npages={181-199},\nabstract={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.},\nisbn={978-3-030-64276-1},\nurl={https://doi.org/10.1007/978-3-030-64276-1_10}\n}\n\n\n","author_short":["Safari, M.","Huisman, M."],"editor_short":["Pun, V. K. I.","Stolz, V.","Simao, A."],"key":"10.1007/978-3-030-64276-1_10","id":"10.1007/978-3-030-64276-1_10","bibbaseid":"safari-huisman-formalverificationofparallelstreamcompactionandsummedareatablealgorithms-2020","role":"author","urls":{"Paper":"https://doi.org/10.1007/978-3-030-64276-1_10"},"metadata":{"authorlinks":{}},"downloads":1},"bibtype":"inproceedings","biburl":"https://raw.githubusercontent.com/utwente-fmt/vercors-web/master/static/references.bib","creationDate":"2020-11-30T08:31:34.950Z","downloads":1,"keywords":[],"search_terms":["formal","verification","parallel","stream","compaction","summed","area","table","algorithms","safari","huisman"],"title":"Formal Verification of Parallel Stream Compaction and Summed-Area Table Algorithms","year":2020,"dataSources":["2tJugFYAignELAmZo","zT4KxAXTKvhK2Hrr4","cCvCnPTRQYq3qPe9y"]}