{"created":"2025-01-18T22:57:17.214582+00:00","updated":"2025-01-22T18:52:29.967801+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00026750","sets":["1164:2036:2037:2038"]},"path":["2038"],"owner":"1","recid":"26750","title":["CAFE router１0：障害物を含む領域における連結度を考慮した複線配線手法"],"pubdate":{"attribute_name":"公開日","attribute_value":"2008-11-10"},"_buckets":{"deposit":"e233fe47-3f98-464b-8025-4f1ce482357b"},"_deposit":{"id":"26750","pid":{"type":"depid","value":"26750","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"CAFE router１0：障害物を含む領域における連結度を考慮した複線配線手法","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"CAFE router１0：障害物を含む領域における連結度を考慮した複線配線手法"},{"subitem_title":"CAFE router : A Fast Connectivity Aware Multi-net Routing Algorithm for Routing Grid with Obstacles","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2008-11-10","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"東京工業大学大学院理工学研究科集積システム専攻"},{"subitem_text_value":"東京工業大学大学院理工学研究科集積システム専攻"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Department of Communications and Integrated Systems, Tokyo Institute of Technology","subitem_text_language":"en"},{"subitem_text_value":"Department of Communications and Integrated Systems, Tokyo Institute of Technology","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/26750/files/IPSJ-SLDM08137013.pdf"},"date":[{"dateType":"Available","dateValue":"2010-11-10"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-SLDM08137013.pdf","filesize":[{"value":"1.3 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":"10"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"5bed3301-68ff-4c97-9b9e-b5272f32a35e","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2008 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"小平, 行秀"},{"creatorName":"高橋, 篤司"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Yukihide, Kohira","creatorNameLang":"en"},{"creatorName":"Atsushi, Takahashi","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":"近年の回路動作の高速化に伴い，複数の信号線のそれぞれに対して要求される遅延量を高い精度で実現することが必要となっている．プリント基板の配線設計では，要求された遅延値に満たない信号は配線を迂回させて配線遅延量を増大させることで遅延値を調整するのが一般的である．本稿では一層配線を想定し，障害物領域を含む領域に目標の配線長がそれぞれ指定された複数の接続要求が与えられたとき，全ての信号線が交差なく，目標の配線長との誤差をできるだけ小さい配線経路を得る問題に対して，未配線領域での接続要求の連結度を考慮することで配線実現性を保障しつつ，配線を一点ずつ逐次的に延長する手法 CAFE router を提案する．計算機実験では，提案したCAFE router は高速に比較的目標の配線長との誤差が小さい配線が得られた．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Due to the increase of operation frequency in recent LSI systems, signal propagation delays are required to achieve specifications with very high accuracy. In order to meet the specifications, the route of a net often needs to be detoured in order to increase the routing delay of the net. In this paper, we propose CAFE router which is a fast algorithm to obtain routes of nets. CAFE router determines the route of a net iteratively holding the connectivity of all nets in the routing area so that the difference between wire length and target wire length of each net become small. Experiments show that CAFE router obtains the routes of nets in short computation time and the difference between wire length obtained by CAFE router and target wire length of each net is small. ","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"78","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告システムLSI設計技術（SLDM）"}],"bibliographicPageStart":"73","bibliographicIssueDates":{"bibliographicIssueDate":"2008-11-10","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"111(2008-SLDM-137)","bibliographicVolumeNumber":"2008"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"id":26750,"links":{}}