[{"type":"conference","publication":"Proceedings of IEEE Computer Society Annual Symposium on VLSI","abstract":[{"text":"Approximate computing (AC) has acquired significant maturity in recent years as a promising approach to obtain energy and area-efficient hardware. Automated approximate accelerator synthesis involves a great deal of complexity on the size of design space which exponentially grows with the number of possible approximations. Design space exploration of approximate accelerator synthesis is usually targeted via heuristic-based search methods. The majority of existing frameworks prune a large part of the design space using a greedy-based approach to keep the problem tractable. Therefore, they result in inferior solutions since many potential solutions are neglected in the pruning process without the possibility of backtracking of removed approximate instances. In this paper, we address the aforementioned issue by adopting Monte Carlo Tree Search (MCTS), as an efficient stochastic learning-based search algorithm, in the context of automated synthesis of approximate accelerators. This enables the synthesis frameworks to deeply subsamples the design space of approximate accelerator synthesis toward most promising approximate instances based on the required performance goals, i.e., power consumption, area, or/and delay. We investigated the challenges of providing an efficient open-source framework that benefits analytical and search-based approximation techniques simultaneously to both speed up the synthesis runtime and improve the quality of obtained results. Besides, we studied the utilization of machine learning algorithms to improve the performance of several critical steps, i.e., accelerator quality testing, in the synthesis framework. The proposed framework can help the community to rapidly generate efficient approximate accelerators in a reasonable runtime.","lang":"eng"}],"status":"public","_id":"22309","user_id":"64665","department":[{"_id":"78"}],"keyword":["Approximate computing","Design space exploration","Accelerator synthesis"],"language":[{"iso":"eng"}],"year":"2021","citation":{"mla":"Awais, Muhammad, and Marco Platzner. “MCTS-Based Synthesis Towards Efficient Approximate Accelerators.” <i>Proceedings of IEEE Computer Society Annual Symposium on VLSI</i>, IEEE, 2021, pp. 384–89.","short":"M. Awais, M. Platzner, in: Proceedings of IEEE Computer Society Annual Symposium on VLSI, IEEE, 2021, pp. 384–389.","bibtex":"@inproceedings{Awais_Platzner_2021, title={MCTS-Based Synthesis Towards Efficient Approximate Accelerators}, booktitle={Proceedings of IEEE Computer Society Annual Symposium on VLSI}, publisher={IEEE}, author={Awais, Muhammad and Platzner, Marco}, year={2021}, pages={384–389} }","apa":"Awais, M., &#38; Platzner, M. (2021). MCTS-Based Synthesis Towards Efficient Approximate Accelerators. <i>Proceedings of IEEE Computer Society Annual Symposium on VLSI</i>, 384–389.","chicago":"Awais, Muhammad, and Marco Platzner. “MCTS-Based Synthesis Towards Efficient Approximate Accelerators.” In <i>Proceedings of IEEE Computer Society Annual Symposium on VLSI</i>, 384–89. IEEE, 2021.","ieee":"M. Awais and M. Platzner, “MCTS-Based Synthesis Towards Efficient Approximate Accelerators,” in <i>Proceedings of IEEE Computer Society Annual Symposium on VLSI</i>, Tampa, Florida USA (Virtual), 2021, pp. 384–389.","ama":"Awais M, Platzner M. MCTS-Based Synthesis Towards Efficient Approximate Accelerators. In: <i>Proceedings of IEEE Computer Society Annual Symposium on VLSI</i>. IEEE; 2021:384-389."},"page":"384-389","publisher":"IEEE","date_updated":"2022-01-06T06:55:31Z","author":[{"first_name":"Muhammad","orcid":"https://orcid.org/0000-0003-4148-2969","last_name":"Awais","full_name":"Awais, Muhammad","id":"64665"},{"last_name":"Platzner","full_name":"Platzner, Marco","first_name":"Marco"}],"date_created":"2021-06-14T14:05:17Z","title":"MCTS-Based Synthesis Towards Efficient Approximate Accelerators","conference":{"end_date":"2021-07-09","location":"Tampa, Florida USA (Virtual)","name":"IEEE Computer Society Annual Symposium on VLSI","start_date":"2021-07-07"}},{"_id":"17358","project":[{"_id":"12","name":"SFB 901 - Subproject B4"},{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"1","name":"SFB 901"}],"department":[{"_id":"78"}],"user_id":"49051","article_type":"original","funded_apc":"1","type":"journal_article","status":"public","date_updated":"2022-01-06T06:53:09Z","volume":28,"author":[{"id":"49051","full_name":"Witschen, Linus Matthias","last_name":"Witschen","first_name":"Linus Matthias"},{"last_name":"Wiersema","full_name":"Wiersema, Tobias","id":"3118","first_name":"Tobias"},{"id":"398","full_name":"Platzner, Marco","last_name":"Platzner","first_name":"Marco"}],"doi":"10.1109/TVLSI.2020.3008061","publication_identifier":{"issn":["1063-8210"],"eissn":["1557-9999"]},"publication_status":"published","intvolume":"        28","page":"2084 - 2088","citation":{"ieee":"L. M. Witschen, T. Wiersema, and M. Platzner, “Proof-carrying Approximate Circuits,” <i>IEEE Transactions On Very Large Scale Integration Systems</i>, vol. 28, no. 9, pp. 2084–2088, 2020.","chicago":"Witschen, Linus Matthias, Tobias Wiersema, and Marco Platzner. “Proof-Carrying Approximate Circuits.” <i>IEEE Transactions On Very Large Scale Integration Systems</i> 28, no. 9 (2020): 2084–88. <a href=\"https://doi.org/10.1109/TVLSI.2020.3008061\">https://doi.org/10.1109/TVLSI.2020.3008061</a>.","ama":"Witschen LM, Wiersema T, Platzner M. Proof-carrying Approximate Circuits. <i>IEEE Transactions On Very Large Scale Integration Systems</i>. 2020;28(9):2084-2088. doi:<a href=\"https://doi.org/10.1109/TVLSI.2020.3008061\">10.1109/TVLSI.2020.3008061</a>","bibtex":"@article{Witschen_Wiersema_Platzner_2020, title={Proof-carrying Approximate Circuits}, volume={28}, DOI={<a href=\"https://doi.org/10.1109/TVLSI.2020.3008061\">10.1109/TVLSI.2020.3008061</a>}, number={9}, journal={IEEE Transactions On Very Large Scale Integration Systems}, publisher={IEEE}, author={Witschen, Linus Matthias and Wiersema, Tobias and Platzner, Marco}, year={2020}, pages={2084–2088} }","mla":"Witschen, Linus Matthias, et al. “Proof-Carrying Approximate Circuits.” <i>IEEE Transactions On Very Large Scale Integration Systems</i>, vol. 28, no. 9, IEEE, 2020, pp. 2084–88, doi:<a href=\"https://doi.org/10.1109/TVLSI.2020.3008061\">10.1109/TVLSI.2020.3008061</a>.","short":"L.M. Witschen, T. Wiersema, M. Platzner, IEEE Transactions On Very Large Scale Integration Systems 28 (2020) 2084–2088.","apa":"Witschen, L. M., Wiersema, T., &#38; Platzner, M. (2020). Proof-carrying Approximate Circuits. <i>IEEE Transactions On Very Large Scale Integration Systems</i>, <i>28</i>(9), 2084–2088. <a href=\"https://doi.org/10.1109/TVLSI.2020.3008061\">https://doi.org/10.1109/TVLSI.2020.3008061</a>"},"keyword":["Approximate circuit synthesis","approximate computing","error metrics","formal verification","proof-carrying hardware"],"language":[{"iso":"eng"}],"publication":"IEEE Transactions On Very Large Scale Integration Systems","abstract":[{"text":"Approximate circuits trade-off computational accuracy against improvements in hardware area, delay, or energy consumption. IP core vendors who wish to create such circuits need to convince consumers of the resulting approximation quality. As a solution we propose proof-carrying approximate circuits: The vendor creates an approximate IP core together with a certificate that proves the approximation quality. The proof certificate is bundled with the approximate IP core and sent off to the consumer. The consumer can formally verify the approximation quality of the IP core at a fraction of the typical computational cost for formal verification. In this paper, we first make the case for proof-carrying approximate circuits and then demonstrate the feasibility of the approach by a set of synthesis experiments using an exemplary approximation framework.","lang":"eng"}],"publisher":"IEEE","date_created":"2020-07-06T11:21:30Z","title":"Proof-carrying Approximate Circuits","quality_controlled":"1","issue":"9","year":"2020"},{"publisher":"Elsevier","date_created":"2018-07-20T14:08:49Z","title":"CIRCA: Towards a Modular and Extensible Framework for Approximate Circuit Generation","year":"2019","keyword":["Approximate Computing","Framework","Pareto Front","Accuracy"],"language":[{"iso":"eng"}],"publication":"Microelectronics Reliability","abstract":[{"lang":"eng","text":"Existing approaches and tools for the generation of approximate circuits often lack generality and are restricted to certain circuit types, approximation techniques, and quality assurance methods. Moreover, only few tools are publicly available. This hinders the development and evaluation of new techniques for approximating circuits and their comparison to previous approaches. In this paper, we first analyze and classify related approaches and then present CIRCA, our flexible framework for search-based approximate circuit generation. CIRCA is developed with a focus on modularity and extensibility. We present the architecture of CIRCA with its clear separation into stages and functional blocks, report on the current prototype, and show initial experiments."}],"date_updated":"2022-01-06T06:59:25Z","author":[{"first_name":"Linus Matthias","last_name":"Witschen","id":"49051","full_name":"Witschen, Linus Matthias"},{"last_name":"Wiersema","full_name":"Wiersema, Tobias","id":"3118","first_name":"Tobias"},{"first_name":"Hassan","full_name":"Ghasemzadeh Mohammadi, Hassan","id":"61186","last_name":"Ghasemzadeh Mohammadi"},{"first_name":"Muhammad","last_name":"Awais","orcid":"https://orcid.org/0000-0003-4148-2969","id":"64665","full_name":"Awais, Muhammad"},{"id":"398","full_name":"Platzner, Marco","last_name":"Platzner","first_name":"Marco"}],"volume":99,"doi":"10.1016/j.microrel.2019.04.003","publication_status":"published","publication_identifier":{"issn":["0026-2714"]},"citation":{"ama":"Witschen LM, Wiersema T, Ghasemzadeh Mohammadi H, Awais M, Platzner M. CIRCA: Towards a Modular and Extensible Framework for Approximate Circuit Generation. <i>Microelectronics Reliability</i>. 2019;99:277-290. doi:<a href=\"https://doi.org/10.1016/j.microrel.2019.04.003\">10.1016/j.microrel.2019.04.003</a>","chicago":"Witschen, Linus Matthias, Tobias Wiersema, Hassan Ghasemzadeh Mohammadi, Muhammad Awais, and Marco Platzner. “CIRCA: Towards a Modular and Extensible Framework for Approximate Circuit Generation.” <i>Microelectronics Reliability</i> 99 (2019): 277–90. <a href=\"https://doi.org/10.1016/j.microrel.2019.04.003\">https://doi.org/10.1016/j.microrel.2019.04.003</a>.","ieee":"L. M. Witschen, T. Wiersema, H. Ghasemzadeh Mohammadi, M. Awais, and M. Platzner, “CIRCA: Towards a Modular and Extensible Framework for Approximate Circuit Generation,” <i>Microelectronics Reliability</i>, vol. 99, pp. 277–290, 2019.","bibtex":"@article{Witschen_Wiersema_Ghasemzadeh Mohammadi_Awais_Platzner_2019, title={CIRCA: Towards a Modular and Extensible Framework for Approximate Circuit Generation}, volume={99}, DOI={<a href=\"https://doi.org/10.1016/j.microrel.2019.04.003\">10.1016/j.microrel.2019.04.003</a>}, journal={Microelectronics Reliability}, publisher={Elsevier}, author={Witschen, Linus Matthias and Wiersema, Tobias and Ghasemzadeh Mohammadi, Hassan and Awais, Muhammad and Platzner, Marco}, year={2019}, pages={277–290} }","mla":"Witschen, Linus Matthias, et al. “CIRCA: Towards a Modular and Extensible Framework for Approximate Circuit Generation.” <i>Microelectronics Reliability</i>, vol. 99, Elsevier, 2019, pp. 277–90, doi:<a href=\"https://doi.org/10.1016/j.microrel.2019.04.003\">10.1016/j.microrel.2019.04.003</a>.","short":"L.M. Witschen, T. Wiersema, H. Ghasemzadeh Mohammadi, M. Awais, M. Platzner, Microelectronics Reliability 99 (2019) 277–290.","apa":"Witschen, L. M., Wiersema, T., Ghasemzadeh Mohammadi, H., Awais, M., &#38; Platzner, M. (2019). CIRCA: Towards a Modular and Extensible Framework for Approximate Circuit Generation. <i>Microelectronics Reliability</i>, <i>99</i>, 277–290. <a href=\"https://doi.org/10.1016/j.microrel.2019.04.003\">https://doi.org/10.1016/j.microrel.2019.04.003</a>"},"page":"277-290","intvolume":"        99","project":[{"name":"SFB 901 - Subproject B4","_id":"12"},{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"_id":"3585","user_id":"49051","department":[{"_id":"78"}],"type":"journal_article","status":"public"},{"file":[{"date_created":"2020-04-25T08:00:35Z","creator":"witschen","date_updated":"2020-04-25T08:00:35Z","file_name":"AxC19_paper_3.pdf","access_level":"closed","file_id":"16854","file_size":152806,"content_type":"application/pdf","relation":"main_file","success":1}],"status":"public","abstract":[{"text":"State-of-the-art frameworks for generating approximate circuits usually rely on information gained through circuit synthesis and/or verification to explore the search space and to find an optimal solution. Throughout the process, a large number of circuits may be subject to processing, leading to considerable runtimes. In this work, we propose a search which takes error bounds and pre-computed impact factors into account to reduce the number of invoked synthesis and verification processes. In our experimental results, we achieved speed-ups of up to 76x while area savings remain comparable to the reference search method, simulated annealing.","lang":"eng"}],"type":"preprint","publication":"Fourth Workshop on Approximate Computing (AxC 2019)","language":[{"iso":"eng"}],"file_date_updated":"2020-04-25T08:00:35Z","ddc":["006"],"keyword":["Approximate computing","parameter selection","search space exploration","verification","circuit synthesis"],"user_id":"49051","department":[{"_id":"78"}],"project":[{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"_id":"16853","citation":{"ieee":"L. M. Witschen, H. Ghasemzadeh Mohammadi, M. Artmann, and M. Platzner, “Jump Search: A Fast Technique for the Synthesis of Approximate Circuits,” <i>Fourth Workshop on Approximate Computing (AxC 2019)</i>. .","chicago":"Witschen, Linus Matthias, Hassan Ghasemzadeh Mohammadi, Matthias Artmann, and Marco Platzner. “Jump Search: A Fast Technique for the Synthesis of Approximate Circuits.” <i>Fourth Workshop on Approximate Computing (AxC 2019)</i>, n.d.","ama":"Witschen LM, Ghasemzadeh Mohammadi H, Artmann M, Platzner M. Jump Search: A Fast Technique for the Synthesis of Approximate Circuits. <i>Fourth Workshop on Approximate Computing (AxC 2019)</i>.","apa":"Witschen, L. M., Ghasemzadeh Mohammadi, H., Artmann, M., &#38; Platzner, M. (n.d.). Jump Search: A Fast Technique for the Synthesis of Approximate Circuits. <i>Fourth Workshop on Approximate Computing (AxC 2019)</i>.","mla":"Witschen, Linus Matthias, et al. “Jump Search: A Fast Technique for the Synthesis of Approximate Circuits.” <i>Fourth Workshop on Approximate Computing (AxC 2019)</i>.","bibtex":"@article{Witschen_Ghasemzadeh Mohammadi_Artmann_Platzner, title={Jump Search: A Fast Technique for the Synthesis of Approximate Circuits}, journal={Fourth Workshop on Approximate Computing (AxC 2019)}, author={Witschen, Linus Matthias and Ghasemzadeh Mohammadi, Hassan and Artmann, Matthias and Platzner, Marco} }","short":"L.M. Witschen, H. Ghasemzadeh Mohammadi, M. Artmann, M. Platzner, Fourth Workshop on Approximate Computing (AxC 2019) (n.d.)."},"page":"2","year":"2019","publication_status":"accepted","has_accepted_license":"1","title":"Jump Search: A Fast Technique for the Synthesis of Approximate Circuits","author":[{"last_name":"Witschen","id":"49051","full_name":"Witschen, Linus Matthias","first_name":"Linus Matthias"},{"last_name":"Ghasemzadeh Mohammadi","id":"61186","full_name":"Ghasemzadeh Mohammadi, Hassan","first_name":"Hassan"},{"first_name":"Matthias","full_name":"Artmann, Matthias","last_name":"Artmann"},{"last_name":"Platzner","id":"398","full_name":"Platzner, Marco","first_name":"Marco"}],"date_created":"2020-04-25T08:02:07Z","date_updated":"2022-01-06T06:52:57Z"},{"publication":"Proceedings of the 2019 on Great Lakes Symposium on VLSI  - GLSVLSI '19","abstract":[{"lang":"eng","text":"State-of-the-art frameworks for generating approximate circuits automatically explore the search space in an iterative process - often greedily. Synthesis and verification processes are invoked in each iteration to evaluate the found solutions and to guide the search algorithm. As a result, a large number of approximate circuits is subjected to analysis - leading to long runtimes - but only a few approximate circuits might form an acceptable solution.\r\n\r\nIn this paper, we present our Jump Search (JS) method which seeks to reduce the runtime of an approximation process by reducing the number of expensive synthesis and verification steps. To reduce the runtime, JS computes impact factors for each approximation candidate in the circuit to create a selection of approximate circuits without invoking synthesis or verification processes. We denote the selection as path from which JS determines the final solution. In our experimental results, JS achieved speed-ups of up to 57x while area savings remain comparable to the reference search method, Simulated Annealing."}],"language":[{"iso":"eng"}],"keyword":["Approximate computing","design automation","parameter selection","circuit synthesis"],"year":"2019","date_created":"2019-07-08T15:13:10Z","publisher":"ACM","title":"Jump Search: A Fast Technique for the Synthesis of Approximate Circuits","type":"conference","status":"public","department":[{"_id":"78"}],"user_id":"49051","_id":"10577","project":[{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"publication_identifier":{"isbn":["9781450362528"]},"publication_status":"published","citation":{"ama":"Witschen LM, Ghasemzadeh Mohammadi H, Artmann M, Platzner M. Jump Search: A Fast Technique for the Synthesis of Approximate Circuits. In: <i>Proceedings of the 2019 on Great Lakes Symposium on VLSI  - GLSVLSI ’19</i>. New York, NY, USA: ACM; 2019. doi:<a href=\"https://doi.org/10.1145/3299874.3317998\">10.1145/3299874.3317998</a>","ieee":"L. M. Witschen, H. Ghasemzadeh Mohammadi, M. Artmann, and M. Platzner, “Jump Search: A Fast Technique for the Synthesis of Approximate Circuits,” in <i>Proceedings of the 2019 on Great Lakes Symposium on VLSI  - GLSVLSI ’19</i>, Tysons Corner, VA, USA, 2019.","chicago":"Witschen, Linus Matthias, Hassan Ghasemzadeh Mohammadi, Matthias Artmann, and Marco Platzner. “Jump Search: A Fast Technique for the Synthesis of Approximate Circuits.” In <i>Proceedings of the 2019 on Great Lakes Symposium on VLSI  - GLSVLSI ’19</i>. New York, NY, USA: ACM, 2019. <a href=\"https://doi.org/10.1145/3299874.3317998\">https://doi.org/10.1145/3299874.3317998</a>.","apa":"Witschen, L. M., Ghasemzadeh Mohammadi, H., Artmann, M., &#38; Platzner, M. (2019). Jump Search: A Fast Technique for the Synthesis of Approximate Circuits. In <i>Proceedings of the 2019 on Great Lakes Symposium on VLSI  - GLSVLSI ’19</i>. New York, NY, USA: ACM. <a href=\"https://doi.org/10.1145/3299874.3317998\">https://doi.org/10.1145/3299874.3317998</a>","mla":"Witschen, Linus Matthias, et al. “Jump Search: A Fast Technique for the Synthesis of Approximate Circuits.” <i>Proceedings of the 2019 on Great Lakes Symposium on VLSI  - GLSVLSI ’19</i>, ACM, 2019, doi:<a href=\"https://doi.org/10.1145/3299874.3317998\">10.1145/3299874.3317998</a>.","short":"L.M. Witschen, H. Ghasemzadeh Mohammadi, M. Artmann, M. Platzner, in: Proceedings of the 2019 on Great Lakes Symposium on VLSI  - GLSVLSI ’19, ACM, New York, NY, USA, 2019.","bibtex":"@inproceedings{Witschen_Ghasemzadeh Mohammadi_Artmann_Platzner_2019, place={New York, NY, USA}, title={Jump Search: A Fast Technique for the Synthesis of Approximate Circuits}, DOI={<a href=\"https://doi.org/10.1145/3299874.3317998\">10.1145/3299874.3317998</a>}, booktitle={Proceedings of the 2019 on Great Lakes Symposium on VLSI  - GLSVLSI ’19}, publisher={ACM}, author={Witschen, Linus Matthias and Ghasemzadeh Mohammadi, Hassan and Artmann, Matthias and Platzner, Marco}, year={2019} }"},"place":"New York, NY, USA","author":[{"first_name":"Linus Matthias","id":"49051","full_name":"Witschen, Linus Matthias","last_name":"Witschen"},{"first_name":"Hassan","full_name":"Ghasemzadeh Mohammadi, Hassan","id":"61186","last_name":"Ghasemzadeh Mohammadi"},{"last_name":"Artmann","full_name":"Artmann, Matthias","first_name":"Matthias"},{"first_name":"Marco","id":"398","full_name":"Platzner, Marco","last_name":"Platzner"}],"date_updated":"2022-01-06T06:50:45Z","conference":{"start_date":"2019-05-09","name":"ACM Great Lakes Symposium on VLSI (GLSVLSI)","location":"Tysons Corner, VA, USA","end_date":"2019-05-11"},"doi":"10.1145/3299874.3317998"},{"type":"preprint","publication":"Third Workshop on Approximate Computing (AxC 2018)","abstract":[{"lang":"eng","text":"Existing approaches and tools for the generation of approximate circuits often lack generality and are restricted to certain circuit types, approximation techniques, and quality assurance methods. Moreover, only few tools are publicly available. This hinders the development and evaluation of new techniques for approximating circuits and their comparison to previous approaches. In this paper, we first analyze and classify related approaches and then present CIRCA, our flexible framework for search-based approximate circuit generation. CIRCA is developed with a focus on modularity and extensibility. We present the architecture of CIRCA with its clear separation into stages and functional blocks, report on the current prototype, and show initial experiments."}],"file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":285348,"file_name":"WitschenWMAP2018.pdf","access_level":"closed","file_id":"3587","date_updated":"2018-07-20T14:13:31Z","creator":"tobias82","date_created":"2018-07-20T14:13:31Z"}],"status":"public","project":[{"_id":"12","name":"SFB 901 - Subproject B4"},{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area B","_id":"3"},{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"_id":"3586","user_id":"49051","department":[{"_id":"78"}],"ddc":["000"],"keyword":["Approximate Computing","Framework","Pareto Front","Accuracy"],"language":[{"iso":"eng"}],"file_date_updated":"2018-07-20T14:13:31Z","publication_status":"accepted","has_accepted_license":"1","year":"2018","citation":{"apa":"Witschen, L. M., Wiersema, T., Ghasemzadeh Mohammadi, H., Awais, M., &#38; Platzner, M. (n.d.). CIRCA: Towards a Modular and Extensible Framework for Approximate Circuit Generation. <i>Third Workshop on Approximate Computing (AxC 2018)</i>.","bibtex":"@article{Witschen_Wiersema_Ghasemzadeh Mohammadi_Awais_Platzner, title={CIRCA: Towards a Modular and Extensible Framework for Approximate Circuit Generation}, journal={Third Workshop on Approximate Computing (AxC 2018)}, author={Witschen, Linus Matthias and Wiersema, Tobias and Ghasemzadeh Mohammadi, Hassan and Awais, Muhammad and Platzner, Marco} }","short":"L.M. Witschen, T. Wiersema, H. Ghasemzadeh Mohammadi, M. Awais, M. Platzner, Third Workshop on Approximate Computing (AxC 2018) (n.d.).","mla":"Witschen, Linus Matthias, et al. “CIRCA: Towards a Modular and Extensible Framework for Approximate Circuit Generation.” <i>Third Workshop on Approximate Computing (AxC 2018)</i>.","ama":"Witschen LM, Wiersema T, Ghasemzadeh Mohammadi H, Awais M, Platzner M. CIRCA: Towards a Modular and Extensible Framework for Approximate Circuit Generation. <i>Third Workshop on Approximate Computing (AxC 2018)</i>.","chicago":"Witschen, Linus Matthias, Tobias Wiersema, Hassan Ghasemzadeh Mohammadi, Muhammad Awais, and Marco Platzner. “CIRCA: Towards a Modular and Extensible Framework for Approximate Circuit Generation.” <i>Third Workshop on Approximate Computing (AxC 2018)</i>, n.d.","ieee":"L. M. Witschen, T. Wiersema, H. Ghasemzadeh Mohammadi, M. Awais, and M. Platzner, “CIRCA: Towards a Modular and Extensible Framework for Approximate Circuit Generation,” <i>Third Workshop on Approximate Computing (AxC 2018)</i>. ."},"page":"6","date_updated":"2022-01-06T06:59:26Z","date_created":"2018-07-20T14:10:46Z","author":[{"last_name":"Witschen","full_name":"Witschen, Linus Matthias","id":"49051","first_name":"Linus Matthias"},{"last_name":"Wiersema","full_name":"Wiersema, Tobias","id":"3118","first_name":"Tobias"},{"last_name":"Ghasemzadeh Mohammadi","full_name":"Ghasemzadeh Mohammadi, Hassan","id":"61186","first_name":"Hassan"},{"orcid":"https://orcid.org/0000-0003-4148-2969","last_name":"Awais","id":"64665","full_name":"Awais, Muhammad","first_name":"Muhammad"},{"last_name":"Platzner","id":"398","full_name":"Platzner, Marco","first_name":"Marco"}],"title":"CIRCA: Towards a Modular and Extensible Framework for Approximate Circuit Generation"},{"doi":"10.1109/VLSI-SoC.2018.8645026","title":"An MCTS-based Framework for Synthesis of Approximate Circuits","date_created":"2019-07-10T09:21:38Z","author":[{"first_name":"Muhammad","orcid":"https://orcid.org/0000-0003-4148-2969","last_name":"Awais","id":"64665","full_name":"Awais, Muhammad"},{"first_name":"Hassan","last_name":"Ghasemzadeh Mohammadi","full_name":"Ghasemzadeh Mohammadi, Hassan","id":"61186"},{"last_name":"Platzner","full_name":"Platzner, Marco","id":"398","first_name":"Marco"}],"date_updated":"2022-01-06T06:50:46Z","page":"219-224","citation":{"bibtex":"@inproceedings{Awais_Ghasemzadeh Mohammadi_Platzner_2018, title={An MCTS-based Framework for Synthesis of Approximate Circuits}, DOI={<a href=\"https://doi.org/10.1109/VLSI-SoC.2018.8645026\">10.1109/VLSI-SoC.2018.8645026</a>}, booktitle={26th IFIP/IEEE International Conference on Very Large Scale Integration (VLSI-SoC)}, author={Awais, Muhammad and Ghasemzadeh Mohammadi, Hassan and Platzner, Marco}, year={2018}, pages={219–224} }","mla":"Awais, Muhammad, et al. “An MCTS-Based Framework for Synthesis of Approximate Circuits.” <i>26th IFIP/IEEE International Conference on Very Large Scale Integration (VLSI-SoC)</i>, 2018, pp. 219–24, doi:<a href=\"https://doi.org/10.1109/VLSI-SoC.2018.8645026\">10.1109/VLSI-SoC.2018.8645026</a>.","short":"M. Awais, H. Ghasemzadeh Mohammadi, M. Platzner, in: 26th IFIP/IEEE International Conference on Very Large Scale Integration (VLSI-SoC), 2018, pp. 219–224.","apa":"Awais, M., Ghasemzadeh Mohammadi, H., &#38; Platzner, M. (2018). An MCTS-based Framework for Synthesis of Approximate Circuits. In <i>26th IFIP/IEEE International Conference on Very Large Scale Integration (VLSI-SoC)</i> (pp. 219–224). <a href=\"https://doi.org/10.1109/VLSI-SoC.2018.8645026\">https://doi.org/10.1109/VLSI-SoC.2018.8645026</a>","ieee":"M. Awais, H. Ghasemzadeh Mohammadi, and M. Platzner, “An MCTS-based Framework for Synthesis of Approximate Circuits,” in <i>26th IFIP/IEEE International Conference on Very Large Scale Integration (VLSI-SoC)</i>, 2018, pp. 219–224.","chicago":"Awais, Muhammad, Hassan Ghasemzadeh Mohammadi, and Marco Platzner. “An MCTS-Based Framework for Synthesis of Approximate Circuits.” In <i>26th IFIP/IEEE International Conference on Very Large Scale Integration (VLSI-SoC)</i>, 219–24, 2018. <a href=\"https://doi.org/10.1109/VLSI-SoC.2018.8645026\">https://doi.org/10.1109/VLSI-SoC.2018.8645026</a>.","ama":"Awais M, Ghasemzadeh Mohammadi H, Platzner M. An MCTS-based Framework for Synthesis of Approximate Circuits. In: <i>26th IFIP/IEEE International Conference on Very Large Scale Integration (VLSI-SoC)</i>. ; 2018:219-224. doi:<a href=\"https://doi.org/10.1109/VLSI-SoC.2018.8645026\">10.1109/VLSI-SoC.2018.8645026</a>"},"year":"2018","language":[{"iso":"eng"}],"keyword":["Approximate computing","High-level synthesis","Accuracy","Monte-Carlo tree search","Circuit simulation"],"department":[{"_id":"78"}],"user_id":"64665","_id":"10598","status":"public","abstract":[{"lang":"eng","text":"Approximate computing has become a very popular design\r\nstrategy that exploits error resilient computations to achieve higher\r\nperformance and energy efficiency. Automated synthesis of approximate\r\ncircuits is performed via functional approximation, in which various\r\nparts of the target circuit are extensively examined with a library\r\nof approximate components/transformations to trade off the functional\r\naccuracy and computational budget (i.e., power). However, as the number\r\nof possible approximate transformations increases, traditional search\r\ntechniques suffer from a combinatorial explosion due to the large\r\nbranching factor. In this work, we present a comprehensive framework\r\nfor automated synthesis of approximate circuits from either structural\r\nor behavioral descriptions. We adapt the Monte Carlo Tree Search\r\n(MCTS), as a stochastic search technique, to deal with the large design\r\nspace exploration, which enables a broader range of potential possible\r\napproximations through lightweight random simulations. The proposed\r\nframework is able to recognize the design Pareto set even with low\r\ncomputational budgets. Experimental results highlight the capabilities of\r\nthe proposed synthesis framework by resulting in up to 61.69% energy\r\nsaving while maintaining the predefined quality constraints."}],"publication":"26th IFIP/IEEE International Conference on Very Large Scale Integration (VLSI-SoC)","type":"conference"},{"citation":{"chicago":"Jentzsch, Felix Paul. <i>Enforcing IP Core Connection Properties with Verifiable Security Monitors</i>. Universität Paderborn, 2018.","ieee":"F. P. Jentzsch, <i>Enforcing IP Core Connection Properties with Verifiable Security Monitors</i>. Universität Paderborn, 2018.","ama":"Jentzsch FP. <i>Enforcing IP Core Connection Properties with Verifiable Security Monitors</i>. Universität Paderborn; 2018.","apa":"Jentzsch, F. P. (2018). <i>Enforcing IP Core Connection Properties with Verifiable Security Monitors</i>. Universität Paderborn.","bibtex":"@book{Jentzsch_2018, title={Enforcing IP Core Connection Properties with Verifiable Security Monitors}, publisher={Universität Paderborn}, author={Jentzsch, Felix Paul}, year={2018} }","short":"F.P. Jentzsch, Enforcing IP Core Connection Properties with Verifiable Security Monitors, Universität Paderborn, 2018.","mla":"Jentzsch, Felix Paul. <i>Enforcing IP Core Connection Properties with Verifiable Security Monitors</i>. Universität Paderborn, 2018."},"year":"2018","author":[{"full_name":"Jentzsch, Felix Paul","last_name":"Jentzsch","first_name":"Felix Paul"}],"supervisor":[{"full_name":"Wiersema, Tobias","id":"3118","last_name":"Wiersema","first_name":"Tobias"}],"date_created":"2018-01-15T16:48:05Z","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:50:54Z","title":"Enforcing IP Core Connection Properties with Verifiable Security Monitors","type":"bachelorsthesis","status":"public","user_id":"477","department":[{"_id":"78"}],"project":[{"_id":"12","name":"SFB 901 - Subproject B4"},{"name":"SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - Project Area B"}],"_id":"1097","language":[{"iso":"eng"}],"keyword":["Approximate Computing","Proof-Carrying Hardware","Formal Verification"]},{"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"]},"citation":{"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} }","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>","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>.","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>.","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":{"name":"Platform for Advanced Scientific Computing Conference (PASC)","start_date":"2018-07-02","end_date":"2018-07-04","location":"Basel, Switzerland"},"author":[{"id":"24135","full_name":"Lass, Michael","last_name":"Lass","orcid":"0000-0002-5708-7632","first_name":"Michael"},{"last_name":"Mohr","full_name":"Mohr, Stephan","first_name":"Stephan"},{"first_name":"Hendrik","full_name":"Wiebeler, Hendrik","last_name":"Wiebeler"},{"first_name":"Thomas","last_name":"Kühne","id":"49079","full_name":"Kühne, Thomas"},{"last_name":"Plessl","orcid":"0000-0001-5728-9982","full_name":"Plessl, Christian","id":"16153","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"}]},{"publisher":"Springer","date_updated":"2023-09-26T13:30:22Z","author":[{"first_name":"Christian","id":"16153","full_name":"Plessl, Christian","orcid":"0000-0001-5728-9982","last_name":"Plessl"},{"first_name":"Marco","full_name":"Platzner, Marco","id":"398","last_name":"Platzner"},{"first_name":"Peter J.","full_name":"Schreier, Peter J.","last_name":"Schreier"}],"date_created":"2018-03-23T13:58:34Z","title":"Aktuelles Schlagwort: Approximate Computing","doi":"10.1007/s00287-015-0911-z","quality_controlled":"1","issue":"5","year":"2015","citation":{"bibtex":"@article{Plessl_Platzner_Schreier_2015, title={Aktuelles Schlagwort: Approximate Computing}, DOI={<a href=\"https://doi.org/10.1007/s00287-015-0911-z\">10.1007/s00287-015-0911-z</a>}, number={5}, journal={Informatik Spektrum}, publisher={Springer}, author={Plessl, Christian and Platzner, Marco and Schreier, Peter J.}, year={2015}, pages={396–399} }","mla":"Plessl, Christian, et al. “Aktuelles Schlagwort: Approximate Computing.” <i>Informatik Spektrum</i>, no. 5, Springer, 2015, pp. 396–99, doi:<a href=\"https://doi.org/10.1007/s00287-015-0911-z\">10.1007/s00287-015-0911-z</a>.","short":"C. Plessl, M. Platzner, P.J. Schreier, Informatik Spektrum (2015) 396–399.","apa":"Plessl, C., Platzner, M., &#38; Schreier, P. J. (2015). Aktuelles Schlagwort: Approximate Computing. <i>Informatik Spektrum</i>, <i>5</i>, 396–399. <a href=\"https://doi.org/10.1007/s00287-015-0911-z\">https://doi.org/10.1007/s00287-015-0911-z</a>","ama":"Plessl C, Platzner M, Schreier PJ. Aktuelles Schlagwort: Approximate Computing. <i>Informatik Spektrum</i>. 2015;(5):396-399. doi:<a href=\"https://doi.org/10.1007/s00287-015-0911-z\">10.1007/s00287-015-0911-z</a>","ieee":"C. Plessl, M. Platzner, and P. J. Schreier, “Aktuelles Schlagwort: Approximate Computing,” <i>Informatik Spektrum</i>, no. 5, pp. 396–399, 2015, doi: <a href=\"https://doi.org/10.1007/s00287-015-0911-z\">10.1007/s00287-015-0911-z</a>.","chicago":"Plessl, Christian, Marco Platzner, and Peter J. Schreier. “Aktuelles Schlagwort: Approximate Computing.” <i>Informatik Spektrum</i>, no. 5 (2015): 396–99. <a href=\"https://doi.org/10.1007/s00287-015-0911-z\">https://doi.org/10.1007/s00287-015-0911-z</a>."},"page":"396-399","_id":"1768","user_id":"15278","department":[{"_id":"27"},{"_id":"518"},{"_id":"263"},{"_id":"78"}],"keyword":["approximate computing","survey"],"language":[{"iso":"eng"}],"type":"journal_article","publication":"Informatik Spektrum","status":"public"}]