{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00027917","sets":["1164:2036:2109:2112"]},"path":["2112"],"owner":"1","recid":"27917","title":["Minimum Spanning Treeに基づいた配置改善手法"],"pubdate":{"attribute_name":"公開日","attribute_value":"1995-07-20"},"_buckets":{"deposit":"a8365d53-a1c9-4941-a0b1-0b75be74db3d"},"_deposit":{"id":"27917","pid":{"type":"depid","value":"27917","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"Minimum Spanning Treeに基づいた配置改善手法","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Minimum Spanning Treeに基づいた配置改善手法"},{"subitem_title":"A detail placement technique improving wire length estimated by Minimum Spanning Tree","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"1995-07-20","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":"Fujitsu Laboratories Ltd.","subitem_text_language":"en"},{"subitem_text_value":"Fujitsu Laboratories Ltd.","subitem_text_language":"en"},{"subitem_text_value":"Fujitsu Laboratories Ltd.","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/27917/files/IPSJ-SLDM95076003.pdf"},"date":[{"dateType":"Available","dateValue":"1997-07-20"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-SLDM95076003.pdf","filesize":[{"value":"529.1 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"10"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"c0ac7292-8094-4ee2-b07c-bcb5d8b1e12f","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 1995 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":"Izumi, Nitta","creatorNameLang":"en"},{"creatorName":"Toshiyuki, Shibuya","creatorNameLang":"en"},{"creatorName":"Kaoru, Kawamura","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA11451459","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":"本論文では，Minimum　Spanning　Tree　(S)の配線長を改善する配置改善手法であるMinimum　Spanning　Tree　Reduction　Pairwise　Interchange手法(RP)について述べる．MRPI法はMincutによる初期配置の後に行なわれ，セルのペア交換によってMSTの配線長を改善する．MRPI法は，各セルについて配線長を改善する領域をimprovement　areaと定義し，交換を行なうセルの探索をimprovement　areaを用いて行なうことにより，改善が行なわれるセルの組合せを高速かつ効率的に検出する手法である．SOGゲートアレイの実データを用いて実験を行ない，配線長の改善率，処理時間を評価し，有効性を示した．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"In this paper, we present a Minimum Spanning Tree Reduction Pairwise Interchange (MRPI) method as an improvement placement after min-cut partitioning. The MRPI method improves wire length of Minimum Spanning Tree (MST) by pairwise interchanging of cells. The idea of the improvement area is introduced as an idea of searching for the cell pairs to reduce wire length of MST. Good experimental results have been observed for wire length and excution time.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"24","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告システムLSI設計技術（SLDM）"}],"bibliographicPageStart":"17","bibliographicIssueDates":{"bibliographicIssueDate":"1995-07-20","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"72(1995-SLDM-076)","bibliographicVolumeNumber":"1995"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"updated":"2025-01-22T18:17:54.109300+00:00","created":"2025-01-18T22:58:09.296076+00:00","links":{},"id":27917}