{"created":"2025-01-18T23:01:45.866015+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00032747","sets":["1164:2592:2721:2729"]},"path":["2729"],"owner":"1","recid":"32747","title":["ボロノイ線図を用いたLSI設計における一割当アルゴリズム"],"pubdate":{"attribute_name":"公開日","attribute_value":"1989-01-25"},"_buckets":{"deposit":"49451ba5-2ced-4362-97fc-5a0b88716736"},"_deposit":{"id":"32747","pid":{"type":"depid","value":"32747","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"ボロノイ線図を用いたLSI設計における一割当アルゴリズム","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"ボロノイ線図を用いたLSI設計における一割当アルゴリズム"},{"subitem_title":"An Assignment Algorithm in VLSI Layout Design Using Voronoi Diagram","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"1989-01-25","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"日本電気（株）C&Cシステム研究所"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"C&C Systems Research Labs, NEC Corp.","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/32747/files/IPSJ-AL88005020.pdf"},"date":[{"dateType":"Available","dateValue":"1991-01-25"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL88005020.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":"9"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"aba0d16e-d27a-4f6f-8358-dba40174aa89","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 1989 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"枝廣, 正人"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Masato, Edahiro","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN1009593X","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":"本論文では、LSI設計におけるドライバーフリップフロップ割当て問題（DFA問題）に対する発見的アルゴリズムを提案する。DFA問題は、LSI特性向上、チップ面積削減のために重要である。DFA問題に対しては最小重み最大マッチング法を用いて解く方法が一般的であるが、最大マッチングの最適解が問題の最適解にならない場合がある、時間がかかる、などの欠点がある。本論文において提案するアルゴリズムにおいてはボロノイ線図を用いて最小森を求めた後、最短経路探索を繰返して解の改善を行なうことにより実行可能解を求めている。計算機実験の結果、1000点程度の問題を1分以内で解くことができることが確認された(NEC EWS4800/10)。","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"This paper presents a new algorithm for the driver-flip-flop reassignment problem after the placement of the semi-custom layout design. This algorithm, by using the Voronoi diagram, is quite efficient and gives a better solution than the existing techniques. The efficiency and quality of the solution are shown in experimental results.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"154","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告アルゴリズム（AL）"}],"bibliographicPageStart":"147","bibliographicIssueDates":{"bibliographicIssueDate":"1989-01-25","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"8(1988-AL-005)","bibliographicVolumeNumber":"1989"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"id":32747,"updated":"2025-01-22T16:02:44.766494+00:00","links":{}}