{"id":{"repo_id":"heid-thes","oai_identifier":"oai:archiv.ub.uni-heidelberg.de:38593"},"canonical_url":"https://search.dev.ndltd.org/etd/heid-thes/oai:archiv.ub.uni-heidelberg.de:38593","repository":{"repo_id":"heid-thes","name":"Universität Heidelberg ; Thes","base_url":"http://archiv.ub.uni-heidelberg.de/volltextserver/cgi/oai2"},"display":{"title":"On the Performance of Butterfly Approximations on the Graphcore IPU","abstract":"Over the past decade, the most commonly used hardware for accelerated computing has been the GPU, as it can achieve higher throughput than a CPU for a similar power consumption. In recent years, due to advances in machine learning, a number of custom parallel processing units have been released, out of which, the Intelligence Processing Unit (IPU) is based on the world's first graph toolchain designed for machine intelligence. This thesis investigates whether the IPU can act as a replacement for a GPU with similar transistor size, power consumption and release date for certain workloads. To achieve this, a performance baseline is first established with various benchmarks and characterized using a range of profiling tools. The results and the target group of the IPU lead us to investigate machine learning workloads with a focus on Butterfly Approximations for sparsification. It is found that the IPU can outperform a comparable GPU by up to a factor of 4.5, with the main bottleneck being limited memory.","abstract_html":"Over the past decade, the most commonly used hardware for accelerated computing has been the GPU, as it can achieve higher throughput than a CPU for a similar power consumption. In recent years, due to advances in machine learning, a number of custom parallel processing units have been released, out of which, the Intelligence Processing Unit (IPU) is based on the world's first graph toolchain designed for machine intelligence. This thesis investigates whether the IPU can act as a replacement for a GPU with similar transistor size, power consumption and release date for certain workloads. To achieve this, a performance baseline is first established with various benchmarks and characterized using a range of profiling tools. The results and the target group of the IPU lead us to investigate machine learning workloads with a focus on Butterfly Approximations for sparsification. It is found that the IPU can outperform a comparable GPU by up to a factor of 4.5, with the main bottleneck being limited memory.","abstract_has_math":false,"creators":["Alles, Christian"],"institution":"Universität Heidelberg","degree_name":null,"degree_level":"master","degree_discipline":null,"degree_department":null,"school":null,"contributors":["Fröning, Holger"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2023,"date_issued":"2023","date_published":"2023","updated_at":"2026-07-24T02:31:02Z","subjects":[],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://www.ub.uni-heidelberg.de/archiv/38593","outbound_label":"Repository record","outbound_source":"source_url"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Fröning, Holger"]},{"key":"dc:creator","label":"Author","values":["Alles, Christian"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:publisher","label":"Institution","values":["Universitätsbibliothek Heidelberg"]},{"key":"dc:type","label":"Dc Type","values":["masterThesis"]},{"key":"thesis:degree_level","label":"Degree Level","values":["master"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["Universität Heidelberg"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["Over the past decade, the most commonly used hardware for accelerated computing has been the GPU, as it can achieve higher throughput than a CPU for a similar power consumption. In recent years, due to advances in machine learning, a number of custom parallel processing units have been released, out of which, the Intelligence Processing Unit (IPU) is based on the world's first graph toolchain designed for machine intelligence. This thesis investigates whether the IPU can act as a replacement for a GPU with similar transistor size, power consumption and release date for certain workloads. To achieve this, a performance baseline is first established with various benchmarks and characterized using a range of profiling tools. The results and the target group of the IPU lead us to investigate machine learning workloads with a focus on Butterfly Approximations for sparsification. It is found that the IPU can outperform a comparable GPU by up to a factor of 4.5, with the main bottleneck being limited memory."]},{"key":"dc:format.medium","label":"Dc Format Medium","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["On the Performance of Butterfly Approximations on the Graphcore IPU"]}]}],"canonical_facts":{"dc:contributor":["Fröning, Holger"],"dc:creator":["Alles, Christian"],"dc:description.abstract":["Over the past decade, the most commonly used hardware for accelerated computing has been the GPU, as it can achieve higher throughput than a CPU for a similar power consumption. In recent years, due to advances in machine learning, a number of custom parallel processing units have been released, out of which, the Intelligence Processing Unit (IPU) is based on the world's first graph toolchain designed for machine intelligence. This thesis investigates whether the IPU can act as a replacement for a GPU with similar transistor size, power consumption and release date for certain workloads. To achieve this, a performance baseline is first established with various benchmarks and characterized using a range of profiling tools. The results and the target group of the IPU lead us to investigate machine learning workloads with a focus on Butterfly Approximations for sparsification. It is found that the IPU can outperform a comparable GPU by up to a factor of 4.5, with the main bottleneck being limited memory."],"dc:format.medium":["application/pdf"],"dc:publisher":["Universitätsbibliothek Heidelberg"],"dc:title":["On the Performance of Butterfly Approximations on the Graphcore IPU"],"dc:type":["masterThesis"],"thesis:degree_level":["master"],"thesis:institution_name":["Universität Heidelberg"]},"updated_at":"2026-07-24T02:31:02Z"}