{"id":220311,"updated":"2025-01-19T14:36:30.455664+00:00","links":{},"created":"2025-01-19T01:20:21.395675+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00220311","sets":["934:1119:10960:10994"]},"path":["10994"],"owner":"44499","recid":"220311","title":["An Open-source FPGA Library for Data Sorting"],"pubdate":{"attribute_name":"公開日","attribute_value":"2022-09-27"},"_buckets":{"deposit":"81d636bf-4902-4ed8-9c49-392873e89118"},"_deposit":{"id":"220311","pid":{"type":"depid","value":"220311","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"An Open-source FPGA Library for Data Sorting","author_link":["576013","576014","576016","576018","576022","576021","576020","576017","576015","576019"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"An Open-source FPGA Library for Data Sorting"},{"subitem_title":"An Open-source FPGA Library for Data Sorting","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"FPGA, Sorting, Intel FPGA SDK for OpenCL","subitem_subject_scheme":"Other"}]},"item_type_id":"3","publish_date":"2022-09-27","item_3_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"Center for Computational Sciences, University of Tsukuba"},{"subitem_text_value":"Rakuten, Inc."},{"subitem_text_value":"Center for Computational Sciences, University of Tsukuba"},{"subitem_text_value":"Center for Computational Sciences, University of Tsukuba"},{"subitem_text_value":"Center for Computational Sciences, University of Tsukuba"}]},"item_3_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Center for Computational Sciences, University of Tsukuba","subitem_text_language":"en"},{"subitem_text_value":"Rakuten, Inc.","subitem_text_language":"en"},{"subitem_text_value":"Center for Computational Sciences, University of Tsukuba","subitem_text_language":"en"},{"subitem_text_value":"Center for Computational Sciences, University of Tsukuba","subitem_text_language":"en"},{"subitem_text_value":"Center for Computational Sciences, University of Tsukuba","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"item_publisher":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/220311/files/IPSJ-TACS1502004.pdf","label":"IPSJ-TACS1502004.pdf"},"date":[{"dateType":"Available","dateValue":"2024-09-27"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-TACS1502004.pdf","filesize":[{"value":"2.1 MB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"0","billingrole":"5"},{"tax":["include_tax"],"price":"0","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"16"},{"tax":["include_tax"],"price":"0","billingrole":"11"},{"tax":["include_tax"],"price":"0","billingrole":"14"},{"tax":["include_tax"],"price":"0","billingrole":"15"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"e31a492c-7832-429f-a8e9-d505bad3f6a4","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2022 by the Information Processing Society of Japan"}]},"item_3_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Ryohei, Kobayashi"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Kento, Miura"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Norihisa, Fujita"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Taisuke, Boku"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Toshiyuki, Amagasa"}],"nameIdentifiers":[{}]}]},"item_3_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Ryohei, Kobayashi","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Kento, Miura","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Norihisa, Fujita","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Taisuke, Boku","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Toshiyuki, Amagasa","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_3_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA11833852","subitem_source_identifier_type":"NCID"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_6501","resourcetype":"journal article"}]},"item_3_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1882-7829","subitem_source_identifier_type":"ISSN"}]},"item_3_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"Field-programmable gate arrays (FPGAs) have garnered significant interest in research on high-performance computing because their flexibility enables the building of application-specific computation pipelines and data supply systems. In addition to the flexibility, toolchains for the development of FPGAs in OpenCL have been developed and offered by FPGA vendors that reduce the programming effort required. However, the high level of abstraction in the OpenCL-based development approach is a disadvantage, making it difficult to perform fine-grained performance tuning. In this paper, we present one of the methodologies to achieve both the reduction of FPGA programming cost and the provision of high performance. We focus on data sorting, which is a basic arithmetic operation, and we introduce a sorting library that can be used with the OpenCL programming model for FPGAs. Our sorting library has so far only supported integer data, but in this paper, we propose a new method that supports floating-point data. It consumes at least twice as many hardware resources compared to the merge sort restructured for the OpenCL programming model for FPGAs. However, its operating frequency is 1.08x higher and its sorting throughput is three orders of magnitude greater than the baseline. The source code of our sorting library is open source, and it can be used by application developers around the world.\n------------------------------\nThis is a preprint of an article intended for publication Journal of\nInformation Processing(JIP). This preprint should not be cited. This\narticle should be cited as: Journal of Information Processing Vol.30(2022) (online)\n------------------------------","subitem_description_type":"Other"}]},"item_3_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Field-programmable gate arrays (FPGAs) have garnered significant interest in research on high-performance computing because their flexibility enables the building of application-specific computation pipelines and data supply systems. In addition to the flexibility, toolchains for the development of FPGAs in OpenCL have been developed and offered by FPGA vendors that reduce the programming effort required. However, the high level of abstraction in the OpenCL-based development approach is a disadvantage, making it difficult to perform fine-grained performance tuning. In this paper, we present one of the methodologies to achieve both the reduction of FPGA programming cost and the provision of high performance. We focus on data sorting, which is a basic arithmetic operation, and we introduce a sorting library that can be used with the OpenCL programming model for FPGAs. Our sorting library has so far only supported integer data, but in this paper, we propose a new method that supports floating-point data. It consumes at least twice as many hardware resources compared to the merge sort restructured for the OpenCL programming model for FPGAs. However, its operating frequency is 1.08x higher and its sorting throughput is three orders of magnitude greater than the baseline. The source code of our sorting library is open source, and it can be used by application developers around the world.\n------------------------------\nThis is a preprint of an article intended for publication Journal of\nInformation Processing(JIP). This preprint should not be cited. This\narticle should be cited as: Journal of Information Processing Vol.30(2022) (online)\n------------------------------","subitem_description_type":"Other"}]},"item_3_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌コンピューティングシステム（ACS）"}],"bibliographicIssueDates":{"bibliographicIssueDate":"2022-09-27","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"2","bibliographicVolumeNumber":"15"}]},"relation_version_is_last":true,"weko_creator_id":"44499"}}