Information: Join today and make your research activities more affordable! Technical workshop participation fees and annual registration fees are available at member rates.
Notice: [Important] Announcement of Changes to Registration Fee Payment and Manuscript Upload Procedures for IEICE Technical Meetings
IEICE Technical Committee Submission System
Conference Paper's Information		 Online Proceedings
[Sign in]
Tech. Rep. Archives
 Go Top Page Go Previous   [Japanese] / [English] 

Paper Abstract and Keywords
Presentation 2010-12-01 13:15
Adjacent Insertion and Its Effectiveness in Code-Based 3-D Placement
Shin Uesugi, Mineo Kaneko (JAIST) VLD2010-77 DC2010-44
Abstract (in Japanese) (See Japanese page) 
(in English) Three Dimensional (3D) cuboid placement can be considered as a mathematical background of several practical problems such as task scheduling problem for dynamically reconfigurable VLSIs. One typical approach to this 3D placement is the combination of a coding method of placement and a stochastic search method such as Simulated Annealing (SA). Being inspired by the success of Sequence Pair (SP) or Ordered-Tree (O-Tree) in two-dimensional rectangular placement, Sequence Quintuple code, which uses five sequences of cuboid names, and Double-Tree and Seqence (DTS), which uses two trees and one sequence, have been proposed. However, when those methods are combined with SA search, their convergence to solutions of good quality is not so fine as SP and O-tree in 2D placement. In this report, we focus on a kind of redundancy that SQ coding has, which may generate worthless neighbor solutions with a high probability. So we try to improve the convergence to a good solution by suppressing those worthless neighbor solutions. To this end, we will introduce a novel move operation named ``adjacent insertion'' into SQ framework, which is based on the concept that, in any proper placement, every cuboid is expected to share its border with other cuboid. Finally, our proposed method is evaluated through computer experiments.
Keyword (in Japanese) (See Japanese page) 
(in English) 3-D placement / simulated annealing (SA) algorithm / adjacent insertion / computer experiment / / / /  
Reference Info. IEICE Tech. Rep., vol. 110, no. 316, VLD2010-77, pp. 149-154, Nov. 2010.
Paper # VLD2010-77 
Date of Issue 2010-11-22 (VLD, DC) 
ISSN Print edition: ISSN 0913-5685    Online edition: ISSN 2432-6380
Copyright
and
reproduction		 All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)
Download PDF VLD2010-77 DC2010-44

Conference Information
Committee VLD DC IPSJ-SLDM CPSY RECONF ICD CPM  
Conference Date 2010-11-29 - 2010-12-01 
Place (in Japanese) (See Japanese page) 
Place (in English) Kyushu University 
Topics (in Japanese) (See Japanese page) 
Topics (in English) Design Gaia 2010 ―New Field of VLSI Design― 
Paper Information
Registration To VLD 
Conference Code 2010-11-VLD-DC-SLDM-CPSY-RECONF-ICD-CPM 
Language Japanese 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) Adjacent Insertion and Its Effectiveness in Code-Based 3-D Placement 
Sub Title (in English)  
Keyword(1) 3-D placement  
Keyword(2) simulated annealing (SA) algorithm  
Keyword(3) adjacent insertion  
Keyword(4) computer experiment  
Keyword(5)  
Keyword(6)  
Keyword(7)  
Keyword(8)  
1st Author's Name Shin Uesugi  
1st Author's Affiliation Japan Advanced Institute of Science and Technology (JAIST)
2nd Author's Name Mineo Kaneko  
2nd Author's Affiliation Japan Advanced Institute of Science and Technology (JAIST)
3rd Author's Name  
3rd Author's Affiliation ()
4th Author's Name  
4th Author's Affiliation ()
5th Author's Name  
5th Author's Affiliation ()
6th Author's Name  
6th Author's Affiliation ()
7th Author's Name  
7th Author's Affiliation ()
8th Author's Name  
8th Author's Affiliation ()
9th Author's Name  
9th Author's Affiliation ()
10th Author's Name  
10th Author's Affiliation ()
11th Author's Name  
11th Author's Affiliation ()
12th Author's Name  
12th Author's Affiliation ()
13th Author's Name  
13th Author's Affiliation ()
14th Author's Name  
14th Author's Affiliation ()
15th Author's Name  
15th Author's Affiliation ()
16th Author's Name  
16th Author's Affiliation ()
17th Author's Name  
17th Author's Affiliation ()
18th Author's Name  
18th Author's Affiliation ()
19th Author's Name  
19th Author's Affiliation ()
20th Author's Name  
20th Author's Affiliation ()
21st Author's Name  
21st Author's Affiliation ()
22nd Author's Name  
22nd Author's Affiliation ()
23rd Author's Name  
23rd Author's Affiliation ()
24th Author's Name  
24th Author's Affiliation ()
25th Author's Name  
25th Author's Affiliation ()
26th Author's Name / /
26th Author's Affiliation ()
()
27th Author's Name / /
27th Author's Affiliation ()
()
28th Author's Name / /
28th Author's Affiliation ()
()
29th Author's Name / /
29th Author's Affiliation ()
()
30th Author's Name / /
30th Author's Affiliation ()
()
31st Author's Name / /
31st Author's Affiliation ()
()
32nd Author's Name / /
32nd Author's Affiliation ()
()
33rd Author's Name / /
33rd Author's Affiliation ()
()
34th Author's Name / /
34th Author's Affiliation ()
()
35th Author's Name / /
35th Author's Affiliation ()
()
36th Author's Name / /
36th Author's Affiliation ()
()
Speaker Author-1 
Date Time 2010-12-01 13:15:00 
Presentation Time 20 minutes 
Registration for VLD 
Paper # VLD2010-77, DC2010-44 
Volume (vol) vol.110 
Number (no) no.316(VLD), no.317(DC) 
Page pp.149-154 
#Pages 6 
Date of Issue 2010-11-22 (VLD, DC) 

[Return to Top Page]

[Return to IEICE Web Page]
The Institute of Electronics, Information and Communication Engineers (IEICE), Japan