[{"_id":"29937","project":[{"_id":"52","name":"PC2: Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"department":[{"_id":"27"},{"_id":"518"}],"user_id":"3145","language":[{"iso":"eng"}],"publication":"2021 IEEE International Parallel and Distributed Processing Symposium (IPDPS)","type":"conference","status":"public","publisher":"IEEE","date_updated":"2024-01-22T09:59:13Z","date_created":"2022-02-21T14:26:37Z","author":[{"first_name":"Martin","full_name":"Karp, Martin","last_name":"Karp"},{"last_name":"Podobas","full_name":"Podobas, Artur","first_name":"Artur"},{"first_name":"Niclas","last_name":"Jansson","full_name":"Jansson, Niclas"},{"last_name":"Kenter","id":"3145","full_name":"Kenter, Tobias","first_name":"Tobias"},{"id":"16153","full_name":"Plessl, Christian","last_name":"Plessl","orcid":"0000-0001-5728-9982","first_name":"Christian"},{"full_name":"Schlatter, Philipp","last_name":"Schlatter","first_name":"Philipp"},{"first_name":"Stefano","full_name":"Markidis, Stefano","last_name":"Markidis"}],"title":"High-Performance Spectral Element Methods on Field-Programmable Gate Arrays : Implementation, Evaluation, and Future Projection","doi":"10.1109/ipdps49936.2021.00116","quality_controlled":"1","publication_status":"published","year":"2021","citation":{"apa":"Karp, M., Podobas, A., Jansson, N., Kenter, T., Plessl, C., Schlatter, P., &#38; Markidis, S. (2021). High-Performance Spectral Element Methods on Field-Programmable Gate Arrays : Implementation, Evaluation, and Future Projection. <i>2021 IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>. <a href=\"https://doi.org/10.1109/ipdps49936.2021.00116\">https://doi.org/10.1109/ipdps49936.2021.00116</a>","mla":"Karp, Martin, et al. “High-Performance Spectral Element Methods on Field-Programmable Gate Arrays : Implementation, Evaluation, and Future Projection.” <i>2021 IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>, IEEE, 2021, doi:<a href=\"https://doi.org/10.1109/ipdps49936.2021.00116\">10.1109/ipdps49936.2021.00116</a>.","bibtex":"@inproceedings{Karp_Podobas_Jansson_Kenter_Plessl_Schlatter_Markidis_2021, title={High-Performance Spectral Element Methods on Field-Programmable Gate Arrays : Implementation, Evaluation, and Future Projection}, DOI={<a href=\"https://doi.org/10.1109/ipdps49936.2021.00116\">10.1109/ipdps49936.2021.00116</a>}, booktitle={2021 IEEE International Parallel and Distributed Processing Symposium (IPDPS)}, publisher={IEEE}, author={Karp, Martin and Podobas, Artur and Jansson, Niclas and Kenter, Tobias and Plessl, Christian and Schlatter, Philipp and Markidis, Stefano}, year={2021} }","short":"M. Karp, A. Podobas, N. Jansson, T. Kenter, C. Plessl, P. Schlatter, S. Markidis, in: 2021 IEEE International Parallel and Distributed Processing Symposium (IPDPS), IEEE, 2021.","chicago":"Karp, Martin, Artur Podobas, Niclas Jansson, Tobias Kenter, Christian Plessl, Philipp Schlatter, and Stefano Markidis. “High-Performance Spectral Element Methods on Field-Programmable Gate Arrays : Implementation, Evaluation, and Future Projection.” In <i>2021 IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>. IEEE, 2021. <a href=\"https://doi.org/10.1109/ipdps49936.2021.00116\">https://doi.org/10.1109/ipdps49936.2021.00116</a>.","ieee":"M. Karp <i>et al.</i>, “High-Performance Spectral Element Methods on Field-Programmable Gate Arrays : Implementation, Evaluation, and Future Projection,” 2021, doi: <a href=\"https://doi.org/10.1109/ipdps49936.2021.00116\">10.1109/ipdps49936.2021.00116</a>.","ama":"Karp M, Podobas A, Jansson N, et al. High-Performance Spectral Element Methods on Field-Programmable Gate Arrays : Implementation, Evaluation, and Future Projection. In: <i>2021 IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>. IEEE; 2021. doi:<a href=\"https://doi.org/10.1109/ipdps49936.2021.00116\">10.1109/ipdps49936.2021.00116</a>"}},{"language":[{"iso":"eng"}],"department":[{"_id":"27"},{"_id":"518"}],"user_id":"3145","_id":"46195","status":"public","publication":"2021 IEEE International Parallel and Distributed Processing Symposium (IPDPS)","type":"conference","doi":"10.1109/ipdps49936.2021.00116","title":"High-Performance Spectral Element Methods on Field-Programmable Gate Arrays : Implementation, Evaluation, and Future Projection","author":[{"first_name":"Martin","last_name":"Karp","full_name":"Karp, Martin"},{"last_name":"Podobas","full_name":"Podobas, Artur","first_name":"Artur"},{"last_name":"Jansson","full_name":"Jansson, Niclas","first_name":"Niclas"},{"last_name":"Kenter","full_name":"Kenter, Tobias","id":"3145","first_name":"Tobias"},{"orcid":"0000-0001-5728-9982","last_name":"Plessl","id":"16153","full_name":"Plessl, Christian","first_name":"Christian"},{"first_name":"Philipp","last_name":"Schlatter","full_name":"Schlatter, Philipp"},{"full_name":"Markidis, Stefano","last_name":"Markidis","first_name":"Stefano"}],"date_created":"2023-07-28T12:04:27Z","publisher":"IEEE","date_updated":"2023-07-28T12:05:15Z","citation":{"ama":"Karp M, Podobas A, Jansson N, et al. High-Performance Spectral Element Methods on Field-Programmable Gate Arrays : Implementation, Evaluation, and Future Projection. In: <i>2021 IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>. IEEE; 2021. doi:<a href=\"https://doi.org/10.1109/ipdps49936.2021.00116\">10.1109/ipdps49936.2021.00116</a>","ieee":"M. Karp <i>et al.</i>, “High-Performance Spectral Element Methods on Field-Programmable Gate Arrays : Implementation, Evaluation, and Future Projection,” 2021, doi: <a href=\"https://doi.org/10.1109/ipdps49936.2021.00116\">10.1109/ipdps49936.2021.00116</a>.","chicago":"Karp, Martin, Artur Podobas, Niclas Jansson, Tobias Kenter, Christian Plessl, Philipp Schlatter, and Stefano Markidis. “High-Performance Spectral Element Methods on Field-Programmable Gate Arrays : Implementation, Evaluation, and Future Projection.” In <i>2021 IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>. IEEE, 2021. <a href=\"https://doi.org/10.1109/ipdps49936.2021.00116\">https://doi.org/10.1109/ipdps49936.2021.00116</a>.","apa":"Karp, M., Podobas, A., Jansson, N., Kenter, T., Plessl, C., Schlatter, P., &#38; Markidis, S. (2021). High-Performance Spectral Element Methods on Field-Programmable Gate Arrays : Implementation, Evaluation, and Future Projection. <i>2021 IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>. <a href=\"https://doi.org/10.1109/ipdps49936.2021.00116\">https://doi.org/10.1109/ipdps49936.2021.00116</a>","bibtex":"@inproceedings{Karp_Podobas_Jansson_Kenter_Plessl_Schlatter_Markidis_2021, title={High-Performance Spectral Element Methods on Field-Programmable Gate Arrays : Implementation, Evaluation, and Future Projection}, DOI={<a href=\"https://doi.org/10.1109/ipdps49936.2021.00116\">10.1109/ipdps49936.2021.00116</a>}, booktitle={2021 IEEE International Parallel and Distributed Processing Symposium (IPDPS)}, publisher={IEEE}, author={Karp, Martin and Podobas, Artur and Jansson, Niclas and Kenter, Tobias and Plessl, Christian and Schlatter, Philipp and Markidis, Stefano}, year={2021} }","mla":"Karp, Martin, et al. “High-Performance Spectral Element Methods on Field-Programmable Gate Arrays : Implementation, Evaluation, and Future Projection.” <i>2021 IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>, IEEE, 2021, doi:<a href=\"https://doi.org/10.1109/ipdps49936.2021.00116\">10.1109/ipdps49936.2021.00116</a>.","short":"M. Karp, A. Podobas, N. Jansson, T. Kenter, C. Plessl, P. Schlatter, S. Markidis, in: 2021 IEEE International Parallel and Distributed Processing Symposium (IPDPS), IEEE, 2021."},"year":"2021","quality_controlled":"1","publication_status":"published"},{"year":"2021","quality_controlled":"1","title":"HighPerMeshes – A Domain-Specific Language for Numerical Algorithms on Unstructured Grids","date_created":"2021-03-31T19:39:42Z","abstract":[{"lang":"eng","text":"Solving partial differential equations on unstructured grids is a cornerstone of engineering and scientific computing. Nowadays, heterogeneous parallel platforms with CPUs, GPUs, and FPGAs enable energy-efficient and computationally demanding simulations. We developed the HighPerMeshes C++-embedded Domain-Specific Language (DSL) for bridging the abstraction gap between the mathematical and algorithmic formulation of mesh-based algorithms for PDE problems on the one hand and an increasing number of heterogeneous platforms with their different parallel programming and runtime models on the other hand. Thus, the HighPerMeshes DSL aims at higher productivity in the code development process for multiple target platforms. We introduce the concepts as well as the basic structure of the HighPerMeshes DSL, and demonstrate its usage with three examples, a Poisson and monodomain problem, respectively, solved by the continuous finite element method, and the discontinuous Galerkin method for Maxwell’s equation. The mapping of the abstract algorithmic description onto parallel hardware, including distributed memory compute clusters, is presented. Finally, the achievable performance and scalability are demonstrated for a typical example problem on a multi-core CPU cluster."}],"file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":564398,"file_id":"21588","file_name":"2021-03 Alhaddad2021_Chapter_HighPerMeshesADomain-SpecificL.pdf","access_level":"closed","date_updated":"2021-03-31T19:42:52Z","creator":"fossie","date_created":"2021-03-31T19:42:52Z"}],"publication":"Euro-Par 2020: Parallel Processing Workshops","keyword":["tet_topic_hpc"],"ddc":["004"],"language":[{"iso":"eng"}],"place":"Cham","citation":{"mla":"Alhaddad, Samer, et al. “HighPerMeshes – A Domain-Specific Language for Numerical Algorithms on Unstructured Grids.” <i>Euro-Par 2020: Parallel Processing Workshops</i>, 2021, doi:<a href=\"https://doi.org/10.1007/978-3-030-71593-9_15\">10.1007/978-3-030-71593-9_15</a>.","short":"S. Alhaddad, J. Förstner, S. Groth, D. Grünewald, Y. Grynko, F. Hannig, T. Kenter, F.-J. Pfreundt, C. Plessl, M. Schotte, T. Steinke, J. Teich, M. Weiser, F. Wende, in: Euro-Par 2020: Parallel Processing Workshops, Cham, 2021.","bibtex":"@inbook{Alhaddad_Förstner_Groth_Grünewald_Grynko_Hannig_Kenter_Pfreundt_Plessl_Schotte_et al._2021, place={Cham}, title={HighPerMeshes – A Domain-Specific Language for Numerical Algorithms on Unstructured Grids}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-71593-9_15\">10.1007/978-3-030-71593-9_15</a>}, booktitle={Euro-Par 2020: Parallel Processing Workshops}, author={Alhaddad, Samer and Förstner, Jens and Groth, Stefan and Grünewald, Daniel and Grynko, Yevgen and Hannig, Frank and Kenter, Tobias and Pfreundt, Franz-Josef and Plessl, Christian and Schotte, Merlind and et al.}, year={2021} }","apa":"Alhaddad, S., Förstner, J., Groth, S., Grünewald, D., Grynko, Y., Hannig, F., Kenter, T., Pfreundt, F.-J., Plessl, C., Schotte, M., Steinke, T., Teich, J., Weiser, M., &#38; Wende, F. (2021). HighPerMeshes – A Domain-Specific Language for Numerical Algorithms on Unstructured Grids. In <i>Euro-Par 2020: Parallel Processing Workshops</i>. <a href=\"https://doi.org/10.1007/978-3-030-71593-9_15\">https://doi.org/10.1007/978-3-030-71593-9_15</a>","chicago":"Alhaddad, Samer, Jens Förstner, Stefan Groth, Daniel Grünewald, Yevgen Grynko, Frank Hannig, Tobias Kenter, et al. “HighPerMeshes – A Domain-Specific Language for Numerical Algorithms on Unstructured Grids.” In <i>Euro-Par 2020: Parallel Processing Workshops</i>. Cham, 2021. <a href=\"https://doi.org/10.1007/978-3-030-71593-9_15\">https://doi.org/10.1007/978-3-030-71593-9_15</a>.","ieee":"S. Alhaddad <i>et al.</i>, “HighPerMeshes – A Domain-Specific Language for Numerical Algorithms on Unstructured Grids,” in <i>Euro-Par 2020: Parallel Processing Workshops</i>, Cham, 2021.","ama":"Alhaddad S, Förstner J, Groth S, et al. HighPerMeshes – A Domain-Specific Language for Numerical Algorithms on Unstructured Grids. In: <i>Euro-Par 2020: Parallel Processing Workshops</i>. ; 2021. doi:<a href=\"https://doi.org/10.1007/978-3-030-71593-9_15\">10.1007/978-3-030-71593-9_15</a>"},"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783030715922","9783030715939"]},"has_accepted_license":"1","publication_status":"published","doi":"10.1007/978-3-030-71593-9_15","date_updated":"2023-09-26T11:40:25Z","author":[{"first_name":"Samer","last_name":"Alhaddad","id":"42456","full_name":"Alhaddad, Samer"},{"first_name":"Jens","orcid":"0000-0001-7059-9862","last_name":"Förstner","full_name":"Förstner, Jens","id":"158"},{"full_name":"Groth, Stefan","last_name":"Groth","first_name":"Stefan"},{"last_name":"Grünewald","full_name":"Grünewald, Daniel","first_name":"Daniel"},{"first_name":"Yevgen","full_name":"Grynko, Yevgen","id":"26059","last_name":"Grynko"},{"first_name":"Frank","full_name":"Hannig, Frank","last_name":"Hannig"},{"first_name":"Tobias","id":"3145","full_name":"Kenter, Tobias","last_name":"Kenter"},{"last_name":"Pfreundt","full_name":"Pfreundt, Franz-Josef","first_name":"Franz-Josef"},{"last_name":"Plessl","orcid":"0000-0001-5728-9982","full_name":"Plessl, Christian","id":"16153","first_name":"Christian"},{"first_name":"Merlind","full_name":"Schotte, Merlind","last_name":"Schotte"},{"last_name":"Steinke","full_name":"Steinke, Thomas","first_name":"Thomas"},{"first_name":"Jürgen","last_name":"Teich","full_name":"Teich, Jürgen"},{"full_name":"Weiser, Martin","last_name":"Weiser","first_name":"Martin"},{"first_name":"Florian","full_name":"Wende, Florian","last_name":"Wende"}],"status":"public","type":"book_chapter","file_date_updated":"2021-03-31T19:42:52Z","_id":"21587","project":[{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"department":[{"_id":"61"},{"_id":"230"},{"_id":"429"},{"_id":"27"},{"_id":"518"}],"user_id":"15278"},{"language":[{"iso":"eng"}],"department":[{"_id":"27"},{"_id":"518"},{"_id":"304"}],"user_id":"15278","_id":"29936","status":"public","publication":"Applied Reconfigurable Computing. Architectures, Tools, and Applications","type":"book_chapter","conference":{"name":"Int. Conf. on Applied Reconfigurable Computing. Architectures, Tools, and Applications"},"doi":"10.1007/978-3-030-79025-7_21","title":"Evaluating the Design Space for Offloading 3D FFT Calculations to an FPGA for High-Performance Computing","author":[{"full_name":"Ramaswami, Arjun","id":"49171","last_name":"Ramaswami","orcid":"https://orcid.org/0000-0002-0909-1178","first_name":"Arjun"},{"full_name":"Kenter, Tobias","id":"3145","last_name":"Kenter","first_name":"Tobias"},{"first_name":"Thomas","full_name":"Kühne, Thomas","id":"49079","last_name":"Kühne"},{"orcid":"0000-0001-5728-9982","last_name":"Plessl","full_name":"Plessl, Christian","id":"16153","first_name":"Christian"}],"date_created":"2022-02-21T14:22:01Z","publisher":"Springer International Publishing","date_updated":"2023-09-26T11:40:45Z","citation":{"ama":"Ramaswami A, Kenter T, Kühne T, Plessl C. Evaluating the Design Space for Offloading 3D FFT Calculations to an FPGA for High-Performance Computing. In: <i>Applied Reconfigurable Computing. Architectures, Tools, and Applications</i>. Springer International Publishing; 2021. doi:<a href=\"https://doi.org/10.1007/978-3-030-79025-7_21\">10.1007/978-3-030-79025-7_21</a>","ieee":"A. Ramaswami, T. Kenter, T. Kühne, and C. Plessl, “Evaluating the Design Space for Offloading 3D FFT Calculations to an FPGA for High-Performance Computing,” in <i>Applied Reconfigurable Computing. Architectures, Tools, and Applications</i>, Cham: Springer International Publishing, 2021.","chicago":"Ramaswami, Arjun, Tobias Kenter, Thomas Kühne, and Christian Plessl. “Evaluating the Design Space for Offloading 3D FFT Calculations to an FPGA for High-Performance Computing.” In <i>Applied Reconfigurable Computing. Architectures, Tools, and Applications</i>. Cham: Springer International Publishing, 2021. <a href=\"https://doi.org/10.1007/978-3-030-79025-7_21\">https://doi.org/10.1007/978-3-030-79025-7_21</a>.","apa":"Ramaswami, A., Kenter, T., Kühne, T., &#38; Plessl, C. (2021). Evaluating the Design Space for Offloading 3D FFT Calculations to an FPGA for High-Performance Computing. In <i>Applied Reconfigurable Computing. Architectures, Tools, and Applications</i>. Int. Conf. on Applied Reconfigurable Computing. Architectures, Tools, and Applications. Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-030-79025-7_21\">https://doi.org/10.1007/978-3-030-79025-7_21</a>","bibtex":"@inbook{Ramaswami_Kenter_Kühne_Plessl_2021, place={Cham}, title={Evaluating the Design Space for Offloading 3D FFT Calculations to an FPGA for High-Performance Computing}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-79025-7_21\">10.1007/978-3-030-79025-7_21</a>}, booktitle={Applied Reconfigurable Computing. Architectures, Tools, and Applications}, publisher={Springer International Publishing}, author={Ramaswami, Arjun and Kenter, Tobias and Kühne, Thomas and Plessl, Christian}, year={2021} }","mla":"Ramaswami, Arjun, et al. “Evaluating the Design Space for Offloading 3D FFT Calculations to an FPGA for High-Performance Computing.” <i>Applied Reconfigurable Computing. Architectures, Tools, and Applications</i>, Springer International Publishing, 2021, doi:<a href=\"https://doi.org/10.1007/978-3-030-79025-7_21\">10.1007/978-3-030-79025-7_21</a>.","short":"A. Ramaswami, T. Kenter, T. Kühne, C. Plessl, in: Applied Reconfigurable Computing. Architectures, Tools, and Applications, Springer International Publishing, Cham, 2021."},"year":"2021","place":"Cham","quality_controlled":"1","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783030790240","9783030790257"]},"publication_status":"published"},{"publication":"Concurrency and Computation: Practice and Experience","file":[{"file_size":2300152,"access_level":"open_access","file_id":"24789","file_name":"2021-09 Alhaddad - Concurrency... - The HighPerMeshes framework for numerical algorithms on unstructured grids.pdf","date_updated":"2021-09-22T06:19:29Z","creator":"fossie","date_created":"2021-09-22T06:19:29Z","relation":"main_file","content_type":"application/pdf"}],"language":[{"iso":"eng"}],"ddc":["004"],"keyword":["tet_topic_hpc"],"quality_controlled":"1","year":"2021","date_created":"2021-09-22T06:15:50Z","title":"The HighPerMeshes framework for numerical algorithms on unstructured grids","type":"journal_article","status":"public","user_id":"15278","department":[{"_id":"61"},{"_id":"230"},{"_id":"27"},{"_id":"518"}],"project":[{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"},{"_id":"33","name":"HighPerMeshes","grant_number":"01|H16005A"}],"_id":"24788","file_date_updated":"2021-09-22T06:19:29Z","publication_status":"published","publication_identifier":{"issn":["1532-0626","1532-0634"]},"has_accepted_license":"1","citation":{"ama":"Alhaddad S, Förstner J, Groth S, et al. The HighPerMeshes framework for numerical algorithms on unstructured grids. <i>Concurrency and Computation: Practice and Experience</i>. Published online 2021:e6616. doi:<a href=\"https://doi.org/10.1002/cpe.6616\">10.1002/cpe.6616</a>","ieee":"S. Alhaddad <i>et al.</i>, “The HighPerMeshes framework for numerical algorithms on unstructured grids,” <i>Concurrency and Computation: Practice and Experience</i>, p. e6616, 2021, doi: <a href=\"https://doi.org/10.1002/cpe.6616\">10.1002/cpe.6616</a>.","chicago":"Alhaddad, Samer, Jens Förstner, Stefan Groth, Daniel Grünewald, Yevgen Grynko, Frank Hannig, Tobias Kenter, et al. “The HighPerMeshes Framework for Numerical Algorithms on Unstructured Grids.” <i>Concurrency and Computation: Practice and Experience</i>, 2021, e6616. <a href=\"https://doi.org/10.1002/cpe.6616\">https://doi.org/10.1002/cpe.6616</a>.","bibtex":"@article{Alhaddad_Förstner_Groth_Grünewald_Grynko_Hannig_Kenter_Pfreundt_Plessl_Schotte_et al._2021, title={The HighPerMeshes framework for numerical algorithms on unstructured grids}, DOI={<a href=\"https://doi.org/10.1002/cpe.6616\">10.1002/cpe.6616</a>}, journal={Concurrency and Computation: Practice and Experience}, author={Alhaddad, Samer and Förstner, Jens and Groth, Stefan and Grünewald, Daniel and Grynko, Yevgen and Hannig, Frank and Kenter, Tobias and Pfreundt, Franz‐Josef and Plessl, Christian and Schotte, Merlind and et al.}, year={2021}, pages={e6616} }","mla":"Alhaddad, Samer, et al. “The HighPerMeshes Framework for Numerical Algorithms on Unstructured Grids.” <i>Concurrency and Computation: Practice and Experience</i>, 2021, p. e6616, doi:<a href=\"https://doi.org/10.1002/cpe.6616\">10.1002/cpe.6616</a>.","short":"S. Alhaddad, J. Förstner, S. Groth, D. Grünewald, Y. Grynko, F. Hannig, T. Kenter, F. Pfreundt, C. Plessl, M. Schotte, T. Steinke, J. Teich, M. Weiser, F. Wende, Concurrency and Computation: Practice and Experience (2021) e6616.","apa":"Alhaddad, S., Förstner, J., Groth, S., Grünewald, D., Grynko, Y., Hannig, F., Kenter, T., Pfreundt, F., Plessl, C., Schotte, M., Steinke, T., Teich, J., Weiser, M., &#38; Wende, F. (2021). The HighPerMeshes framework for numerical algorithms on unstructured grids. <i>Concurrency and Computation: Practice and Experience</i>, e6616. <a href=\"https://doi.org/10.1002/cpe.6616\">https://doi.org/10.1002/cpe.6616</a>"},"page":"e6616","author":[{"first_name":"Samer","id":"42456","full_name":"Alhaddad, Samer","last_name":"Alhaddad"},{"id":"158","full_name":"Förstner, Jens","orcid":"0000-0001-7059-9862","last_name":"Förstner","first_name":"Jens"},{"first_name":"Stefan","last_name":"Groth","full_name":"Groth, Stefan"},{"last_name":"Grünewald","full_name":"Grünewald, Daniel","first_name":"Daniel"},{"last_name":"Grynko","id":"26059","full_name":"Grynko, Yevgen","first_name":"Yevgen"},{"first_name":"Frank","full_name":"Hannig, Frank","last_name":"Hannig"},{"full_name":"Kenter, Tobias","id":"3145","last_name":"Kenter","first_name":"Tobias"},{"first_name":"Franz‐Josef","full_name":"Pfreundt, Franz‐Josef","last_name":"Pfreundt"},{"last_name":"Plessl","orcid":"0000-0001-5728-9982","full_name":"Plessl, Christian","id":"16153","first_name":"Christian"},{"first_name":"Merlind","last_name":"Schotte","full_name":"Schotte, Merlind"},{"first_name":"Thomas","last_name":"Steinke","full_name":"Steinke, Thomas"},{"first_name":"Jürgen","last_name":"Teich","full_name":"Teich, Jürgen"},{"full_name":"Weiser, Martin","last_name":"Weiser","first_name":"Martin"},{"last_name":"Wende","full_name":"Wende, Florian","first_name":"Florian"}],"date_updated":"2023-09-26T11:42:19Z","oa":"1","doi":"10.1002/cpe.6616"},{"status":"public","type":"journal_article","file_date_updated":"2020-05-25T15:21:56Z","article_number":"194103","department":[{"_id":"27"},{"_id":"518"},{"_id":"304"}],"user_id":"75963","_id":"16277","project":[{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"},{"_id":"32","name":"Performance and Efficiency in HPC with Custom Computing","grant_number":"PL 595/2-1 / 320898746"},{"name":"PC2: Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"intvolume":"       152","citation":{"short":"T. Kühne, M. Iannuzzi, M.D. Ben, V.V. Rybkin, P. Seewald, F. Stein, T. Laino, R.Z. Khaliullin, O. Schütt, F. Schiffmann, D. Golze, J. Wilhelm, S. Chulkov, M.H.B.-H. Mohammad Hossein Bani-Hashemian, V. Weber, U. Borstnik, M. Taillefumier, A.S. Jakobovits, A. Lazzaro, H. Pabst, T. Müller, R. Schade, M. Guidon, S. Andermatt, N. Holmberg, G.K. Schenter, A. Hehn, A. Bussy, F. Belleflamme, G. Tabacchi, A. Glöß, M. Lass, I. Bethune, C.J. Mundy, C. Plessl, M. Watkins, J. VandeVondele, M. Krack, J. Hutter, The Journal of Chemical Physics 152 (2020).","mla":"Kühne, Thomas, et al. “CP2K: An Electronic Structure and Molecular Dynamics Software Package - Quickstep: Efficient and Accurate Electronic Structure Calculations.” <i>The Journal of Chemical Physics</i>, vol. 152, no. 19, 194103, 2020, doi:<a href=\"https://doi.org/10.1063/5.0007045\">10.1063/5.0007045</a>.","bibtex":"@article{Kühne_Iannuzzi_Ben_Rybkin_Seewald_Stein_Laino_Khaliullin_Schütt_Schiffmann_et al._2020, title={CP2K: An electronic structure and molecular dynamics software package - Quickstep: Efficient and accurate electronic structure calculations}, volume={152}, DOI={<a href=\"https://doi.org/10.1063/5.0007045\">10.1063/5.0007045</a>}, number={19194103}, journal={The Journal of Chemical Physics}, author={Kühne, Thomas and Iannuzzi, Marcella and Ben, Mauro Del and Rybkin, Vladimir V. and Seewald, Patrick and Stein, Frederick and Laino, Teodoro and Khaliullin, Rustam Z. and Schütt, Ole and Schiffmann, Florian and et al.}, year={2020} }","apa":"Kühne, T., Iannuzzi, M., Ben, M. D., Rybkin, V. V., Seewald, P., Stein, F., Laino, T., Khaliullin, R. Z., Schütt, O., Schiffmann, F., Golze, D., Wilhelm, J., Chulkov, S., Mohammad Hossein Bani-Hashemian, M. H. B.-H., Weber, V., Borstnik, U., Taillefumier, M., Jakobovits, A. S., Lazzaro, A., … Hutter, J. (2020). CP2K: An electronic structure and molecular dynamics software package - Quickstep: Efficient and accurate electronic structure calculations. <i>The Journal of Chemical Physics</i>, <i>152</i>(19), Article 194103. <a href=\"https://doi.org/10.1063/5.0007045\">https://doi.org/10.1063/5.0007045</a>","ama":"Kühne T, Iannuzzi M, Ben MD, et al. CP2K: An electronic structure and molecular dynamics software package - Quickstep: Efficient and accurate electronic structure calculations. <i>The Journal of Chemical Physics</i>. 2020;152(19). doi:<a href=\"https://doi.org/10.1063/5.0007045\">10.1063/5.0007045</a>","chicago":"Kühne, Thomas, Marcella Iannuzzi, Mauro Del Ben, Vladimir V. Rybkin, Patrick Seewald, Frederick Stein, Teodoro Laino, et al. “CP2K: An Electronic Structure and Molecular Dynamics Software Package - Quickstep: Efficient and Accurate Electronic Structure Calculations.” <i>The Journal of Chemical Physics</i> 152, no. 19 (2020). <a href=\"https://doi.org/10.1063/5.0007045\">https://doi.org/10.1063/5.0007045</a>.","ieee":"T. Kühne <i>et al.</i>, “CP2K: An electronic structure and molecular dynamics software package - Quickstep: Efficient and accurate electronic structure calculations,” <i>The Journal of Chemical Physics</i>, vol. 152, no. 19, Art. no. 194103, 2020, doi: <a href=\"https://doi.org/10.1063/5.0007045\">10.1063/5.0007045</a>."},"has_accepted_license":"1","publication_status":"published","doi":"10.1063/5.0007045","main_file_link":[{"url":"https://aip.scitation.org/doi/pdf/10.1063/5.0007045?download=true","open_access":"1"}],"volume":152,"author":[{"last_name":"Kühne","id":"49079","full_name":"Kühne, Thomas","first_name":"Thomas"},{"full_name":"Iannuzzi, Marcella","last_name":"Iannuzzi","first_name":"Marcella"},{"last_name":"Ben","full_name":"Ben, Mauro Del","first_name":"Mauro Del"},{"first_name":"Vladimir V.","full_name":"Rybkin, Vladimir V.","last_name":"Rybkin"},{"last_name":"Seewald","full_name":"Seewald, Patrick","first_name":"Patrick"},{"last_name":"Stein","full_name":"Stein, Frederick","first_name":"Frederick"},{"last_name":"Laino","full_name":"Laino, Teodoro","first_name":"Teodoro"},{"full_name":"Khaliullin, Rustam Z.","last_name":"Khaliullin","first_name":"Rustam Z."},{"first_name":"Ole","last_name":"Schütt","full_name":"Schütt, Ole"},{"first_name":"Florian","full_name":"Schiffmann, Florian","last_name":"Schiffmann"},{"full_name":"Golze, Dorothea","last_name":"Golze","first_name":"Dorothea"},{"first_name":"Jan","last_name":"Wilhelm","full_name":"Wilhelm, Jan"},{"last_name":"Chulkov","full_name":"Chulkov, Sergey","first_name":"Sergey"},{"first_name":"Mohammad Hossein Bani-Hashemian","full_name":"Mohammad Hossein Bani-Hashemian, Mohammad Hossein Bani-Hashemian","last_name":"Mohammad Hossein Bani-Hashemian"},{"first_name":"Valéry","last_name":"Weber","full_name":"Weber, Valéry"},{"first_name":"Urban","last_name":"Borstnik","full_name":"Borstnik, Urban"},{"first_name":"Mathieu","full_name":"Taillefumier, Mathieu","last_name":"Taillefumier"},{"full_name":"Jakobovits, Alice Shoshana","last_name":"Jakobovits","first_name":"Alice Shoshana"},{"last_name":"Lazzaro","full_name":"Lazzaro, Alfio","first_name":"Alfio"},{"first_name":"Hans","last_name":"Pabst","full_name":"Pabst, Hans"},{"first_name":"Tiziano","last_name":"Müller","full_name":"Müller, Tiziano"},{"first_name":"Robert","full_name":"Schade, Robert","id":"75963","orcid":"0000-0002-6268-539","last_name":"Schade"},{"first_name":"Manuel","last_name":"Guidon","full_name":"Guidon, Manuel"},{"first_name":"Samuel","full_name":"Andermatt, Samuel","last_name":"Andermatt"},{"first_name":"Nico","full_name":"Holmberg, Nico","last_name":"Holmberg"},{"first_name":"Gregory K.","last_name":"Schenter","full_name":"Schenter, Gregory K."},{"first_name":"Anna","last_name":"Hehn","full_name":"Hehn, Anna"},{"last_name":"Bussy","full_name":"Bussy, Augustin","first_name":"Augustin"},{"first_name":"Fabian","full_name":"Belleflamme, Fabian","last_name":"Belleflamme"},{"last_name":"Tabacchi","full_name":"Tabacchi, Gloria","first_name":"Gloria"},{"last_name":"Glöß","full_name":"Glöß, Andreas","first_name":"Andreas"},{"full_name":"Lass, Michael","id":"24135","orcid":"0000-0002-5708-7632","last_name":"Lass","first_name":"Michael"},{"first_name":"Iain","full_name":"Bethune, Iain","last_name":"Bethune"},{"first_name":"Christopher J.","full_name":"Mundy, Christopher J.","last_name":"Mundy"},{"orcid":"0000-0001-5728-9982","last_name":"Plessl","id":"16153","full_name":"Plessl, Christian","first_name":"Christian"},{"last_name":"Watkins","full_name":"Watkins, Matt","first_name":"Matt"},{"first_name":"Joost","full_name":"VandeVondele, Joost","last_name":"VandeVondele"},{"first_name":"Matthias","last_name":"Krack","full_name":"Krack, Matthias"},{"first_name":"Jürg","full_name":"Hutter, Jürg","last_name":"Hutter"}],"date_updated":"2023-08-02T14:56:21Z","oa":"1","file":[{"date_created":"2020-05-25T15:21:56Z","creator":"lass","date_updated":"2020-05-25T15:21:56Z","access_level":"closed","file_name":"5.0007045.pdf","file_id":"17061","file_size":4887650,"content_type":"application/pdf","relation":"main_file","success":1}],"abstract":[{"text":"CP2K is an open source electronic structure and molecular dynamics software package to perform atomistic simulations of solid-state, liquid, molecular, and biological systems. It is especially aimed at massively parallel and linear-scaling electronic structure methods and state-of-theart ab initio molecular dynamics simulations. Excellent performance for electronic structure calculations is achieved using novel algorithms implemented for modern high-performance computing systems. This review revisits the main capabilities of CP2K to perform efficient and accurate electronic structure simulations. The emphasis is put on density functional theory and multiple post–Hartree–Fock methods using the Gaussian and plane wave approach and its augmented all-electron extension.","lang":"eng"}],"publication":"The Journal of Chemical Physics","language":[{"iso":"eng"}],"ddc":["540"],"external_id":{"arxiv":["2003.03868"]},"year":"2020","issue":"19","quality_controlled":"1","title":"CP2K: An electronic structure and molecular dynamics software package - Quickstep: Efficient and accurate electronic structure calculations","date_created":"2020-03-10T15:12:31Z"},{"quality_controlled":"1","year":"2020","publisher":"IEEE Computer Society","date_created":"2020-04-28T14:44:21Z","title":"A Submatrix-Based Method for Approximate Matrix Function Evaluation in the Quantum Chemistry Code CP2K","publication":"Proc. International Conference for High Performance Computing, Networking, Storage and Analysis (SC)","abstract":[{"text":"Electronic structure calculations based on density-functional theory (DFT)\r\nrepresent a significant part of today's HPC workloads and pose high demands on\r\nhigh-performance computing resources. To perform these quantum-mechanical DFT\r\ncalculations on complex large-scale systems, so-called linear scaling methods\r\ninstead of conventional cubic scaling methods are required. In this work, we\r\ntake up the idea of the submatrix method and apply it to the DFT computations\r\nin the software package CP2K. For that purpose, we transform the underlying\r\nnumeric operations on distributed, large, sparse matrices into computations on\r\nlocal, much smaller and nearly dense matrices. This allows us to exploit the\r\nfull floating-point performance of modern CPUs and to make use of dedicated\r\naccelerator hardware, where performance has been limited by memory bandwidth\r\nbefore. We demonstrate both functionality and performance of our implementation\r\nand show how it can be accelerated with GPUs and FPGAs.","lang":"eng"}],"external_id":{"arxiv":["2004.10811"]},"language":[{"iso":"eng"}],"place":"Los Alamitos, CA, USA","page":"1127-1140","citation":{"ieee":"M. Lass, R. Schade, T. Kühne, and C. Plessl, “A Submatrix-Based Method for Approximate Matrix Function Evaluation in the Quantum Chemistry Code CP2K,” in <i>Proc. International Conference for High Performance Computing, Networking, Storage and Analysis (SC)</i>, Atlanta, GA, US, 2020, pp. 1127–1140, doi: <a href=\"https://doi.org/10.1109/SC41405.2020.00084\">10.1109/SC41405.2020.00084</a>.","chicago":"Lass, Michael, Robert Schade, Thomas Kühne, and Christian Plessl. “A Submatrix-Based Method for Approximate Matrix Function Evaluation in the Quantum Chemistry Code CP2K.” In <i>Proc. International Conference for High Performance Computing, Networking, Storage and Analysis (SC)</i>, 1127–40. Los Alamitos, CA, USA: IEEE Computer Society, 2020. <a href=\"https://doi.org/10.1109/SC41405.2020.00084\">https://doi.org/10.1109/SC41405.2020.00084</a>.","ama":"Lass M, Schade R, Kühne T, Plessl C. A Submatrix-Based Method for Approximate Matrix Function Evaluation in the Quantum Chemistry Code CP2K. In: <i>Proc. International Conference for High Performance Computing, Networking, Storage and Analysis (SC)</i>. IEEE Computer Society; 2020:1127-1140. doi:<a href=\"https://doi.org/10.1109/SC41405.2020.00084\">10.1109/SC41405.2020.00084</a>","bibtex":"@inproceedings{Lass_Schade_Kühne_Plessl_2020, place={Los Alamitos, CA, USA}, title={A Submatrix-Based Method for Approximate Matrix Function Evaluation in the Quantum Chemistry Code CP2K}, DOI={<a href=\"https://doi.org/10.1109/SC41405.2020.00084\">10.1109/SC41405.2020.00084</a>}, booktitle={Proc. International Conference for High Performance Computing, Networking, Storage and Analysis (SC)}, publisher={IEEE Computer Society}, author={Lass, Michael and Schade, Robert and Kühne, Thomas and Plessl, Christian}, year={2020}, pages={1127–1140} }","short":"M. Lass, R. Schade, T. Kühne, C. Plessl, in: Proc. International Conference for High Performance Computing, Networking, Storage and Analysis (SC), IEEE Computer Society, Los Alamitos, CA, USA, 2020, pp. 1127–1140.","mla":"Lass, Michael, et al. “A Submatrix-Based Method for Approximate Matrix Function Evaluation in the Quantum Chemistry Code CP2K.” <i>Proc. International Conference for High Performance Computing, Networking, Storage and Analysis (SC)</i>, IEEE Computer Society, 2020, pp. 1127–40, doi:<a href=\"https://doi.org/10.1109/SC41405.2020.00084\">10.1109/SC41405.2020.00084</a>.","apa":"Lass, M., Schade, R., Kühne, T., &#38; Plessl, C. (2020). A Submatrix-Based Method for Approximate Matrix Function Evaluation in the Quantum Chemistry Code CP2K. <i>Proc. International Conference for High Performance Computing, Networking, Storage and Analysis (SC)</i>, 1127–1140. <a href=\"https://doi.org/10.1109/SC41405.2020.00084\">https://doi.org/10.1109/SC41405.2020.00084</a>"},"date_updated":"2023-08-02T14:55:59Z","author":[{"full_name":"Lass, Michael","id":"24135","last_name":"Lass","orcid":"0000-0002-5708-7632","first_name":"Michael"},{"first_name":"Robert","id":"75963","full_name":"Schade, Robert","last_name":"Schade","orcid":"0000-0002-6268-539"},{"id":"49079","full_name":"Kühne, Thomas","last_name":"Kühne","first_name":"Thomas"},{"first_name":"Christian","orcid":"0000-0001-5728-9982","last_name":"Plessl","full_name":"Plessl, Christian","id":"16153"}],"conference":{"location":"Atlanta, GA, US","name":"SC20: International Conference for High Performance Computing, Networking, Storage and Analysis (SC)"},"doi":"10.1109/SC41405.2020.00084","main_file_link":[{"url":"https://ieeexplore.ieee.org/document/9355245"}],"type":"conference","status":"public","_id":"16898","project":[{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"},{"name":"Performance and Efficiency in HPC with Custom Computing","_id":"32","grant_number":"PL 595/2-1 / 320898746"},{"name":"PC2: Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"department":[{"_id":"27"},{"_id":"518"},{"_id":"304"}],"user_id":"75963"},{"year":"2020","quality_controlled":"1","title":"Evaluating FPGA Accelerator Performance with a Parameterized OpenCL Adaptation of Selected Benchmarks of the HPCChallenge Benchmark Suite","date_created":"2021-04-16T10:17:22Z","abstract":[{"lang":"eng","text":"FPGAs have found increasing adoption in data center applications since a new generation of high-level tools have become available which noticeably reduce development time for FPGA accelerators and still provide high-quality results. There is, however, no high-level benchmark suite available, which specifically enables a comparison of FPGA architectures, programming tools, and libraries for HPC applications. To fill this gap, we have developed an OpenCL-based open-source implementation of the HPCC benchmark suite for Xilinx and Intel FPGAs. This benchmark can serve to analyze the current capabilities of FPGA devices, cards, and development tool flows, track progress over time, and point out specific difficulties for FPGA acceleration in the HPC domain. Additionally, the benchmark documents proven performance optimization patterns. We will continue optimizing and porting the benchmark for new generations of FPGAs and design tools and encourage active participation to create a valuable tool for the community. To fill this gap, we have developed an OpenCL-based open-source implementation of the HPCC benchmark suite for Xilinx and Intel FPGAs. This benchmark can serve to analyze the current capabilities of FPGA devices, cards, and development tool flows, track progress over time, and point out specific difficulties for FPGA acceleration in the HPC domain. Additionally, the benchmark documents proven performance optimization patterns. We will continue optimizing and porting the benchmark for new generations of FPGAs and design tools and encourage active participation to create a valuable tool for the community."}],"publication":"2020 IEEE/ACM International Workshop on Heterogeneous High-performance Reconfigurable Computing (H2RC)","language":[{"iso":"eng"}],"keyword":["FPGA","OpenCL","High Level Synthesis","HPC benchmarking"],"citation":{"short":"M. Meyer, T. Kenter, C. Plessl, in: 2020 IEEE/ACM International Workshop on Heterogeneous High-Performance Reconfigurable Computing (H2RC), 2020.","bibtex":"@inproceedings{Meyer_Kenter_Plessl_2020, title={Evaluating FPGA Accelerator Performance with a Parameterized OpenCL Adaptation of Selected Benchmarks of the HPCChallenge Benchmark Suite}, DOI={<a href=\"https://doi.org/10.1109/h2rc51942.2020.00007\">10.1109/h2rc51942.2020.00007</a>}, booktitle={2020 IEEE/ACM International Workshop on Heterogeneous High-performance Reconfigurable Computing (H2RC)}, author={Meyer, Marius and Kenter, Tobias and Plessl, Christian}, year={2020} }","mla":"Meyer, Marius, et al. “Evaluating FPGA Accelerator Performance with a Parameterized OpenCL Adaptation of Selected Benchmarks of the HPCChallenge Benchmark Suite.” <i>2020 IEEE/ACM International Workshop on Heterogeneous High-Performance Reconfigurable Computing (H2RC)</i>, 2020, doi:<a href=\"https://doi.org/10.1109/h2rc51942.2020.00007\">10.1109/h2rc51942.2020.00007</a>.","apa":"Meyer, M., Kenter, T., &#38; Plessl, C. (2020). Evaluating FPGA Accelerator Performance with a Parameterized OpenCL Adaptation of Selected Benchmarks of the HPCChallenge Benchmark Suite. <i>2020 IEEE/ACM International Workshop on Heterogeneous High-Performance Reconfigurable Computing (H2RC)</i>. <a href=\"https://doi.org/10.1109/h2rc51942.2020.00007\">https://doi.org/10.1109/h2rc51942.2020.00007</a>","chicago":"Meyer, Marius, Tobias Kenter, and Christian Plessl. “Evaluating FPGA Accelerator Performance with a Parameterized OpenCL Adaptation of Selected Benchmarks of the HPCChallenge Benchmark Suite.” In <i>2020 IEEE/ACM International Workshop on Heterogeneous High-Performance Reconfigurable Computing (H2RC)</i>, 2020. <a href=\"https://doi.org/10.1109/h2rc51942.2020.00007\">https://doi.org/10.1109/h2rc51942.2020.00007</a>.","ieee":"M. Meyer, T. Kenter, and C. Plessl, “Evaluating FPGA Accelerator Performance with a Parameterized OpenCL Adaptation of Selected Benchmarks of the HPCChallenge Benchmark Suite,” 2020, doi: <a href=\"https://doi.org/10.1109/h2rc51942.2020.00007\">10.1109/h2rc51942.2020.00007</a>.","ama":"Meyer M, Kenter T, Plessl C. Evaluating FPGA Accelerator Performance with a Parameterized OpenCL Adaptation of Selected Benchmarks of the HPCChallenge Benchmark Suite. In: <i>2020 IEEE/ACM International Workshop on Heterogeneous High-Performance Reconfigurable Computing (H2RC)</i>. ; 2020. doi:<a href=\"https://doi.org/10.1109/h2rc51942.2020.00007\">10.1109/h2rc51942.2020.00007</a>"},"related_material":{"link":[{"url":"https://github.com/pc2/HPCC_FPGA","relation":"supplementary_material","description":"Official repository of the benchmark suite on GitHub"}]},"publication_identifier":{"isbn":["9781665415927"]},"publication_status":"published","doi":"10.1109/h2rc51942.2020.00007","main_file_link":[{"url":"https://ieeexplore.ieee.org/document/9306963"}],"author":[{"first_name":"Marius","id":"40778","full_name":"Meyer, Marius","last_name":"Meyer"},{"first_name":"Tobias","last_name":"Kenter","full_name":"Kenter, Tobias","id":"3145"},{"first_name":"Christian","id":"16153","full_name":"Plessl, Christian","last_name":"Plessl","orcid":"0000-0001-5728-9982"}],"date_updated":"2023-09-26T11:42:53Z","status":"public","type":"conference","department":[{"_id":"27"},{"_id":"518"}],"user_id":"15278","_id":"21632","project":[{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}]},{"article_number":"39","department":[{"_id":"27"},{"_id":"518"},{"_id":"304"}],"user_id":"15278","_id":"12878","project":[{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"},{"_id":"32","name":"Performance and Efficiency in HPC with Custom Computing","grant_number":"PL 595/2-1 / 320898746"}],"status":"public","type":"journal_article","doi":"10.3390/computation8020039","main_file_link":[{"open_access":"1","url":"https://www.mdpi.com/2079-3197/8/2/39/pdf"}],"volume":8,"author":[{"first_name":"Varadarajan","full_name":"Rengaraj, Varadarajan","last_name":"Rengaraj"},{"full_name":"Lass, Michael","id":"24135","orcid":"0000-0002-5708-7632","last_name":"Lass","first_name":"Michael"},{"first_name":"Christian","id":"16153","full_name":"Plessl, Christian","last_name":"Plessl","orcid":"0000-0001-5728-9982"},{"first_name":"Thomas","last_name":"Kühne","id":"49079","full_name":"Kühne, Thomas"}],"date_updated":"2023-09-26T11:43:52Z","oa":"1","intvolume":"         8","citation":{"chicago":"Rengaraj, Varadarajan, Michael Lass, Christian Plessl, and Thomas Kühne. “Accurate Sampling with Noisy Forces from Approximate Computing.” <i>Computation</i> 8, no. 2 (2020). <a href=\"https://doi.org/10.3390/computation8020039\">https://doi.org/10.3390/computation8020039</a>.","ieee":"V. Rengaraj, M. Lass, C. Plessl, and T. Kühne, “Accurate Sampling with Noisy Forces from Approximate Computing,” <i>Computation</i>, vol. 8, no. 2, Art. no. 39, 2020, doi: <a href=\"https://doi.org/10.3390/computation8020039\">10.3390/computation8020039</a>.","ama":"Rengaraj V, Lass M, Plessl C, Kühne T. Accurate Sampling with Noisy Forces from Approximate Computing. <i>Computation</i>. 2020;8(2). doi:<a href=\"https://doi.org/10.3390/computation8020039\">10.3390/computation8020039</a>","bibtex":"@article{Rengaraj_Lass_Plessl_Kühne_2020, title={Accurate Sampling with Noisy Forces from Approximate Computing}, volume={8}, DOI={<a href=\"https://doi.org/10.3390/computation8020039\">10.3390/computation8020039</a>}, number={239}, journal={Computation}, publisher={MDPI}, author={Rengaraj, Varadarajan and Lass, Michael and Plessl, Christian and Kühne, Thomas}, year={2020} }","mla":"Rengaraj, Varadarajan, et al. “Accurate Sampling with Noisy Forces from Approximate Computing.” <i>Computation</i>, vol. 8, no. 2, 39, MDPI, 2020, doi:<a href=\"https://doi.org/10.3390/computation8020039\">10.3390/computation8020039</a>.","short":"V. Rengaraj, M. Lass, C. Plessl, T. Kühne, Computation 8 (2020).","apa":"Rengaraj, V., Lass, M., Plessl, C., &#38; Kühne, T. (2020). Accurate Sampling with Noisy Forces from Approximate Computing. <i>Computation</i>, <i>8</i>(2), Article 39. <a href=\"https://doi.org/10.3390/computation8020039\">https://doi.org/10.3390/computation8020039</a>"},"language":[{"iso":"eng"}],"external_id":{"arxiv":["1907.08497"]},"abstract":[{"lang":"eng","text":"In scientific computing, the acceleration of atomistic computer simulations by means of custom hardware is finding ever-growing application. A major limitation, however, is that the high efficiency in terms of performance and low power consumption entails the massive usage of low precision computing units. Here, based on the approximate computing paradigm, we present an algorithmic method to compensate for numerical inaccuracies due to low accuracy arithmetic operations rigorously, yet still obtaining exact expectation values using a properly modified Langevin-type equation."}],"publication":"Computation","title":"Accurate Sampling with Noisy Forces from Approximate Computing","date_created":"2019-07-23T12:03:07Z","publisher":"MDPI","year":"2020","issue":"2","quality_controlled":"1"},{"date_updated":"2022-01-06T07:03:44Z","author":[{"first_name":"Heinrich","id":"8961","full_name":"Riebler, Heinrich","last_name":"Riebler"},{"last_name":"Vaz","id":"30332","full_name":"Vaz, Gavin Francis","first_name":"Gavin Francis"},{"first_name":"Tobias","id":"3145","full_name":"Kenter, Tobias","last_name":"Kenter"},{"id":"16153","full_name":"Plessl, Christian","orcid":"0000-0001-5728-9982","last_name":"Plessl","first_name":"Christian"}],"volume":16,"doi":"10.1145/3319423","publication_status":"published","has_accepted_license":"1","citation":{"ieee":"H. Riebler, G. F. Vaz, T. Kenter, and C. Plessl, “Transparent Acceleration for Heterogeneous Platforms with Compilation to OpenCL,” <i>ACM Trans. Archit. Code Optim. (TACO)</i>, vol. 16, no. 2, pp. 14:1–14:26, 2019.","chicago":"Riebler, Heinrich, Gavin Francis Vaz, Tobias Kenter, and Christian Plessl. “Transparent Acceleration for Heterogeneous Platforms with Compilation to OpenCL.” <i>ACM Trans. Archit. Code Optim. (TACO)</i> 16, no. 2 (2019): 14:1–14:26. <a href=\"https://doi.org/10.1145/3319423\">https://doi.org/10.1145/3319423</a>.","ama":"Riebler H, Vaz GF, Kenter T, Plessl C. Transparent Acceleration for Heterogeneous Platforms with Compilation to OpenCL. <i>ACM Trans Archit Code Optim (TACO)</i>. 2019;16(2):14:1–14:26. doi:<a href=\"https://doi.org/10.1145/3319423\">10.1145/3319423</a>","apa":"Riebler, H., Vaz, G. F., Kenter, T., &#38; Plessl, C. (2019). Transparent Acceleration for Heterogeneous Platforms with Compilation to OpenCL. <i>ACM Trans. Archit. Code Optim. (TACO)</i>, <i>16</i>(2), 14:1–14:26. <a href=\"https://doi.org/10.1145/3319423\">https://doi.org/10.1145/3319423</a>","bibtex":"@article{Riebler_Vaz_Kenter_Plessl_2019, title={Transparent Acceleration for Heterogeneous Platforms with Compilation to OpenCL}, volume={16}, DOI={<a href=\"https://doi.org/10.1145/3319423\">10.1145/3319423</a>}, number={2}, journal={ACM Trans. Archit. Code Optim. (TACO)}, publisher={ACM}, author={Riebler, Heinrich and Vaz, Gavin Francis and Kenter, Tobias and Plessl, Christian}, year={2019}, pages={14:1–14:26} }","short":"H. Riebler, G.F. Vaz, T. Kenter, C. Plessl, ACM Trans. Archit. Code Optim. (TACO) 16 (2019) 14:1–14:26.","mla":"Riebler, Heinrich, et al. “Transparent Acceleration for Heterogeneous Platforms with Compilation to OpenCL.” <i>ACM Trans. Archit. Code Optim. (TACO)</i>, vol. 16, no. 2, ACM, 2019, pp. 14:1–14:26, doi:<a href=\"https://doi.org/10.1145/3319423\">10.1145/3319423</a>."},"page":"14:1–14:26","intvolume":"        16","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"14","name":"SFB 901 - Subproject C2"}],"_id":"7689","user_id":"16153","department":[{"_id":"27"},{"_id":"518"}],"article_type":"original","file_date_updated":"2019-02-13T14:59:07Z","type":"journal_article","status":"public","publisher":"ACM","date_created":"2019-02-13T15:01:43Z","title":"Transparent Acceleration for Heterogeneous Platforms with Compilation to OpenCL","quality_controlled":"1","issue":"2","year":"2019","ddc":["000"],"keyword":["htrop"],"language":[{"iso":"eng"}],"publication":"ACM Trans. Archit. Code Optim. (TACO)","file":[{"relation":"main_file","content_type":"application/pdf","file_name":"htrop19_taco.pdf","file_id":"7695","access_level":"closed","file_size":872822,"date_created":"2019-02-13T14:59:07Z","creator":"deffel","date_updated":"2019-02-13T14:59:07Z"}]},{"year":"2019","citation":{"short":"P. Gorlani, T. Kenter, C. Plessl, in: Proceedings of the International Conference on Field-Programmable Technology (FPT), IEEE, 2019.","bibtex":"@inproceedings{Gorlani_Kenter_Plessl_2019, title={OpenCL Implementation of Cannon’s Matrix Multiplication Algorithm on Intel Stratix 10 FPGAs}, DOI={<a href=\"https://doi.org/10.1109/ICFPT47387.2019.00020\">10.1109/ICFPT47387.2019.00020</a>}, booktitle={Proceedings of the International Conference on Field-Programmable Technology (FPT)}, publisher={IEEE}, author={Gorlani, Paolo and Kenter, Tobias and Plessl, Christian}, year={2019} }","mla":"Gorlani, Paolo, et al. “OpenCL Implementation of Cannon’s Matrix Multiplication Algorithm on Intel Stratix 10 FPGAs.” <i>Proceedings of the International Conference on Field-Programmable Technology (FPT)</i>, IEEE, 2019, doi:<a href=\"https://doi.org/10.1109/ICFPT47387.2019.00020\">10.1109/ICFPT47387.2019.00020</a>.","apa":"Gorlani, P., Kenter, T., &#38; Plessl, C. (2019). OpenCL Implementation of Cannon’s Matrix Multiplication Algorithm on Intel Stratix 10 FPGAs. In <i>Proceedings of the International Conference on Field-Programmable Technology (FPT)</i>. IEEE. <a href=\"https://doi.org/10.1109/ICFPT47387.2019.00020\">https://doi.org/10.1109/ICFPT47387.2019.00020</a>","chicago":"Gorlani, Paolo, Tobias Kenter, and Christian Plessl. “OpenCL Implementation of Cannon’s Matrix Multiplication Algorithm on Intel Stratix 10 FPGAs.” In <i>Proceedings of the International Conference on Field-Programmable Technology (FPT)</i>. IEEE, 2019. <a href=\"https://doi.org/10.1109/ICFPT47387.2019.00020\">https://doi.org/10.1109/ICFPT47387.2019.00020</a>.","ieee":"P. Gorlani, T. Kenter, and C. Plessl, “OpenCL Implementation of Cannon’s Matrix Multiplication Algorithm on Intel Stratix 10 FPGAs,” in <i>Proceedings of the International Conference on Field-Programmable Technology (FPT)</i>, 2019.","ama":"Gorlani P, Kenter T, Plessl C. OpenCL Implementation of Cannon’s Matrix Multiplication Algorithm on Intel Stratix 10 FPGAs. In: <i>Proceedings of the International Conference on Field-Programmable Technology (FPT)</i>. IEEE; 2019. doi:<a href=\"https://doi.org/10.1109/ICFPT47387.2019.00020\">10.1109/ICFPT47387.2019.00020</a>"},"has_accepted_license":"1","quality_controlled":"1","title":"OpenCL Implementation of Cannon's Matrix Multiplication Algorithm on Intel Stratix 10 FPGAs","conference":{"name":"International Conference on Field-Programmable Technology (FPT)"},"doi":"10.1109/ICFPT47387.2019.00020","date_updated":"2022-01-06T06:52:26Z","publisher":"IEEE","date_created":"2020-01-09T12:54:48Z","author":[{"first_name":"Paolo","id":"72045","full_name":"Gorlani, Paolo","last_name":"Gorlani"},{"first_name":"Tobias","last_name":"Kenter","full_name":"Kenter, Tobias","id":"3145"},{"first_name":"Christian","orcid":"0000-0001-5728-9982","last_name":"Plessl","full_name":"Plessl, Christian","id":"16153"}],"abstract":[{"text":"Stratix 10 FPGA cards have a good potential for the acceleration of HPC workloads since the Stratix 10 product line introduces devices with a large number of DSP and memory blocks. The high level synthesis of OpenCL codes can play a fundamental role for FPGAs in HPC, because it allows to implement different designs with lower development effort compared to hand optimized HDL. However, Stratix 10 cards are still hard to fully exploit using the Intel FPGA SDK for OpenCL. The implementation of designs with thousands of concurrent arithmetic operations often suffers from place and route problems that limit the maximum frequency or entirely prevent a successful synthesis. In order to overcome these issues for the implementation of the matrix multiplication, we formulate Cannon's matrix multiplication algorithm with regard to its efficient synthesis within the FPGA logic. We obtain a two-level block algorithm, where the lower level sub-matrices are multiplied using our Cannon's algorithm implementation. Following this design approach with multiple compute units, we are able to get maximum frequencies close to and above 300 MHz with high utilization of DSP and memory blocks. This allows for performance results above 1 TeraFLOPS.","lang":"eng"}],"status":"public","file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2020-01-09T12:53:57Z","creator":"plessl","date_created":"2020-01-09T12:53:57Z","file_size":250559,"file_id":"15479","access_level":"closed","file_name":"gorlani19_fpt.pdf"}],"publication":"Proceedings of the International Conference on Field-Programmable Technology (FPT)","type":"conference","ddc":["004"],"file_date_updated":"2020-01-09T12:53:57Z","language":[{"iso":"eng"}],"_id":"15478","project":[{"_id":"33","name":"HighPerMeshes","grant_number":"01|H16005"},{"name":"Performance and Efficiency in HPC with Custom Computing","_id":"32","grant_number":"PL 595/2-1"}],"department":[{"_id":"27"},{"_id":"518"}],"user_id":"3145"},{"external_id":{"arxiv":["1703.02456"]},"language":[{"iso":"eng"}],"publication":"Communications in Computational Physics","abstract":[{"lang":"eng","text":"We address the general mathematical problem of computing the inverse p-th\r\nroot of a given matrix in an efficient way. A new method to construct iteration\r\nfunctions that allow calculating arbitrary p-th roots and their inverses of\r\nsymmetric positive definite matrices is presented. We show that the order of\r\nconvergence is at least quadratic and that adaptively adjusting a parameter q\r\nalways leads to an even faster convergence. In this way, a better performance\r\nthan with previously known iteration schemes is achieved. The efficiency of the\r\niterative functions is demonstrated for various matrices with different\r\ndensities, condition numbers and spectral radii."}],"date_created":"2017-07-25T14:48:26Z","publisher":"Global Science Press","title":"A General Algorithm to Calculate the Inverse Principal p-th Root of Symmetric Positive Definite Matrices","issue":"2","quality_controlled":"1","year":"2019","department":[{"_id":"27"},{"_id":"518"},{"_id":"304"},{"_id":"104"}],"user_id":"15278","_id":"21","project":[{"grant_number":"PL 595/2-1 / 320898746","_id":"32","name":"Performance and Efficiency in HPC with Custom Computing"},{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"type":"journal_article","status":"public","volume":25,"author":[{"last_name":"Richters","full_name":"Richters, Dorothee","first_name":"Dorothee"},{"full_name":"Lass, Michael","id":"24135","last_name":"Lass","orcid":"0000-0002-5708-7632","first_name":"Michael"},{"last_name":"Walther","full_name":"Walther, Andrea","first_name":"Andrea"},{"last_name":"Plessl","orcid":"0000-0001-5728-9982","id":"16153","full_name":"Plessl, Christian","first_name":"Christian"},{"first_name":"Thomas","full_name":"Kühne, Thomas","id":"49079","last_name":"Kühne"}],"date_updated":"2023-09-26T11:45:02Z","doi":"10.4208/cicp.OA-2018-0053","page":"564-585","intvolume":"        25","citation":{"apa":"Richters, D., Lass, M., Walther, A., Plessl, C., &#38; Kühne, T. (2019). A General Algorithm to Calculate the Inverse Principal p-th Root of Symmetric Positive Definite Matrices. <i>Communications in Computational Physics</i>, <i>25</i>(2), 564–585. <a href=\"https://doi.org/10.4208/cicp.OA-2018-0053\">https://doi.org/10.4208/cicp.OA-2018-0053</a>","short":"D. Richters, M. Lass, A. Walther, C. Plessl, T. Kühne, Communications in Computational Physics 25 (2019) 564–585.","bibtex":"@article{Richters_Lass_Walther_Plessl_Kühne_2019, title={A General Algorithm to Calculate the Inverse Principal p-th Root of Symmetric Positive Definite Matrices}, volume={25}, DOI={<a href=\"https://doi.org/10.4208/cicp.OA-2018-0053\">10.4208/cicp.OA-2018-0053</a>}, number={2}, journal={Communications in Computational Physics}, publisher={Global Science Press}, author={Richters, Dorothee and Lass, Michael and Walther, Andrea and Plessl, Christian and Kühne, Thomas}, year={2019}, pages={564–585} }","mla":"Richters, Dorothee, et al. “A General Algorithm to Calculate the Inverse Principal P-Th Root of Symmetric Positive Definite Matrices.” <i>Communications in Computational Physics</i>, vol. 25, no. 2, Global Science Press, 2019, pp. 564–85, doi:<a href=\"https://doi.org/10.4208/cicp.OA-2018-0053\">10.4208/cicp.OA-2018-0053</a>.","ieee":"D. Richters, M. Lass, A. Walther, C. Plessl, and T. Kühne, “A General Algorithm to Calculate the Inverse Principal p-th Root of Symmetric Positive Definite Matrices,” <i>Communications in Computational Physics</i>, vol. 25, no. 2, pp. 564–585, 2019, doi: <a href=\"https://doi.org/10.4208/cicp.OA-2018-0053\">10.4208/cicp.OA-2018-0053</a>.","chicago":"Richters, Dorothee, Michael Lass, Andrea Walther, Christian Plessl, and Thomas Kühne. “A General Algorithm to Calculate the Inverse Principal P-Th Root of Symmetric Positive Definite Matrices.” <i>Communications in Computational Physics</i> 25, no. 2 (2019): 564–85. <a href=\"https://doi.org/10.4208/cicp.OA-2018-0053\">https://doi.org/10.4208/cicp.OA-2018-0053</a>.","ama":"Richters D, Lass M, Walther A, Plessl C, Kühne T. A General Algorithm to Calculate the Inverse Principal p-th Root of Symmetric Positive Definite Matrices. <i>Communications in Computational Physics</i>. 2019;25(2):564-585. doi:<a href=\"https://doi.org/10.4208/cicp.OA-2018-0053\">10.4208/cicp.OA-2018-0053</a>"}},{"status":"public","file":[{"file_name":"plessl19_informatik_spektrum.pdf","file_id":"12872","access_level":"open_access","file_size":248360,"date_created":"2019-07-22T12:45:02Z","creator":"plessl","date_updated":"2019-07-22T12:45:02Z","relation":"main_file","content_type":"application/pdf"}],"publication":"Informatik Spektrum","type":"journal_article","ddc":["004"],"file_date_updated":"2019-07-22T12:45:02Z","language":[{"iso":"ger"}],"_id":"12871","department":[{"_id":"27"},{"_id":"518"},{"_id":"78"}],"user_id":"15278","year":"2019","citation":{"ama":"Platzner M, Plessl C. FPGAs im Rechenzentrum. <i>Informatik Spektrum</i>. Published online 2019. doi:<a href=\"https://doi.org/10.1007/s00287-019-01187-w\">10.1007/s00287-019-01187-w</a>","ieee":"M. Platzner and C. Plessl, “FPGAs im Rechenzentrum,” <i>Informatik Spektrum</i>, 2019, doi: <a href=\"https://doi.org/10.1007/s00287-019-01187-w\">10.1007/s00287-019-01187-w</a>.","chicago":"Platzner, Marco, and Christian Plessl. “FPGAs im Rechenzentrum.” <i>Informatik Spektrum</i>, 2019. <a href=\"https://doi.org/10.1007/s00287-019-01187-w\">https://doi.org/10.1007/s00287-019-01187-w</a>.","apa":"Platzner, M., &#38; Plessl, C. (2019). FPGAs im Rechenzentrum. <i>Informatik Spektrum</i>. <a href=\"https://doi.org/10.1007/s00287-019-01187-w\">https://doi.org/10.1007/s00287-019-01187-w</a>","mla":"Platzner, Marco, and Christian Plessl. “FPGAs im Rechenzentrum.” <i>Informatik Spektrum</i>, 2019, doi:<a href=\"https://doi.org/10.1007/s00287-019-01187-w\">10.1007/s00287-019-01187-w</a>.","bibtex":"@article{Platzner_Plessl_2019, title={FPGAs im Rechenzentrum}, DOI={<a href=\"https://doi.org/10.1007/s00287-019-01187-w\">10.1007/s00287-019-01187-w</a>}, journal={Informatik Spektrum}, author={Platzner, Marco and Plessl, Christian}, year={2019} }","short":"M. Platzner, C. Plessl, Informatik Spektrum (2019)."},"publication_identifier":{"issn":["0170-6012","1432-122X"]},"quality_controlled":"1","has_accepted_license":"1","publication_status":"published","title":"FPGAs im Rechenzentrum","doi":"10.1007/s00287-019-01187-w","oa":"1","date_updated":"2023-09-26T11:45:57Z","date_created":"2019-07-22T12:42:44Z","author":[{"first_name":"Marco","id":"398","full_name":"Platzner, Marco","last_name":"Platzner"},{"first_name":"Christian","full_name":"Plessl, Christian","id":"16153","last_name":"Plessl","orcid":"0000-0001-5728-9982"}]},{"status":"public","type":"journal_article","department":[{"_id":"27"},{"_id":"518"},{"_id":"304"}],"user_id":"16153","_id":"20","project":[{"grant_number":"PL 595/2-1","name":"Performance and Efficiency in HPC with Custom Computing","_id":"32"},{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"page":" 33-36","intvolume":"        10","citation":{"ieee":"M. Lass, T. Kühne, and C. Plessl, “Using Approximate Computing for the Calculation of Inverse Matrix p-th Roots,” <i>Embedded Systems Letters</i>, vol. 10, no. 2, pp. 33–36, 2018.","chicago":"Lass, Michael, Thomas Kühne, and Christian Plessl. “Using Approximate Computing for the Calculation of Inverse Matrix P-Th Roots.” <i>Embedded Systems Letters</i> 10, no. 2 (2018): 33–36. <a href=\"https://doi.org/10.1109/LES.2017.2760923\">https://doi.org/10.1109/LES.2017.2760923</a>.","ama":"Lass M, Kühne T, Plessl C. Using Approximate Computing for the Calculation of Inverse Matrix p-th Roots. <i>Embedded Systems Letters</i>. 2018;10(2):33-36. doi:<a href=\"https://doi.org/10.1109/LES.2017.2760923\">10.1109/LES.2017.2760923</a>","bibtex":"@article{Lass_Kühne_Plessl_2018, title={Using Approximate Computing for the Calculation of Inverse Matrix p-th Roots}, volume={10}, DOI={<a href=\"https://doi.org/10.1109/LES.2017.2760923\">10.1109/LES.2017.2760923</a>}, number={2}, journal={Embedded Systems Letters}, publisher={IEEE}, author={Lass, Michael and Kühne, Thomas and Plessl, Christian}, year={2018}, pages={33–36} }","short":"M. Lass, T. Kühne, C. Plessl, Embedded Systems Letters 10 (2018) 33–36.","mla":"Lass, Michael, et al. “Using Approximate Computing for the Calculation of Inverse Matrix P-Th Roots.” <i>Embedded Systems Letters</i>, vol. 10, no. 2, IEEE, 2018, pp. 33–36, doi:<a href=\"https://doi.org/10.1109/LES.2017.2760923\">10.1109/LES.2017.2760923</a>.","apa":"Lass, M., Kühne, T., &#38; Plessl, C. (2018). Using Approximate Computing for the Calculation of Inverse Matrix p-th Roots. <i>Embedded Systems Letters</i>, <i>10</i>(2), 33–36. <a href=\"https://doi.org/10.1109/LES.2017.2760923\">https://doi.org/10.1109/LES.2017.2760923</a>"},"publication_identifier":{"eissn":["1943-0671"],"issn":["1943-0663"]},"publication_status":"published","doi":"10.1109/LES.2017.2760923","volume":10,"author":[{"first_name":"Michael","id":"24135","full_name":"Lass, Michael","orcid":"0000-0002-5708-7632","last_name":"Lass"},{"id":"49079","full_name":"Kühne, Thomas","last_name":"Kühne","first_name":"Thomas"},{"first_name":"Christian","full_name":"Plessl, Christian","id":"16153","orcid":"0000-0001-5728-9982","last_name":"Plessl"}],"date_updated":"2022-01-06T06:54:18Z","abstract":[{"text":"Approximate computing has shown to provide new ways to improve performance\r\nand power consumption of error-resilient applications. While many of these\r\napplications can be found in image processing, data classification or machine\r\nlearning, we demonstrate its suitability to a problem from scientific\r\ncomputing. Utilizing the self-correcting behavior of iterative algorithms, we\r\nshow that approximate computing can be applied to the calculation of inverse\r\nmatrix p-th roots which are required in many applications in scientific\r\ncomputing. Results show great opportunities to reduce the computational effort\r\nand bandwidth required for the execution of the discussed algorithm, especially\r\nwhen targeting special accelerator hardware.","lang":"eng"}],"publication":"Embedded Systems Letters","language":[{"iso":"eng"}],"external_id":{"arxiv":["1703.02283"]},"year":"2018","issue":"2","title":"Using Approximate Computing for the Calculation of Inverse Matrix p-th Roots","date_created":"2017-07-25T14:41:08Z","publisher":"IEEE"},{"user_id":"16153","department":[{"_id":"27"},{"_id":"518"}],"_id":"6516","file_date_updated":"2019-01-08T17:47:06Z","type":"journal_article","status":"public","author":[{"last_name":"Mertens","full_name":"Mertens, Jan Cedric","first_name":"Jan Cedric"},{"first_name":"Alexander","full_name":"Boschmann, Alexander","last_name":"Boschmann"},{"full_name":"Schmidt, M.","last_name":"Schmidt","first_name":"M."},{"full_name":"Plessl, Christian","id":"16153","last_name":"Plessl","orcid":"0000-0001-5728-9982","first_name":"Christian"}],"volume":21,"date_updated":"2022-01-06T07:03:09Z","doi":"10.1007/s12283-018-0291-0","publication_status":"published","has_accepted_license":"1","publication_identifier":{"issn":["1369-7072","1460-2687"]},"citation":{"bibtex":"@article{Mertens_Boschmann_Schmidt_Plessl_2018, title={Sprint diagnostic with GPS and inertial sensor fusion}, volume={21}, DOI={<a href=\"https://doi.org/10.1007/s12283-018-0291-0\">10.1007/s12283-018-0291-0</a>}, number={4}, journal={Sports Engineering}, publisher={Springer Nature}, author={Mertens, Jan Cedric and Boschmann, Alexander and Schmidt, M. and Plessl, Christian}, year={2018}, pages={441–451} }","mla":"Mertens, Jan Cedric, et al. “Sprint Diagnostic with GPS and Inertial Sensor Fusion.” <i>Sports Engineering</i>, vol. 21, no. 4, Springer Nature, 2018, pp. 441–51, doi:<a href=\"https://doi.org/10.1007/s12283-018-0291-0\">10.1007/s12283-018-0291-0</a>.","short":"J.C. Mertens, A. Boschmann, M. Schmidt, C. Plessl, Sports Engineering 21 (2018) 441–451.","apa":"Mertens, J. C., Boschmann, A., Schmidt, M., &#38; Plessl, C. (2018). Sprint diagnostic with GPS and inertial sensor fusion. <i>Sports Engineering</i>, <i>21</i>(4), 441–451. <a href=\"https://doi.org/10.1007/s12283-018-0291-0\">https://doi.org/10.1007/s12283-018-0291-0</a>","ieee":"J. C. Mertens, A. Boschmann, M. Schmidt, and C. Plessl, “Sprint diagnostic with GPS and inertial sensor fusion,” <i>Sports Engineering</i>, vol. 21, no. 4, pp. 441–451, 2018.","chicago":"Mertens, Jan Cedric, Alexander Boschmann, M. Schmidt, and Christian Plessl. “Sprint Diagnostic with GPS and Inertial Sensor Fusion.” <i>Sports Engineering</i> 21, no. 4 (2018): 441–51. <a href=\"https://doi.org/10.1007/s12283-018-0291-0\">https://doi.org/10.1007/s12283-018-0291-0</a>.","ama":"Mertens JC, Boschmann A, Schmidt M, Plessl C. Sprint diagnostic with GPS and inertial sensor fusion. <i>Sports Engineering</i>. 2018;21(4):441-451. doi:<a href=\"https://doi.org/10.1007/s12283-018-0291-0\">10.1007/s12283-018-0291-0</a>"},"page":"441-451","intvolume":"        21","language":[{"iso":"eng"}],"ddc":["000"],"publication":"Sports Engineering","file":[{"file_name":"plessl18_sportseng.pdf","access_level":"closed","file_id":"6517","file_size":2141021,"creator":"plessl","date_created":"2019-01-08T17:47:06Z","date_updated":"2019-01-08T17:47:06Z","relation":"main_file","content_type":"application/pdf"}],"date_created":"2019-01-08T17:44:43Z","publisher":"Springer Nature","title":"Sprint diagnostic with GPS and inertial sensor fusion","issue":"4","quality_controlled":"1","year":"2018"},{"status":"public","type":"conference","file_date_updated":"2018-11-02T14:45:05Z","_id":"1588","project":[{"name":"HighPerMeshes","_id":"33","grant_number":"01|H16005A"},{"grant_number":"160364472","_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C2","_id":"14","grant_number":"160364472"}],"department":[{"_id":"27"},{"_id":"518"},{"_id":"61"}],"user_id":"15278","citation":{"apa":"Kenter, T., Mahale, G., Alhaddad, S., Grynko, Y., Schmitt, C., Afzal, A., Hannig, F., Förstner, J., &#38; Plessl, C. (2018). OpenCL-based FPGA Design to Accelerate the Nodal Discontinuous Galerkin Method for Unstructured Meshes. <i>Proc. Int. Symp. on Field-Programmable Custom Computing Machines (FCCM)</i>. Proc. Int. Symp. on Field-Programmable Custom Computing Machines (FCCM). <a href=\"https://doi.org/10.1109/FCCM.2018.00037\">https://doi.org/10.1109/FCCM.2018.00037</a>","bibtex":"@inproceedings{Kenter_Mahale_Alhaddad_Grynko_Schmitt_Afzal_Hannig_Förstner_Plessl_2018, title={OpenCL-based FPGA Design to Accelerate the Nodal Discontinuous Galerkin Method for Unstructured Meshes}, DOI={<a href=\"https://doi.org/10.1109/FCCM.2018.00037\">10.1109/FCCM.2018.00037</a>}, booktitle={Proc. Int. Symp. on Field-Programmable Custom Computing Machines (FCCM)}, publisher={IEEE}, author={Kenter, Tobias and Mahale, Gopinath and Alhaddad, Samer and Grynko, Yevgen and Schmitt, Christian and Afzal, Ayesha and Hannig, Frank and Förstner, Jens and Plessl, Christian}, year={2018} }","short":"T. Kenter, G. Mahale, S. Alhaddad, Y. Grynko, C. Schmitt, A. Afzal, F. Hannig, J. Förstner, C. Plessl, in: Proc. Int. Symp. on Field-Programmable Custom Computing Machines (FCCM), IEEE, 2018.","mla":"Kenter, Tobias, et al. “OpenCL-Based FPGA Design to Accelerate the Nodal Discontinuous Galerkin Method for Unstructured Meshes.” <i>Proc. Int. Symp. on Field-Programmable Custom Computing Machines (FCCM)</i>, IEEE, 2018, doi:<a href=\"https://doi.org/10.1109/FCCM.2018.00037\">10.1109/FCCM.2018.00037</a>.","ama":"Kenter T, Mahale G, Alhaddad S, et al. OpenCL-based FPGA Design to Accelerate the Nodal Discontinuous Galerkin Method for Unstructured Meshes. In: <i>Proc. Int. Symp. on Field-Programmable Custom Computing Machines (FCCM)</i>. IEEE; 2018. doi:<a href=\"https://doi.org/10.1109/FCCM.2018.00037\">10.1109/FCCM.2018.00037</a>","chicago":"Kenter, Tobias, Gopinath Mahale, Samer Alhaddad, Yevgen Grynko, Christian Schmitt, Ayesha Afzal, Frank Hannig, Jens Förstner, and Christian Plessl. “OpenCL-Based FPGA Design to Accelerate the Nodal Discontinuous Galerkin Method for Unstructured Meshes.” In <i>Proc. Int. Symp. on Field-Programmable Custom Computing Machines (FCCM)</i>. IEEE, 2018. <a href=\"https://doi.org/10.1109/FCCM.2018.00037\">https://doi.org/10.1109/FCCM.2018.00037</a>.","ieee":"T. Kenter <i>et al.</i>, “OpenCL-based FPGA Design to Accelerate the Nodal Discontinuous Galerkin Method for Unstructured Meshes,” presented at the Proc. Int. Symp. on Field-Programmable Custom Computing Machines (FCCM), 2018, doi: <a href=\"https://doi.org/10.1109/FCCM.2018.00037\">10.1109/FCCM.2018.00037</a>."},"has_accepted_license":"1","conference":{"name":"Proc. Int. Symp. on Field-Programmable Custom Computing Machines (FCCM)"},"doi":"10.1109/FCCM.2018.00037","date_updated":"2023-09-26T11:47:52Z","author":[{"first_name":"Tobias","last_name":"Kenter","full_name":"Kenter, Tobias","id":"3145"},{"last_name":"Mahale","full_name":"Mahale, Gopinath","first_name":"Gopinath"},{"first_name":"Samer","last_name":"Alhaddad","full_name":"Alhaddad, Samer","id":"42456"},{"last_name":"Grynko","full_name":"Grynko, Yevgen","id":"26059","first_name":"Yevgen"},{"full_name":"Schmitt, Christian","last_name":"Schmitt","first_name":"Christian"},{"first_name":"Ayesha","full_name":"Afzal, Ayesha","last_name":"Afzal"},{"last_name":"Hannig","full_name":"Hannig, Frank","first_name":"Frank"},{"first_name":"Jens","orcid":"0000-0001-7059-9862","last_name":"Förstner","full_name":"Förstner, Jens","id":"158"},{"first_name":"Christian","orcid":"0000-0001-5728-9982","last_name":"Plessl","full_name":"Plessl, Christian","id":"16153"}],"abstract":[{"lang":"eng","text":"The exploration of FPGAs as accelerators for scientific simulations has so far mostly been focused on small kernels of methods working on regular data structures, for example in the form of stencil computations for finite difference methods. In computational sciences, often more advanced methods are employed that promise better stability, convergence, locality and scaling. Unstructured meshes are shown to be more effective and more accurate, compared to regular grids, in representing computation domains of various shapes. Using unstructured meshes, the discontinuous Galerkin method preserves the ability to perform explicit local update operations for simulations in the time domain. In this work, we investigate FPGAs as target platform for an implementation of the nodal discontinuous Galerkin method to find time-domain solutions of Maxwell's equations in an unstructured mesh. When maximizing data reuse and fitting constant coefficients into suitably partitioned on-chip memory, high computational intensity allows us to implement and feed wide data paths with hundreds of floating point operators. By decoupling off-chip memory accesses from the computations, high memory bandwidth can be sustained, even for the irregular access pattern required by parts of the application. Using the Intel/Altera OpenCL SDK for FPGAs, we present different implementation variants for different polynomial orders of the method. In different phases of the algorithm, either computational or bandwidth limits of the Arria 10 platform are almost reached, thus outperforming a highly multithreaded CPU implementation by around 2x."}],"file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":269130,"file_id":"5282","file_name":"08457652.pdf","access_level":"closed","date_updated":"2018-11-02T14:45:05Z","date_created":"2018-11-02T14:45:05Z","creator":"ups"}],"publication":"Proc. Int. Symp. on Field-Programmable Custom Computing Machines (FCCM)","keyword":["tet_topic_hpc"],"ddc":["000"],"language":[{"iso":"eng"}],"year":"2018","quality_controlled":"1","title":"OpenCL-based FPGA Design to Accelerate the Nodal Discontinuous Galerkin Method for Unstructured Meshes","publisher":"IEEE","date_created":"2018-03-22T10:48:01Z"},{"citation":{"apa":"Lass, M., Mohr, S., Wiebeler, H., Kühne, T., &#38; Plessl, C. (2018). A Massively Parallel Algorithm for the Approximate Calculation of Inverse p-th Roots of Large Sparse Matrices. <i>Proc. Platform for Advanced Scientific Computing (PASC) Conference</i>. Platform for Advanced Scientific Computing Conference (PASC), Basel, Switzerland. <a href=\"https://doi.org/10.1145/3218176.3218231\">https://doi.org/10.1145/3218176.3218231</a>","short":"M. Lass, S. Mohr, H. Wiebeler, T. Kühne, C. Plessl, in: Proc. Platform for Advanced Scientific Computing (PASC) Conference, ACM, New York, NY, USA, 2018.","mla":"Lass, Michael, et al. “A Massively Parallel Algorithm for the Approximate Calculation of Inverse P-Th Roots of Large Sparse Matrices.” <i>Proc. Platform for Advanced Scientific Computing (PASC) Conference</i>, ACM, 2018, doi:<a href=\"https://doi.org/10.1145/3218176.3218231\">10.1145/3218176.3218231</a>.","bibtex":"@inproceedings{Lass_Mohr_Wiebeler_Kühne_Plessl_2018, place={New York, NY, USA}, title={A Massively Parallel Algorithm for the Approximate Calculation of Inverse p-th Roots of Large Sparse Matrices}, DOI={<a href=\"https://doi.org/10.1145/3218176.3218231\">10.1145/3218176.3218231</a>}, booktitle={Proc. Platform for Advanced Scientific Computing (PASC) Conference}, publisher={ACM}, author={Lass, Michael and Mohr, Stephan and Wiebeler, Hendrik and Kühne, Thomas and Plessl, Christian}, year={2018} }","ieee":"M. Lass, S. Mohr, H. Wiebeler, T. Kühne, and C. Plessl, “A Massively Parallel Algorithm for the Approximate Calculation of Inverse p-th Roots of Large Sparse Matrices,” presented at the Platform for Advanced Scientific Computing Conference (PASC), Basel, Switzerland, 2018, doi: <a href=\"https://doi.org/10.1145/3218176.3218231\">10.1145/3218176.3218231</a>.","chicago":"Lass, Michael, Stephan Mohr, Hendrik Wiebeler, Thomas Kühne, and Christian Plessl. “A Massively Parallel Algorithm for the Approximate Calculation of Inverse P-Th Roots of Large Sparse Matrices.” In <i>Proc. Platform for Advanced Scientific Computing (PASC) Conference</i>. New York, NY, USA: ACM, 2018. <a href=\"https://doi.org/10.1145/3218176.3218231\">https://doi.org/10.1145/3218176.3218231</a>.","ama":"Lass M, Mohr S, Wiebeler H, Kühne T, Plessl C. A Massively Parallel Algorithm for the Approximate Calculation of Inverse p-th Roots of Large Sparse Matrices. In: <i>Proc. Platform for Advanced Scientific Computing (PASC) Conference</i>. ACM; 2018. doi:<a href=\"https://doi.org/10.1145/3218176.3218231\">10.1145/3218176.3218231</a>"},"place":"New York, NY, USA","publication_identifier":{"isbn":["978-1-4503-5891-0/18/07"]},"doi":"10.1145/3218176.3218231","conference":{"location":"Basel, Switzerland","end_date":"2018-07-04","start_date":"2018-07-02","name":"Platform for Advanced Scientific Computing Conference (PASC)"},"author":[{"orcid":"0000-0002-5708-7632","last_name":"Lass","id":"24135","full_name":"Lass, Michael","first_name":"Michael"},{"first_name":"Stephan","last_name":"Mohr","full_name":"Mohr, Stephan"},{"last_name":"Wiebeler","full_name":"Wiebeler, Hendrik","first_name":"Hendrik"},{"id":"49079","full_name":"Kühne, Thomas","last_name":"Kühne","first_name":"Thomas"},{"full_name":"Plessl, Christian","id":"16153","orcid":"0000-0001-5728-9982","last_name":"Plessl","first_name":"Christian"}],"date_updated":"2023-09-26T11:48:12Z","status":"public","type":"conference","department":[{"_id":"27"},{"_id":"518"},{"_id":"304"}],"user_id":"15278","_id":"1590","project":[{"grant_number":"PL 595/2-1 / 320898746","_id":"32","name":"Performance and Efficiency in HPC with Custom Computing"},{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"year":"2018","quality_controlled":"1","title":"A Massively Parallel Algorithm for the Approximate Calculation of Inverse p-th Roots of Large Sparse Matrices","date_created":"2018-03-22T10:53:01Z","publisher":"ACM","abstract":[{"lang":"eng","text":"We present the submatrix method, a highly parallelizable method for the approximate calculation of inverse p-th roots of large sparse symmetric matrices which are required in different scientific applications. Following the idea of Approximate Computing, we allow imprecision in the final result in order to utilize the sparsity of the input matrix and to allow massively parallel execution. For an n x n matrix, the proposed algorithm allows to distribute the calculations over n nodes with only little communication overhead. The result matrix exhibits the same sparsity pattern as the input matrix, allowing for efficient reuse of allocated data structures.\r\n\r\nWe evaluate the algorithm with respect to the error that it introduces into calculated results, as well as its performance and scalability. We demonstrate that the error is relatively limited for well-conditioned matrices and that results are still valuable for error-resilient applications like preconditioning even for ill-conditioned matrices. We discuss the execution time and scaling of the algorithm on a theoretical level and present a distributed implementation of the algorithm using MPI and OpenMP. We demonstrate the scalability of this implementation by running it on a high-performance compute cluster comprised of 1024 CPU cores, showing a speedup of 665x compared to single-threaded execution."}],"publication":"Proc. Platform for Advanced Scientific Computing (PASC) Conference","language":[{"iso":"eng"}],"keyword":["approximate computing","linear algebra","matrix inversion","matrix p-th roots","numeric algorithm","parallel computing"],"external_id":{"arxiv":["1710.10899"]}},{"file_date_updated":"2018-11-02T14:43:37Z","project":[{"name":"SFB 901","_id":"1","grant_number":"160364472"},{"name":"SFB 901 - Project Area C","_id":"4"},{"grant_number":"160364472","name":"SFB 901 - Subproject C2","_id":"14"}],"_id":"1204","user_id":"15278","department":[{"_id":"27"},{"_id":"518"}],"status":"public","type":"conference","doi":"10.1145/3178487.3178534","date_updated":"2023-09-26T11:47:23Z","author":[{"first_name":"Heinrich","last_name":"Riebler","id":"8961","full_name":"Riebler, Heinrich"},{"last_name":"Vaz","id":"30332","full_name":"Vaz, Gavin Francis","first_name":"Gavin Francis"},{"full_name":"Kenter, Tobias","id":"3145","last_name":"Kenter","first_name":"Tobias"},{"last_name":"Plessl","orcid":"0000-0001-5728-9982","id":"16153","full_name":"Plessl, Christian","first_name":"Christian"}],"citation":{"chicago":"Riebler, Heinrich, Gavin Francis Vaz, Tobias Kenter, and Christian Plessl. “Automated Code Acceleration Targeting Heterogeneous OpenCL Devices.” In <i>Proc. ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP)</i>. ACM, 2018. <a href=\"https://doi.org/10.1145/3178487.3178534\">https://doi.org/10.1145/3178487.3178534</a>.","ieee":"H. Riebler, G. F. Vaz, T. Kenter, and C. Plessl, “Automated Code Acceleration Targeting Heterogeneous OpenCL Devices,” 2018, doi: <a href=\"https://doi.org/10.1145/3178487.3178534\">10.1145/3178487.3178534</a>.","ama":"Riebler H, Vaz GF, Kenter T, Plessl C. Automated Code Acceleration Targeting Heterogeneous OpenCL Devices. In: <i>Proc. ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP)</i>. ACM; 2018. doi:<a href=\"https://doi.org/10.1145/3178487.3178534\">10.1145/3178487.3178534</a>","mla":"Riebler, Heinrich, et al. “Automated Code Acceleration Targeting Heterogeneous OpenCL Devices.” <i>Proc. ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP)</i>, ACM, 2018, doi:<a href=\"https://doi.org/10.1145/3178487.3178534\">10.1145/3178487.3178534</a>.","short":"H. Riebler, G.F. Vaz, T. Kenter, C. Plessl, in: Proc. ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP), ACM, 2018.","bibtex":"@inproceedings{Riebler_Vaz_Kenter_Plessl_2018, title={Automated Code Acceleration Targeting Heterogeneous OpenCL Devices}, DOI={<a href=\"https://doi.org/10.1145/3178487.3178534\">10.1145/3178487.3178534</a>}, booktitle={Proc. ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP)}, publisher={ACM}, author={Riebler, Heinrich and Vaz, Gavin Francis and Kenter, Tobias and Plessl, Christian}, year={2018} }","apa":"Riebler, H., Vaz, G. F., Kenter, T., &#38; Plessl, C. (2018). Automated Code Acceleration Targeting Heterogeneous OpenCL Devices. <i>Proc. ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP)</i>. <a href=\"https://doi.org/10.1145/3178487.3178534\">https://doi.org/10.1145/3178487.3178534</a>"},"publication_status":"published","has_accepted_license":"1","publication_identifier":{"isbn":["9781450349826"]},"ddc":["000"],"keyword":["htrop"],"language":[{"iso":"eng"}],"file":[{"file_name":"p417-riebler.pdf","access_level":"closed","file_id":"5281","file_size":447769,"date_created":"2018-11-02T14:43:37Z","creator":"ups","date_updated":"2018-11-02T14:43:37Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"publication":"Proc. ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP)","title":"Automated Code Acceleration Targeting Heterogeneous OpenCL Devices","publisher":"ACM","date_created":"2018-03-08T14:45:18Z","year":"2018","quality_controlled":"1"},{"publication_status":"published","publication_identifier":{"issn":["1936-7406"]},"has_accepted_license":"1","citation":{"chicago":"Riebler, Heinrich, Michael Lass, Robert Mittendorf, Thomas Löcke, and Christian Plessl. “Efficient Branch and Bound on FPGAs Using Work Stealing and Instance-Specific Designs.” <i>ACM Transactions on Reconfigurable Technology and Systems (TRETS)</i> 10, no. 3 (2017): 24:1-24:23. <a href=\"https://doi.org/10.1145/3053687\">https://doi.org/10.1145/3053687</a>.","ieee":"H. Riebler, M. Lass, R. Mittendorf, T. Löcke, and C. Plessl, “Efficient Branch and Bound on FPGAs Using Work Stealing and Instance-Specific Designs,” <i>ACM Transactions on Reconfigurable Technology and Systems (TRETS)</i>, vol. 10, no. 3, p. 24:1-24:23, 2017, doi: <a href=\"https://doi.org/10.1145/3053687\">10.1145/3053687</a>.","ama":"Riebler H, Lass M, Mittendorf R, Löcke T, Plessl C. Efficient Branch and Bound on FPGAs Using Work Stealing and Instance-Specific Designs. <i>ACM Transactions on Reconfigurable Technology and Systems (TRETS)</i>. 2017;10(3):24:1-24:23. doi:<a href=\"https://doi.org/10.1145/3053687\">10.1145/3053687</a>","apa":"Riebler, H., Lass, M., Mittendorf, R., Löcke, T., &#38; Plessl, C. (2017). Efficient Branch and Bound on FPGAs Using Work Stealing and Instance-Specific Designs. <i>ACM Transactions on Reconfigurable Technology and Systems (TRETS)</i>, <i>10</i>(3), 24:1-24:23. <a href=\"https://doi.org/10.1145/3053687\">https://doi.org/10.1145/3053687</a>","mla":"Riebler, Heinrich, et al. “Efficient Branch and Bound on FPGAs Using Work Stealing and Instance-Specific Designs.” <i>ACM Transactions on Reconfigurable Technology and Systems (TRETS)</i>, vol. 10, no. 3, Association for Computing Machinery (ACM), 2017, p. 24:1-24:23, doi:<a href=\"https://doi.org/10.1145/3053687\">10.1145/3053687</a>.","short":"H. Riebler, M. Lass, R. Mittendorf, T. Löcke, C. Plessl, ACM Transactions on Reconfigurable Technology and Systems (TRETS) 10 (2017) 24:1-24:23.","bibtex":"@article{Riebler_Lass_Mittendorf_Löcke_Plessl_2017, title={Efficient Branch and Bound on FPGAs Using Work Stealing and Instance-Specific Designs}, volume={10}, DOI={<a href=\"https://doi.org/10.1145/3053687\">10.1145/3053687</a>}, number={3}, journal={ACM Transactions on Reconfigurable Technology and Systems (TRETS)}, publisher={Association for Computing Machinery (ACM)}, author={Riebler, Heinrich and Lass, Michael and Mittendorf, Robert and Löcke, Thomas and Plessl, Christian}, year={2017}, pages={24:1-24:23} }"},"intvolume":"        10","page":"24:1-24:23","author":[{"last_name":"Riebler","full_name":"Riebler, Heinrich","id":"8961","first_name":"Heinrich"},{"first_name":"Michael","last_name":"Lass","orcid":"0000-0002-5708-7632","id":"24135","full_name":"Lass, Michael"},{"first_name":"Robert","last_name":"Mittendorf","full_name":"Mittendorf, Robert"},{"first_name":"Thomas","full_name":"Löcke, Thomas","last_name":"Löcke"},{"id":"16153","full_name":"Plessl, Christian","orcid":"0000-0001-5728-9982","last_name":"Plessl","first_name":"Christian"}],"volume":10,"date_updated":"2023-09-26T13:23:58Z","doi":"10.1145/3053687","type":"journal_article","status":"public","user_id":"15278","department":[{"_id":"27"},{"_id":"518"}],"project":[{"_id":"1","name":"SFB 901","grant_number":"160364472"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"14","name":"SFB 901 - Subproject C2","grant_number":"160364472"},{"grant_number":"610996","name":"Self-Adaptive Virtualisation-Aware High-Performance/Low-Energy Heterogeneous System Architectures","_id":"34"},{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"_id":"18","file_date_updated":"2018-11-02T16:04:14Z","issue":"3","quality_controlled":"1","year":"2017","date_created":"2017-07-25T14:17:32Z","publisher":"Association for Computing Machinery (ACM)","title":"Efficient Branch and Bound on FPGAs Using Work Stealing and Instance-Specific Designs","publication":"ACM Transactions on Reconfigurable Technology and Systems (TRETS)","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","access_level":"closed","file_id":"5322","file_name":"a24-riebler.pdf","file_size":2131617,"creator":"ups","date_created":"2018-11-02T16:04:14Z","date_updated":"2018-11-02T16:04:14Z"}],"abstract":[{"text":"Branch and bound (B&B) algorithms structure the search space as a tree and eliminate infeasible solutions early by pruning subtrees that cannot lead to a valid or optimal solution. Custom hardware designs significantly accelerate the execution of these algorithms. In this article, we demonstrate a high-performance B&B implementation on FPGAs. First, we identify general elements of B&B algorithms and describe their implementation as a finite state machine. Then, we introduce workers that autonomously cooperate using work stealing to allow parallel execution and full utilization of the target FPGA. Finally, we explore advantages of instance-specific designs that target a specific problem instance to improve performance.\r\n\r\nWe evaluate our concepts by applying them to a branch and bound problem, the reconstruction of corrupted AES keys obtained from cold-boot attacks. The evaluation shows that our work stealing approach is scalable with the available resources and provides speedups proportional to the number of workers. Instance-specific designs allow us to achieve an overall speedup of 47 × compared to the fastest implementation of AES key reconstruction so far. Finally, we demonstrate how instance-specific designs can be generated just-in-time such that the provided speedups outweigh the additional time required for design synthesis.","lang":"eng"}],"language":[{"iso":"eng"}],"ddc":["000"],"keyword":["coldboot"]},{"file":[{"date_updated":"2018-11-02T15:02:28Z","date_created":"2018-11-02T15:02:28Z","creator":"ups","file_size":230235,"access_level":"closed","file_name":"08056844.pdf","file_id":"5291","content_type":"application/pdf","success":1,"relation":"main_file"}],"abstract":[{"lang":"eng","text":"Compared to classical HDL designs, generating FPGA with high-level synthesis from an OpenCL specification promises easier exploration of different design alternatives and, through ready-to-use infrastructure and common abstractions for host and memory interfaces, easier portability between different FPGA families. In this work, we evaluate the extent of this promise. To this end, we present a parameterized FDTD implementation for photonic microcavity simulations. Our design can trade-off different forms of parallelism and works for two independent OpenCL-based FPGA design flows. Hence, we can target FPGAs from different vendors and different FPGA families. We describe how we used pre-processor macros to achieve this flexibility and to work around different shortcomings of the current tools. Choosing the right design configurations, we are able to present two extremely competitive solutions for very different FPGA targets, reaching up to 172 GFLOPS sustained performance. With the portability and flexibility demonstrated, code developers not only avoid vendor lock-in, but can even make best use of real trade-offs between different architectures."}],"publication":"Proc. Int. Conf. on Field Programmable Logic and Applications (FPL)","language":[{"iso":"eng"}],"keyword":["tet_topic_hpc"],"ddc":["000"],"year":"2017","quality_controlled":"1","title":"Flexible FPGA design for FDTD using OpenCL","date_created":"2018-03-22T11:10:23Z","publisher":"IEEE","status":"public","type":"conference","file_date_updated":"2018-11-02T15:02:28Z","department":[{"_id":"27"},{"_id":"518"},{"_id":"61"}],"user_id":"15278","_id":"1592","project":[{"grant_number":"160364472","name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"14","name":"SFB 901 - Subproject C2","grant_number":"160364472"},{"grant_number":"01|H16005A","name":"HighPerMeshes","_id":"33"},{"grant_number":"PL 595/2-1 / 320898746","name":"Performance and Efficiency in HPC with Custom Computing","_id":"32"},{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"citation":{"ieee":"T. Kenter, J. Förstner, and C. Plessl, “Flexible FPGA design for FDTD using OpenCL,” 2017, doi: <a href=\"https://doi.org/10.23919/FPL.2017.8056844\">10.23919/FPL.2017.8056844</a>.","chicago":"Kenter, Tobias, Jens Förstner, and Christian Plessl. “Flexible FPGA Design for FDTD Using OpenCL.” In <i>Proc. Int. Conf. on Field Programmable Logic and Applications (FPL)</i>. IEEE, 2017. <a href=\"https://doi.org/10.23919/FPL.2017.8056844\">https://doi.org/10.23919/FPL.2017.8056844</a>.","ama":"Kenter T, Förstner J, Plessl C. Flexible FPGA design for FDTD using OpenCL. In: <i>Proc. Int. Conf. on Field Programmable Logic and Applications (FPL)</i>. IEEE; 2017. doi:<a href=\"https://doi.org/10.23919/FPL.2017.8056844\">10.23919/FPL.2017.8056844</a>","bibtex":"@inproceedings{Kenter_Förstner_Plessl_2017, title={Flexible FPGA design for FDTD using OpenCL}, DOI={<a href=\"https://doi.org/10.23919/FPL.2017.8056844\">10.23919/FPL.2017.8056844</a>}, booktitle={Proc. Int. Conf. on Field Programmable Logic and Applications (FPL)}, publisher={IEEE}, author={Kenter, Tobias and Förstner, Jens and Plessl, Christian}, year={2017} }","short":"T. Kenter, J. Förstner, C. Plessl, in: Proc. Int. Conf. on Field Programmable Logic and Applications (FPL), IEEE, 2017.","mla":"Kenter, Tobias, et al. “Flexible FPGA Design for FDTD Using OpenCL.” <i>Proc. Int. Conf. on Field Programmable Logic and Applications (FPL)</i>, IEEE, 2017, doi:<a href=\"https://doi.org/10.23919/FPL.2017.8056844\">10.23919/FPL.2017.8056844</a>.","apa":"Kenter, T., Förstner, J., &#38; Plessl, C. (2017). Flexible FPGA design for FDTD using OpenCL. <i>Proc. Int. Conf. on Field Programmable Logic and Applications (FPL)</i>. <a href=\"https://doi.org/10.23919/FPL.2017.8056844\">https://doi.org/10.23919/FPL.2017.8056844</a>"},"has_accepted_license":"1","doi":"10.23919/FPL.2017.8056844","author":[{"last_name":"Kenter","id":"3145","full_name":"Kenter, Tobias","first_name":"Tobias"},{"last_name":"Förstner","orcid":"0000-0001-7059-9862","id":"158","full_name":"Förstner, Jens","first_name":"Jens"},{"last_name":"Plessl","orcid":"0000-0001-5728-9982","full_name":"Plessl, Christian","id":"16153","first_name":"Christian"}],"date_updated":"2023-09-26T13:24:38Z"}]