{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00030836","sets":["1164:2386:2457:2459"]},"path":["2459"],"owner":"1","recid":"30836","title":["再構成アレイ上の高速ソーティングアルゴリズム"],"pubdate":{"attribute_name":"公開日","attribute_value":"1990-12-12"},"_buckets":{"deposit":"3cee35b5-1c46-4781-905a-2541e479bd0f"},"_deposit":{"id":"30836","pid":{"type":"depid","value":"30836","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"再構成アレイ上の高速ソーティングアルゴリズム","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"再構成アレイ上の高速ソーティングアルゴリズム"},{"subitem_title":"A Fast Sorting Algorithm on a Reconfigurable Array","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"1990-12-12","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"大阪大学基礎工学部"},{"subitem_text_value":"大阪大学基礎工学部"},{"subitem_text_value":"大阪大学基礎工学部"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Faculty of Engineering Science, Osaka University","subitem_text_language":"en"},{"subitem_text_value":"Faculty of Engineering Science, Osaka University","subitem_text_language":"en"},{"subitem_text_value":"Faculty of Engineering Science, Osaka University","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"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/30836/files/IPSJ-PRO90027009.pdf"},"date":[{"dateType":"Available","dateValue":"1992-12-12"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-PRO90027009.pdf","filesize":[{"value":"1.1 MB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"15"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"8305d8a6-4bf1-485a-b35e-61f69b5409e2","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 1990 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"中野, 浩嗣"},{"creatorName":"増澤利光"},{"creatorName":"都倉, 信樹"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Koji, Nakano","creatorNameLang":"en"},{"creatorName":"Toshimits, Masuzawa","creatorNameLang":"en"},{"creatorName":"Nobuki, Tokura","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN10485570","subitem_source_identifier_type":"NCID"}]},"item_4_textarea_12":{"attribute_name":"Notice","attribute_value_mlt":[{"subitem_textarea_value":"SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc."}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_18gh","resourcetype":"technical report"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"再構成バスとは形状が動的に変化することのできるバスである。格子状に並べたプロセッサを再構成バスで接続したプロセッサアレイを再構成アレイという。本論文では，プロセッサ数N　×　N　log^<（）>Nの再構成アレイ上でN個の要素のソーティングをO（）時間で行うアルゴリズムを示す。","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"A bus whose configuration can be dynamically changed is called a reconfigurable bus. A reconfigurable array is a processor array on which processors arranged to a 2-dimensional grid and connected by reconfigurable buses. We show an algorithm which sorts N elements in O(T) time on a reconfigurable array of size N ×N log^<(T)>N.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"78","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告プログラミング（PRO）"}],"bibliographicPageStart":"71","bibliographicIssueDates":{"bibliographicIssueDate":"1990-12-12","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"101(1990-PRO-027)","bibliographicVolumeNumber":"1990"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"updated":"2025-01-22T16:53:49.735351+00:00","created":"2025-01-18T23:00:19.808395+00:00","links":{},"id":30836}