Presentation 2017-11-08
Max Length and Length Difference Minimization for Set Pair Routing Problem with ILP
Shutaro Hara, Kunihiro Fujiyoshi,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Set pair routing is the problem to minimize the maximum difference of paths (length difference) that one to one connected with separated paths between several source terminals and sink terminals on a grid graph with minimized maximum wire length. In this paper, we propose a method for minimizing the length difference with two stages. We formulate this method into integer linear programming and perform computer experiment. As a result, our method is faster than the integer linear programming with single stage.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) set pair routing problem / maximum wire length / length difference reduction / integer linear programming
Paper # VLD2017-60,DC2017-66
Date of Issue 2017-10-30 (VLD, DC)

Conference Information
Committee VLD / DC / CPSY / RECONF / CPM / ICD / IE / IPSJ-SLDM / IPSJ-EMB / IPSJ-ARC
Conference Date 2017/11/6(3days)
Place (in Japanese) (See Japanese page)
Place (in English) Kumamoto-Kenminkouryukan Parea
Topics (in Japanese) (See Japanese page)
Topics (in English) Design Gaia 2017 -New Field of VLSI Design-
Chair Hiroyuki Ochi(Ritsumeikan Univ.) / Michiko Inoue(NAIST) / Koji Nakano(Hiroshima Univ.) / Masato Motomura(Hokkaido Univ.) / Fumihiko Hirose(Yamagata Univ.) / Hideto Hidaka(Renesas) / Takayuki Hamamoto(Tokyo Univ. of Science) / Kiyoharu Hamaguchi(Shimane Univ.) / 渡辺 晴美(東海大) / Masahiro Goshima(NII)
Vice Chair Noriyuki Minegishi(Mitsubishi Electric) / Satoshi Fukumoto(Tokyo Metropolitan Univ.) / Hidetsugu Irie(Univ. of Tokyo) / Takashi Miyoshi(Fujitsu) / Yuichiro Shibata(Nagasaki Univ.) / Kentaro Sano(Tohoku Univ.) / Mayumi Takeyama(Kitami Inst. of Tech.) / Makoto Nagata(Kobe Univ.) / Kazuya Kodama(NII) / Hideaki Kimata(NTT)
Secretary Noriyuki Minegishi(Hiroshima City Univ.) / Satoshi Fukumoto(NTT) / Hidetsugu Irie(Kyoto Sangyo Univ.) / Takashi Miyoshi(Tokyo Inst. of Tech.) / Yuichiro Shibata(Utsunomiya Univ.) / Kentaro Sano(Hokkaido Univ.) / Mayumi Takeyama(Hiroshima City Univ.) / Makoto Nagata(e-trees.Japan) / Kazuya Kodama(Nihon Univ.) / Hideaki Kimata(Toyohashi Univ. of Tech.) / (Univ. of Tokyo) / (Panasonic) / (Nagoya Univ.)
Assistant / Masayuki Arai(Nihon Univ.) / Yasuaki Ito(Hiroshima Univ.) / Tomoaki Tsumura(Nagoya Inst. of Tech.) / Yuuki Kobayashi(NEC) / Hiroki Nakahara(Tokyo Inst. of Tech.) / Yuichi Akage(NTT) / Masanori Natsui(Tohoku Univ.) / Masatoshi Tsuge(Socionext) / Hiroyuki Ito(Tokyo Inst. of Tech.) / Pham Konkuha(Univ. of Electro-Comm.) / Yasutaka Matsuo(NHK) / Kazuya Hayase(NTT)

Paper Information
Registration To Technical Committee on VLSI Design Technologies / Technical Committee on Dependable Computing / Technical Committee on Computer Systems / Technical Committee on Reconfigurable Systems / Technical Committee on Component Parts and Materials / Technical Committee on Integrated Circuits and Devices / Technical Committee on Image Engineering / Special Interest Group on System and LSI Design Methodology / Special Interest Group on Embedded Systems / Special Interest Group on System Architecture
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Max Length and Length Difference Minimization for Set Pair Routing Problem with ILP
Sub Title (in English)
Keyword(1) set pair routing problem
Keyword(2) maximum wire length
Keyword(3) length difference reduction
Keyword(4) integer linear programming
1st Author's Name Shutaro Hara
1st Author's Affiliation Tokyo University of Agriculture and Technology(TUAT)
2nd Author's Name Kunihiro Fujiyoshi
2nd Author's Affiliation Tokyo University of Agriculture and Technology(TUAT)
Date 2017-11-08
Paper # VLD2017-60,DC2017-66
Volume (vol) vol.117
Number (no) VLD-273,DC-274
Page pp.pp.241-246(VLD), pp.241-246(DC),
#Pages 6
Date of Issue 2017-10-30 (VLD, DC)