• 検索結果がありません。

大規模システム実現学 講義情報 3736 102 03 2

N/A
N/A
Protected

Academic year: 2018

シェア "大規模システム実現学 講義情報 3736 102 03 2"

Copied!
6
0
0

読み込み中.... (全文を見る)

全文

(1)HIMJ;, ] 20 6kj=;(#wypP,(2010.10.27-29 Copyright © 2010 Z7O+ HIMJ;,. 2310. kj{~> /:|0 XW f4zU"'Lu2 Structuring of Early Process of Product Development Considering Order and Dependencies between Design Tasks Ƃ ÕȢ ƆɥِþąɌɦ. ĐɄ Ǵɥِþąɦ. Department of Systems Innovation, The University of Tokyo. Program for Social Innovation, The University of Tokyo. ĚĐ ģêɥِþąɌɦ. Ƃ ɕĒ äƑɥِþąɌɦ. Department of Systems Innovation, The University of Tokyo. Department of Systems Innovation, The University of Tokyo. Key Words: Product development management, design process, constraint network, task planning, design structure matrix. Abstract This paper proposes a planning support method of design process within the early design stage, where the input and output of a task are not decided. A grouping from the viewpoint of product function and structure is proposed based on product information model. The proposed method support to plan a design process considering the following two viewpoints: (1) good task-grouping and (2)good order of task-processing. In order to construct good task-grouping, the viewpoint of product function and structure is considered. The good task-grouping involved has the intention to read and understand design plans from functional and structural viewpoints. A reducing method of the amount of influence between groups is proposed and whole-product design is recognized by undertaking independent design activities. Also, a method of rework-risk reduction is proposed by removing vain feed-back loop. We describe information processing to derive a design process and verify it by using LSI (Large scale integrated circuit). In conclusion, the proposed method can derive an effective design process in situations where there are no clear input-output relations among tasks.. 1.   1-1 hNg}2 -kj|@*rD ȱě)ĕŶȁå)ȎȊ' ;†ȃ&ɊĪ‹*ɧŠƻ&é ɝ 9ƀǍ'Šƻ&éɝ/$ûÉ"

(2) ";ɨŠƻ&é ɝ)¢$"ɧQSZk LSI )ȎȊ#*ɧȁȸfvUStz t)ĩǜÉ7¶ƦǰÄ)Ý ɧ2ɧDZÇȫ)ȎȊ#*ɧ ɠÄ7džȭĮÝ&% ɧɇ9 †ȃ&ɊĪ‹#ɨ )5ɧ<<ȎȊĻǼǯ*ɧŠƻ&Nzt?Łéɝ ?Ó:Ǟ4$ ·ŭɨ$= ȱěɧȎȊ)ɊĪ‹ Ȃ ɒÉyýŹÉɧŠǀÉ";ɨ)þ

(3) &ƦƬ$"ɧ ˜€'ǁɬ )ûÉ Ń9<;ɨ ɪɦ‘ĕƟ)Ơ'az]DEA'Ɋ"ɧKY]C^d ɥGood-Enoughɦ$â+<;ĶƜugt'ȱ!Ļ Ǽ ý ·ƥ;8'&$ ɫɦVd\DEA'8"ýŹ&ſǰ?ǕÍ'Ĉƥ#

(4) ;8'& (1)ɨ)5ɧȃƉſǰ?az]$ Vd\ ȹœ;Ȃɒ&ŃÇ'8"ɧƘȧ;8 &ȎȊ ȃƉ<;8'&"

(5) $ ɬɦ‘ĕƟ)¤ªDZž6az]DEA͞#*ćǭ #

(6) ɧ¡ƪ<;Ƨø7ǩ :ɥFMyȶ¦`Y \wzJ&%ɦ$Vd\DEA«ɘ) #ɧ Ʋƥ;8'&"

(7) $ ¢+QSZk LSI )ȎȊ#*ɧĻǼ)ƓÉ)\ux]. 9ɧðɪĖð'ǁ8'ɧɫɩɪɬěÂĦ'*ƟƦƳ&ĩ ǜÉ)ɋư'ǻ

(8) ȑ2;ɧ$‰Ɨ<";ɨƀƒ–?Ũĥ <;ɅăĻǼ*ɧ2ĈƥÉ)Ƶ¶ Ⱦ$6:ɧč ŭ)ŝÝĮ Šǀ$&";ơƌ';ɨ)ƟƦƳ& ĩǜÉɋư*ɧkzA)ƍÁ 9‰Ɨ<ɪɩɩěɉǣ "

(9) ¶ƦǰÄÝ)\ux] ɧȱčŭɧþ

(10) &Wz_ xKiCx\?Ȱ;$?ǁè";ɨ9'ȱěɧ}. ǰ& LSI *Ąò&ɧ$$?ǁõà <";ɨ ˆĔþą 9){ȹ)ƿLJ(2)-(3)'8<+ɧƦıƳ& LSI )ŸĶ*ɧÇ ;Vd\DEA'8"þ

(11) £Ą;ɨ )$*¢+ɧĘȞ<;Ť6ɤĮǰ& CPUɥCentral Processing Unitɦ ɧKrdBJSĮǰ'ƠÉƈȬƳĆ ¤& GPUɥGraphics Processing Unitɦ'Č"ɧŋƯã—) ¶ƦǰÄ)ƙ#þ

(12) Ñ+&ɧ$‹Ĉ 96Ƕ ƦȈ #

(13) ;ɨ)5ɧ}ǰ& LSI )ɈƲ$ƨƩ'ėȡ)MS\ ?ļ;$*ɧÚƦ#;ÖǰĮ łŔ#

(14) ;ɨLSI ) ĤÃ7ſǰ?ɧȁå)¡ƪƵƳ7Ç Ŭš$QSZk $"ŅɧȃƉ'Ĭ LSI )ɈƲ?ǻ$ ɧǟƔƳ &ÚƦĮ?ÈŲ#6ŤǶ)ǠŰ?Ď ÖǰĮ ;ɨ ÜŹ'DZÇȫ)ȎȊ#*ɧȫ„'Œȭ<; ECUɥElectric Control Unitɦ)Ř ɟȩƳ'ùþɥɫɩěÂ*ɪɱبɧƥ ò*ɮɩɱɪɩɩ¨DŽĞɦɧVd\DEA)ɈƲ$): Ú>)ɃȃĮ ùÅ";ɨƋñ7ƃȫ&%$a z]DEAƳ&ÀĨ 9ɧɔăíȨ$mzWz'8;Vd\ DEAƳ&ÀĨ'ûÉ;ȻDŽ#ɧɤĞ&lH\vÉ Ⱥǻ ";ɨ)ǠŰɧVd\DEA'8"Ȃɒ Ǩǜ& ſǰ ǕÍ'Ĉƥ#

(15) ;8'&"

(16) #& ɧ¢ +ǽljíɁ7ǧºɢȫŕŏɧƞȡ)ŤþÉÀĨ&%$8 'ɧQSZk°ž)ǡÚÀĨ'8"»5"ƨ3·<; ſǰ)Ĉƥ Öǰ$&"

(17) ";ɨ{ŝ#ɧ<2#)8 &:>'ȻĞ'£ĄɈƲĹƍɧ 2:Ÿȸ 7¸Ʉ$'ȟ›žǗ?¸"ɈƲ?Ⱥ5ɧŸȸ7¸Ʉ?2 ɂ¸*‘ɉƳ&:>#řÚĮ?ð;ɧ$ŝƍ ȶƪ& &"

(18) ";ƥơ';ɨ. 1-2 kj 5k<c.FE ȱě)ȎȊ' ;îɓĮ)ũȤ*ɧȃƉ7ÖǰĮ ýŹ ÉǠŰɧŸ? <+Ƕ) $éɝȎć Š ǀ$&"

(19) $#;ɧ$ȕț#

(20) ;ɨ$+QSZ k LSI )ȎȊ#*ɧðɪ×ð'ǁ8'ɧɫƀ­Ƴ'ĈȀ.

(21) Past Prob Fast. clear. as r.. Prob. not clear. s no almighty LSI.. Fas r. o. Physica. 100nm. oC y. -. -a-Chi. or. 10nm. nm. 2007 2010 ar o. 2013 y. to so to a. - -Pac si ry-a. -. Fig. 1 Example of Requirement of Good Problem -Today’s issue of the design of LSI-. ; SoCɥSystem-On-a-Chipɦ$ɧɬƀ­Ƴ'ĈȀ; SiP ɥSystem-In-Packageɦ)%9 Ƕ ɧĊš'*¼ś#

(22) &ɧ$éɝ'ƶɘ";(4)ɨ™'ƛƦ7:éɝ?Ȏ ć"6ɧ< Ƕéɝ#*& öÚ'*ɧǠŰ$ "ǹþ&őÿ?ǿ"2į< ;ɨ¢+QSZk LSI )ȎȊ' "ɧȄȶ Ê¸&22 SoC #ȎȊ; $éɝ?ȎćöÚ?Ǯ;ɨ6™'ɧSiP ?Ňƪ ;$ ũȤƳ'Ŧ¾#öÚ'*ɧ SoC ?Ňƪ ”ǃ)Ħ÷?Ŀ;$*ʸȦ:;ɨȎȊ' ; †ȃ&ɊĪ‹ ɧéɝ?ĀŸ'"Ȉ

(23) ŤȿÉ; ɥSoC ? 'ŤȿÉ; ɦ 9ĀŸ'"Ȉ 0

(24) ȿ¹& éɝ?Ȏć; ɥ66 SoC ?ɈƲ0

(25) ɧSiP ?Ɉ Ʋ0

(26) ɦ'û>: ;ɧ$ȕț;$ #

(27) ;ɨ #ǎǯ9*ɧȎȊ' "ɧ8:Ƕéɝ?Ȏć; $ Ƀȃ&)#*& ɧ$ǮɧȎȊ' ;éɝȎ ćDZž?Șɝ$"Ó:Ǟ@#;ɨȎȊ' ;éɝ Ȏć$*ɧQSZk LSI #¢'ŃAzIZJXn)Ʒ Ƚ#& ɧȎȊ' "Ÿ?ɃȃȆ0

(28) ɧŸ?øư Ŭš$ɧ%)ɂ¸?ÂŌ;*üɂ'ĂȌ;éɝ$ 0

(29) ɧ%)ɂ¸'ȣũ?ɑ "njŠÄ$0

(30) ɧŸ ?6"fvREJ\) Ɓ7Ǣǣ?¼ś0

(31) ɧ$ Ƶź7IJĭƊć)űŀ?Ȏć;$?ß@ǻƚ$" Ǯ;ɨ"ɧǶéɝȎć?ħ;$?ŤǝƵƳ'ɧ %<+Ƕéɝ?ǮȎć;$ #

(32) ;) ɧ6 6Ƕéɝ$*{žŸ&) ?ɧŠ9 ';$?Ȑ3 ;ɨ. <ýɃ)ÂŌŬš7ÀǘŬš) #ɧƵź?ŤþÉ;8 &ňǛ?ȯȷ'ǻǰÄ*ħIJ$ɧ‘ɉ?µɣ;ɘ6 ŁÚ>";ɨ ˜)Ȋǐſ$‘ɉ)ƠĮ?Ǯĵ;$ɧǶéɝȎ ć?ŕŏ;5'*ɧɤȷ&ȐǻɆȖ)Ƨø ŦÆ&) #*& ɧ$Ǯ;$ #

(33) ;ɨ&&9ɧȎȊǯ é ɝȎć$"ɧŹ&ȃƉŬš$ɧÀǘ7ÂŌŬš?¯Ä ;$ɧȯȷ'\uz]Gd)ĸò7ɧŤȿÉ)ǠŰ%2# ¿ȼ#

(34) ;) ɧ$Ƶ¶NJ"?ɧɤȷ'Ɖ5;$ #

(35) ; 9#;ɨ<9)ǠŰ 9ƾȄ?ħ"ɧȵ'éɝDZ Ȫ?³ćǭɧ8:Ƕéɝ?[PCx;$?ŕŏ#

(36) ; 9#;ɨȎȊǯ*ɧ<9)ƾȄ?gzS'ɧȎć éɝ Ƕéɝ) % ɧ%)Ŭš?ûţ; *ǥä<+ɧ8:ȃƉ'ÎȈ ħ9<;8'&;). ?Ǯ9<;8'&;ɨ)ǠŰɧȎȊǯ Ȏćé ɝ?Ȅƶɧ8:Ƕéɝ/$ŖǶ;ȻDŽ?ŕŏ#

(37) ;) #*& $Ǯ9<;ɨ ˜)Ǯ'ô!"ũƿLJ#*ɧȎȊǯ ǶéɝȎ ć?ǻ$?ŕŏ;5)ɧɤȷ&ȐǻɆȖ?ŕŏ ;Ĺƍ?ŌŲ;$†ȃ&ƵƳ$;ɨ)†ƵƳ?ȼĶ ;5'ɧ˜€ɪɦɱɯɦ'ǁȓǜƵƳ?Ó:Ǟ4ɨƠ 'ɧũȚŚ#*ɫɦ 8-ɬɦ'ǁ²Ċ?ɧȓǜ'Ț;ɨ ɪɦɤȷ&ȐǻɆȖ?Ĉƥ;5)ȎȊƧø$ɧ°ž )İõ¶Ʀ)fvUSɥǍŒNjɦ ɫɦéɝ?Ɏ'ćǭĺ5)ɧȁå)İõ?ǡÚƳ 'Ǿƥ;m[t?ƪĹƍɥǍ~Njɦ ɬɦćǭ<éɝ?Ȋǐſ#Ȉ 5)ɧéɝ)Ÿ ȸÉĹƍɥǍìNjɦ ɭɦȊǐſ'8"ŸȸÉ<éɝ?Ȉ $#ɧȈ Ljɉ?ħ;ĹƍɥǍŽNjɦ ɮɦħ9<ȈLjɉ 9ɧéɝȎć ȿ¹# %  ?³Ǯɧ8:Ƕéɝ?Ȏć;5)ŝƍ ȚɥǍ±Njɦ ɯɦĈȀQSZk?ƪ"ɧQSZk LSI )ȎȊ? Čȝ'ȿƪŵȏǠŰɥǍ|Njɦ 9'ɧŌŲ;Ĺƍ?ȎȊŕŏ)Ƨø$"ĈȀɧQ SZk LSI )ȎȊ/$ȿƪŵȏ;ɨQSZk LSI ?Čȝ $"ɀćƦƬ*ɧȱěȎȊ' ;ŝÝĮ7ɊĪ‹ ýŹÉɧǶéɝȎćDZž?ŵȋ;īȃĮ'ȳ9<" ; 9#;ɨ. 1-3 Y[WV d5k<FE €t

(38) mexnS9L^ <#*ɧȎȊ' ;ǶéɝȎć$*ɧ{ž%) 8'ȗŠ#

(39) ;)= ɨ®ǻ)ȎȊą)ƿLJ(5)-(7) 9 Ǯ9<;8'ɧ)é'Ǐ;$*Ċš#*&ɨ ũƿLJ*ɧ)é'Č;ȈǏ*ɧī6{ȶ:#*& ɧ$Ǯ;ɨ 2:ɧŸ?6"Ƕ$;) *ɧ¨½ )LzS'8"<<Ʊ&;$ǮɧŤȿÉ&%#ŤǶ Ų?Ď·;$*îɓ#;ɧ$NJö'NJ ɨ<# *ɧ &;ŕŏ?ǻ$6Öǰ&)#= ɨũƿ LJ#*ɧǶéɝȎć?ŤȿÉ'8"Ď·;$*îɓ #; ɧǶéɝȎć?ǻ $;ȎȊǯ)ȕț7ĭǮ ?ŕŏ;$*Öǰ&)#*& ɧ$Ǯ;ɨ&&9 éɝȎć?ǻ5'*ɧǶƲı7ƺı$ȕƾƳ&Ȼ DŽ īȃ#:ɧ<*‘ɉ ħIJ$Ȋǐſ ħĹ$ ;¶Ʀ?ß@#; 9#;ɨ{ŝ#ɧ,$-éɝ Ȏ ć<<+ɧȊǐſ*ƹ¤?ƲŎ#

(40) ;ɨȊǐſ*ɧ‚9. 2. mexn 5<aFE 2-1 5mexn!')%) ðɫ'ɧũƿLJ#ŌŲ;ȐǻɆȖ)ŕŏ)dvzXnz \?ǁɨ˜€'ǁɭ )SZYf)Ǫ:Ȳ'8:ɧȐ ǻɆȖ?ŕŏ;ɨ ɥɪɦȎȊǯ'8;éɝ)Ȏćɥðɫ ɪɨDefine Problemɦ ȎȊǯ éɝ?Ȏć;ɨǍ~Nj'ȴ0;ȁåİõ)ćǭ m[t?ƪ"ɧȎȊ' ;ÂŌŬš7ɧƵƳɊŘɧČȝ $"Ǯ;ȁå)ŸĶ?¯Ä;ɨ¢+QSZk LSI ) ȎȊ' "lms*ȥ¯;5¯ÄŬš$"ĺɧ ;*¶ƦȷĞ)ŤþÉ$ɘdž)ŤďÉ?Ť¬®#Ǯ;ɧ $Ŭš?¯Ä;$'Ȓġ;ɨ ɥɫɦ Ȋǐſ'8;éɝ)ŸȸÉ ɥðɫ ɫɨ Structure Design Processɦ.

(41) 1. Define Problem Prob 1. Define Precondition. 4. Study from ro Result. Memory is purchased. 1. Find Trade-Off. 2. Define Objectives. 2. Find Bottleneck. 3. Define Structure. 3. Learn the Boundary. Maximize speed, minimize size. 2. Structure Design ig Process Proc s 1. Plan Design Process. Target. Team. 2. Minimize design loops and conflicts. Loop. Solution Space. Trade-Off. 3. Design ig 1. Calculate Design Plans 2. Optimize Plans FiPER. 3. Define good targets of the teams Design Process. Fig. 2 Flow-Chart of Rapid Try-and-error. Ȋǐſ*ɧ¯Ä<éɝȎć$ɧȁå)İõm[t?ƪ "ɧȎȊ ÆƤƳ'ǻ;8'ɧȎȊfvUS?ŸȸÉ ;ɨðɫ' "*ɧ˜€'ǁɬ )Ȇƙ#ɧéɝ?Ÿ ȸÉ";ɨǍ{'ɧȎȊWSJ)ĈǻfvUS7ɧ: Ú>;0

(42) ǫ2:?ć5ɧȎȊfvUS?ŸĶ;ɨǍŒ 'ɧ<<):Ú>Ƈ'ɧƛɡ&ȎȊ)Ĺķ:7ɧȎ Ȋ' ;ƽƸyǽlj Ʋƨ' 8'ɧ:Ú>) ǫ2:7:Ú>ɛĝ?șř;ɨǍ~'ɧ<<)Ȏ Ȋ:Ú>?ȎȊXzk'8;WSJ$Ǯ"ɧÙȎȊX zk'ȿ¹&Ƶź?‚ɧ°ž$"șä;8&fvU S'ŸȸÉ;ɨ ɥɬɦȊǐſ'8;ȎȊ)Ĉǻ éɝ ŸȸÉ<;$ɧȊǐſ*)Ĺɛ' "Ȏ Ȋ?Ⱥ5ɧȈňǛ?ǻ$ #

(43) ;ɨðɫ'ǁ8'ɧ ¢+ FiPER(8)?ƪ;$#ɧÙȎȊWSJƇ'Ȋǐ?ǻ ɧȁåQSZk°ž$"6ŤȿÉ &<;8'Ȋǐ ?Ĉǻ;ɨȈLjɉ)WCf'8"ɧGA 7 SA '–Ǿ <;ȿ¹&ŤȿÉĹƍ?ȿƪ;$'8:ɧɋ9<Ȋǐ Ţɉ#ɧ;DŽĞāġ$¼ś<;ȎȊȈ?Ď ɨ ɥɭɦħ9<Ȉ 9ƾȄ?ħ"ɧéɝćǭ'dBz]bY Jɥðɫ ɭɨStudy from Resultɦ SZYfɬ#ħ9<ȈLjɉ?§ƼɧƾȄ?ħ;ɨȎȊ crlzWɉ)\uz]GdɊ¥7ɧh\t`YJ$&;Ȏ Ȋȃǚɧ;*ŤȿÉ)ɋư?ɧȈLjɉ 9Ď ɨ)Ǡ ŰɧcrlzWɉ)\uz]Gd?Ȉƒ;8&AC[A ?ȎȊéɝ'ČÅ:ɧh\t`YJ$&;ȎȊȃǚ? Ŗë;8&Ÿȸ)ûţ?ǻ:ɧ9'*ɤ2 #$ŤȿÉ)ȄȮ3 9ɧƥò)ȎȊŲ#ʸ&) ɧ <$6AzIZJXn 9³Ǯ&<+&9&) ɧ $ƾȄ?ħ"ɧSZYfɪ#ȅćéɝȎć?ûţ ;AC[A?ħ;ɨ. 2-2 mexn& d5R? ðɫ'ǁOCJt*ɧéɝ)ćǭ$Ƶ¶NJ") PDSA OCJtɥPlan-Do-Study-Actionɦ?IJá";ɨ#ɧ ) PDSA OCJt?Ǫ:Ȳȿƪ;$'8:ɧćǭ éɝ)éɝƙ?ƲȄŖë;ɧ$$?ŕŏ#

(44) ; $Ǯ9<;ɨ)Ǫ:Ȳȿƪ'8:ɧŤǝƳ'ƏǦ< éɝȎć?ƣħ;$ #

(45) ;$Ǯ9<;ɨƣħ#

(46) éɝ*ɧ»Ũ'¯Äéɝ8:ƏǦ<";5ɧ Ƕ éɝ#;$Ǯ;$ #

(47) ;ɨ. 3. 5Lu2BO 3-1 5<a f4A8$& ȎȊ' ;éɝ?Šǀ'ĉȉ;5'*ɧćǭ?ǻ Čȝ īȃ#;ɨȎȊȃƉ?Ǿƥȍȴ;éɝ'Č" *ɧȃƉĕą'–Ǿ<;ýŹ&Ĺƍ ŌŲ<";ɨ. & 9ɧȎȊéɝ?ćǭ;5'*ɧȁåDZȪ)Ǿƥ $ȍȴ īȃ#;$Ǯ9<;ɨ $=#ǎǯ9*ɧȂÚȁå'Č;ȃƉ7ŃÇ'Ɋ; İõ?m[tÉɧɈƲ)»Ũƅɏ 9ɗƳyÇƳm[tŵ ȏ?ǻɧƐĕDŽ#ć5ȃƉ“Ź$ĈȀ){Dz7ɧɜ ó?żś;ȎȊûţ îɓɧ$Șɝ?ȈƊ;“Ǟ 3)ĈƥÉ?Ó:Ǟ@#; (4-7)ɨ#ɧǎǯ9 ŌŲ ;ȁåİõm[tɥðɬɨɦ?ƪ"ɧȎȊéɝ?ćǭ; $?Ȑ3;ɨ ðɬ'ǁȁåİõ)m[t*ɧȎȊ$ǻƚ)ǠŰ$ "ƨĶ<;İõ'ƺƵ"ɧȻÐ)ȎȊİõ?ƦȈɧ m[tÉɧǾƥ;m[t#;ɨȎȊ)ǻƚ)ǠŰɧ˜ €)ɮDžɞ)İõ ƨĶ<;6)$Ǯ;ɨ˜€'ǁɮ Džɞ)İõ?ƪ"ɧȎȊ#ĺ><;ȁåİõ?ȍȴ;m [t?Ÿǔ";ɨ ɥɪɦȁå)ŸĶȃǚ$ǩ :'Ɋ;İõ ɥɫɦȁå)ɏđŸȸɥȓǜÉɦ'Ɋ;İõ ɥɬɦȎȊſǰ7“Ź'Ɋ;İõ ɥɭɦȁå Ƙȧ0

(48) ÀǘɊ¥'Ɋ;İõ ɥɮɦȎȊfvUS'Ɋ;İõ. 3-2 f4A8$&T kj5<a ŌŲ;ȁåİõm[t?ƪ<+ɧ)'ƵƳɊŘ7 ÀǘŬšɧȎȊûŘ?ćǭ;$#ɧȎȊéɝ?Šǀ'Ǿ ƥ;$ #

(49) ;8'&;ɨ ðɭ'ɧȎȊéɝ)Dž½$IJá?ȴ0;ɨŤȿÉéɝ*ɧ ɪɦÂŌŬšɧɫɦƵƳɊŘɧɬɦÀǘŬš 9ŸĶ<;ɨ <'©ɧȎȊéɝ?ɧ˜€ɬ )Ŭš?ĉȉ;$# Ǯ;ɨ ɥɪɦȎȊ)ÂŌŬšɥðɭ ɪɨɦ ȎȊ' ;ÂŌ$&;Ŭš?¯Ä;ɨ 2:ɧȎȊ' "ŝÝĮ?¯Ä;$'Ʒġ;ɨȎȊ)Čȝ$ɧȎ.

(50) intake system example. wwater ate quantity m m. 3 3. pump temperature℃. 1. Precondition (direction is different). Symbols entity. inhalation pressure. customer needs. power consumption onumption pwe. length. w e e pe ue. sea water at r temperature t rat. economic efficiency payback 25year. energy efficiency cooling energy 12kJ. cost. Product information intake system. running 12M$. pump. initial 1.3M$. Example of Constraint relationship temperature. Heat. pressure pa. minimize. OR. Size. Objective B Heat. Cost. no more than 40mm2 Size. Cheaper is better. 3. Product Structure (Organization and team is different). Fig. 4 Problem Definition based on Product Model. 7℃ 700m. pipe. temperature℃. free. consuming energy w. water quantity20m3. Logic Chip. Outsource design of memory. Objective A limit from 7$ to 9$ Cost. Engineering characteristics. Memory. 2. Objective (Weight , importance, and boundary condition is different). design template model Customer needs. OR. Use existing memory  module. constraint interface calculation flow possession link hierarchy link. diameter. Logic Chip. Memory. engineering characteristics product information. pipe. Precondition B. Precondition A. attribute. length 700m. length. Temperature distribution of sea water. dia 36φ. Fig. 3 Model of Product Information – an example of a deep water intake system -. ŌŲ;éɝ)ŸȸÉĹƍ?ɧðɮ'ǁɨȁåİõm [t'ćǭ<ɃȃĞ7ƵƳɧÂŌŬšɧȁåŸȸ? ¸ů;$#ɧéɝ?Ȉ 5)ŸȸÉ?ǻ";ɨ ŸȸÉ<éɝ*ɧȎȊfvUS$â.ɨ˜€'ɧȎȊ fvUS)Ď·Ĺɛ?ǁɨ ɥɪɦJrSWsxK'8;éɝ)¸Ã. Ȋ#Čȝ$&üɂİõ'¸;ǻƚ?ß4ɨQSZk LSI )ȎȊ)¢#*ɧðɭ'ǁ8'ɧlmsymRpz t*ȎȊ)Čȝ$ɧŞĄ)OfrCoz 9ȥ¯;$ ¼śöÚ*ɧlms*ÂŌŬš'&:ɧ<'  "vRYJXYf?ȎȊ;$$&;ɨȵ'ɧlms?Ȏ Ȋ)Čȝ$ɧȎȊ6ß5"AD\VzQxK;$¼ś öÚ'*ɧvRYJXYf)ȎȊ?®'Ɣ2" īȃ ;ɨ&&9ɧüƎ)ɐ'*ɧlmsȎȊ)ȃš?ɧŠ ǀ&Ģ#łǁ&<+&9& 9#;ɨ ɥɫɦȎȊ)ƵƳɥðɭ ɫɨɦ ȎȊ' "ɃȃȆɧŤþÉ?ǻȎȊȃǚ?łć ;ɨŤþÉ#& ɧŤďÉ7ɧ;{ćǓï²'Ò5 ;ɧ&%$ȃƉ6ɧ)ǻƚ'ß2<;ɨ9'ɧł ćȎȊȃǚ %<9Ƀȃ#:ɧ¬®<;) ɧ $ɃȃĞ?¯Ä;ɨðɭ)¢#*ɧƵƳ A #*OC T*Ơ'é>&6))ɧMS\*ÏǓï Ș9<" ;ɨ{ŝ#ƵƳ B #*ɧMS\'Ɋ"*Ć1 Ƕ DŽĞ#ɧ2:ɃȃȆ" 9ɧ) >:ƲƝ*ŤďÉɧ OCT6ÏŘªƵź ć59<";ɨ<9*ɧɃȃ Ğ7øư$&;ÀǘŬš?¯Ä;$'Ʒġ;ɨ. 2»5'ɧéɝ)Ÿȸ)ɏđÉ?ǻɨ)5'ɧé ɝ°ž?drY\'ĺ)#*& ɧJrSWsxK'8 "Ktzf?ŸĶɧKtzf²ɂ)ȎȊ$ɧKtzfɉ) Ìș'¸Ã;ɨJrSWsxK*ɧȎȊ?ɧŸĶ;ǻƚ '¸ÃɧÙǻƚ?ǫ5;$#ǻɨ ȎȊǻƚ)Ťďȃǚ*ɧcrlzW&%$ȁåİõ ){ɂ¸?Ɗć;$ɧ$Ǯ;$ #

(51) ;ɨ)İõ *ɧðɬ'ǁȁåm[t#ɧÀǘɊ¥ɥConstraintɦ$ "ȍȴ<";ɨ#ɧ) Constraint ?JrSWsx K;$'8"ɧKtzf?ŸĶ;ɨ JrSWsxK'*Ƿ&Ȇƙ Ǯ9<; ɧũƿLJ# *ɧ†'Įǰ'8;Ȇƙ$ɧŸȸ'8;Ȇƙ?Ǯɨ) ƦƬ*ɧ{ǵƳ'ȁåɈƲ' ;ÙɂǬ7ȎȊXzk*ɧ Įǰ)ɜó7ɧŸȸ'8"¸Ã<";$Ǯ9<;. 9#;ɨ9'ɧ²ɂ)£ĄɊ¥?ǮĵɧĠǠ-

(52) ?Ł crlzWÜú*ÜKtzf$"Ǯĵ<;8 ɧňǛƳ'JrSWsxK;Ĺƍ?Ÿǔɨ JrSWsxK)ŷȃ?ɧðɮ ɪɨ'ǁɨ`Y\wz J 8-j\sJS'8"ɧJrSWsxK)ǠŰKtz f ĉȉ<";$?ǁ";ɨ. ɥɬɦȁåŸĶɧAzIZJXnɥðɭ ɬɨɦ ɥɫɦ¸Ã<Oeéɝ)ƢNJÉ ȁå?ŸĶ;ȃǚ7ɧ)ǩ :?¯Ä;ɨý )ö Úɧ° ŜȁåŸĶ?¯Ä;8&$*& ɧƒ –)ŸĶ?·Ʋƙ$ɧ{ɂŖû?Å;Ģ#ćǭ;ɨÜ ŸĶ) #ȎȊŲ?ŻǛ;öÚ7ɧƱ&;ŸĶ?ƈȬ ;öÚ6Ąò;ɨ ˜)Ĺƍ'8"ɧ3-1 ǒ#ǁȁåİõm[t'ɧ ȎȊéɝ?ćǭ;ɨ. Ʀı?ȉ+ɧSZYfɪ#¸Ã<ÙOeéɝ ƢNJ #:ɧ<<)ȎȊéɝ'ęƺ#

(53) ;$ ŧ2ɨ  & 9ɧ¢+QSZk LSI )ȎȊ&%#*ɧƝ)é ɝ*°Ÿȸ'>"Ąò;&%$8'ɧɍÐ#

(54) &£ĄɊ¥ ýŘĄò;ɨ#ɧĮǰ7Ÿȸ)«ɘ. 9JrSWsxKOeéɝ?ɧ@%*Oeéɝɉ) Ʒ£ĄɊ¥$Ȇƙ 9Ȅƶ$#ɧ8:ǶŸȸÉ ?Ȑ3;ɨ. 3-3 5Lu2 ȎȊ?ǻ5'*ɧȎȊéɝ?ŸȸÉ;īȃ ;ɨ ŸȸÉ'ȎȊ?ǻ$6Öǰ#*; ɧ{ǵ'ȎȊ #Ȉ 0

(55) éɝ*Ȃɒ'&;5ɧŦÆ&AfvzX#*& ɨŤȿÉéɝ ‚9<<+ɧÆƤƳ'ȈƊ;5)ɏ đÉAfvzX&%*ƴ@'Ó:Ǟ2<";(13)ɨũƿLJ# *ɧȁåİõm[t#ćǭ<ȎȊéɝ'Č"ɧ) İõ?ǙȈ $'8"ɧéɝ?ŸȸÉ;$Afv zX?Ňƪ;ɨ. OeéɝÜú)£ĄɊ¥*ɧ£ĄɊ¥?Ǿƥj\sJ Sɥðɮ ɫɨɦ?ƪ<+ɧÙKtzfɉ#ƄĄ;£ĄɊ ¥$"řƦ;$ #

(56) ;ɨ#ɧOeéɝ?%)8 &ɛĝ#Ȉ ɧ2Oeéɝ'%)8&Ƶź?‚;. '8"ɧ£ĄɊ¥*ûÉ;ɨ$+ɧj\sJS) Čȇ×'£ĄɊ¥ Ƅ;8&ɛĝ?ɀĽ<+ɧ<* &>Oeéɝ)ɉ#ȎȊ)Ĺķ: Ʋƨ;ÖǰĮ? IJá;ɨ2ɧOeéɝ'Č"ǶƵź?‚<+ɧ.

(57) Input data: dependencies between design parameters and constraints Non‐directed Constraint Network. ɥɬɦOeéɝ?ƪŸȸÉ ˜)ɧOeéɝ/)¸Ã$ɧƵź) Õɧ 8-Oeéɝɉ)£ĄɊ¥)ș ř?Ǫ:Ȳ$#ɧéɝ°ž?ŸȸÉ ;ɨðɮ Output 'ɧħ9<;ŸȸÉ <éɝ?ǁɨý )£ĄɊ¥ Ą òɧdrY\&ŸȸơĴ 9ɧ Ƶź?ŁÙOeéɝ)ȹœ$ Ģ#ɧéɝ ŸȸÉ<";$ ǀ ȕ#

(58) ;ɨ. ←Constraint DSM. Attribute DSM→. 1:Create group of constraints and sequencing the groups. 4. kjiC_ 1)Dividing constraint network and creating groups. 2:Create directions of constraint network and  sort attributes by DSM. 4-1 kj"'<a 2)Sequencing  groups of constraints. 3:Create target attributes and redesign of group Improve Independency  of constraint groups. Directed relationships  between attributes and constraints. target attribute . Output data: design process with  constraint group and calculation flow Directed constraint network with group and target attribute  Directed link. ←Constraint DSM (group of constraints). target attribute . Attribute DSM→. ȎȊȈ?ňǛ;5'*ɧȎȊ?Ⱥ 5;Ĺɛ īȃ#;ɨ#ɧǍ~Nj #ħ9<ɧŸȸÉ<éɝ?ƪ"ɧ ȎȊfvUS?ćǭ;ɨ JrSWsxK'8"ħ9<O eéɝ*ɧ<DZž ȎȊWSJ#; $ȕț;$6#

(59) ;ɨ9'ɧðɮ 'ǁ DSM *ɧȎȊWSJ)Ĉǻ)Ɛ <)İõ6ĸŁ";ɨ#ɧ£Ą Ɋ¥?Ǿj\sJS 9ɧȎȊWS J$ɧȎȊWSJ)Ĉǻɛĝ)İõ?Ó :·ɧwzJdvz?ľ·;ɨ ðɯ'ɧwzJdvz)ćǭĹƍ?ǁ ɨǍ~Nj#ȊǐÙJrSWz?, $ )ȎȊWSJ$"ɧ°ž)ȎȊ? ÙȎȊWSJ$)ɏđƳ&ǩ :' ¸Ȉ";ɨ. (calculation flow) group. 4-2 kjiC_ R? Fig. 5 Flow of Structuring Design Problem. <*”)Oeéɝ'$"ǘū$"ſǰɧŒƀƳ'Ʋƨ ;£ĄɊ¥?ņɍ;$ #

(60) ;ɥðɮ ɬɨɦɨũƿLJ #*ɧISM Ĺƍ?ƪ;$#ɧŒƀƳ&£ĄɊ¥?ƕ#

(61) ;8&ƵźȎć?ǻɨ9'ɧňǛƳ'ɛĝ?‚ ;$#ɧĹķ:?ŤďÉ;8&Oeéɝɉ)£ĄɊ¥ ?Ɗć;$?ǻ";ɨ. Âɚ'"ǁ)wzJdvz <+ɧ¢+ FiPER &%?ƪ"Ĉɐ 'Ȋǐ?ǻ$ Öǰ#;ɨ<*ɧÙȎȊWSJ#ǻ 0

(62) İõ¶Ʀ Šǀ'ćǭ<ɧ<<)ȎȊWSJɉ #žƖ$&;ȎȊȃǚ7crlzW ȅć<; 9# ;ɨ#ũƿLJ#*ɧħ9<wzJdvz 9 FiPER 'ʼnǣ;$'8"ɧDZÇĈǻ'8"ȈňǛ?Ɖ5; Ĺƍ?Ÿǔɨ. 1) Design Process. 2) Work Flow. Sub Problems. Fig. 6 Calculated Work Flow from Design Structure Matrix.

(63) rob 1. No t. 2. St. sign P. ss 1. Goo. m. m. 2. Goo. 2. No pro. 3. Goo. 3. No targ. 4. St. rom. t. Fig. 7 Proto-type System and Design Example (System LSI). i\{5k<1b ǍìNj#Ɖ5ȈLjɉ 9ɧǶéɝȎć?ŕŏ; 5)ƾȄ?ħ;ɨħ9<;ƾȄ*ɧ˜€)Džɞ)6) Ą ò;$Ǯ";ɨ. 1.. şǟ6)! :2010ě8ťØ, Vd\ Ő.;ȁåĆ°, 2010.8., pp.34-51.. ɪɦȎȊcrlzWɉ)\uz]GdɊ¥)ĸòɧijĞ. 2.. K. Inoue, H. Noori, F. Mehdipour, H. Noori, T. Hanada, and K. Murakami, "ALU-Array based Reconfigurable Accelerator for Energy Efficient Executions (Invited)," International SOC Design Conference (ISOCC'09), Nov. 2009.. 3.. T. Ono, K. Inoue, K. Murakami, and K. Yoshida, "A Software Controllable Variable Line Size Cache Exploiting High On-Chip Memory Bandwidth for Low Power Embedded SoCs (Poster)," In Proc. of the International Conference on Very Large Scale Integration (VLSI-SOC'08), pp.510-513, Oct. 2008.. 4.. şũąǼńdzœ ɪɰɰĂæœǤǺ: ËϞ)ĩǜÉ$Q SZky[PCxCxZKuzQqx, ƢNJǻŗƍ‘şũ ąǼńdzœ, (in press).. 5.. Ûēğ‡: {ǵȎȊąĝȗ, ǖċſŴ, Vol.45, No.8 (1979), pp. 20-26.. 6.. ųƫɖ, ´ĒçƮ, Ûēğ‡: ſǰȎȊŕŏ)5)FBS m[sxK)ŌŲ, ǖċĕąœȔɧVol. 63ɧNo. 6ɧ(1997)ɧ pp. 795-800ɨ. 7.. ɄɉÔ þ, €Ū ǸŽ, ´Ē çƮ: ȎȊǯ)ĭǮȻDŽ) m[t?¾ƪȎȊƾțǑƦQSZk, ‘ĕƾǰąœ ȚŚȔ, Vol. 20 (2005), No. 1, pp.11-24.. 8.. FiPER, http://www.deskeng.com/articles/aaajgb.htm. 9.. Gotoh T., Eguchi T., Koga T. and Aoyama K.: Modeling for Product Requirements based on Logical Structure of Product (Model-Driven Development Method for Mechanical/ Electrical/Soft Integrated Products using SysML), Journal of the Japan Society of Mechanical Engineers (C), in press. Eguchi T., Gotoh T., Koga T., and Aoyama K.: Model-Driven Development Method for Mechanical /Electrical//Soft Integrated Products Using SysML (Report 2 :Impact Analysis of Design Change Based on Requirement Model), Proc. of the Design & Systems Conference 2010, No.09-6 (2009), 310-315, Okinawa. Koga T. and Aoyama K.: 'A SEARCH ALGORITHM OF INTERFACE STRUCTURE TO ACHIEVE REQUIRED PRODUCT BEHAVIOR', ASME Conf. Proc. IDETC2005-85051, Long Beach, California, USA. Koga, T. and Aoyama, K.: 'PRODUCT BEHAVIOR AND TOPOLOGICAL STRUCTURE DESIGN SYSTEM BY STEP-BY-STEP DECOMPOSITION', ASME Conf. Proc. IDETC2004/DTM-57513, Salt Lake City, Utah.. 3bGQ. ɫɦh\t`YJ$&;ȎȊȃǚ ɬɦŤȿÉ)ɋư 9ɧŷ(ŊƗ<;ȎȊŲ)ǶÞ ɭɦƱ&;AzIZJXnÜú)ƈȬ'8;lsY\y[ lsY\)ŠǀÉ ȎȊǯ*ɧɪɦɱɭɦ'ǁƾȄ'ô!"ɧȎćé ɝ Ƕéɝ) % ɧ%)Ŭš?ûţ;*ǥ ä<+ɧ8:ȃƉ'ÎȈ ħ9<;8'&;) ɧ $İõ?ħ;ɨ)ǠŰɧȎȊǯ Ȏćéɝ?Ȅƶ ɧ8:Ƕéɝ/$ŖǶ;ȻDŽ?ŕŏ;ɨ. # LSI kjvTKl ŌŲĹƍ?ɧCincom Smalltalk (Visualworks 7.4)?ƪ "ĈȀɧQSZk LSI )ȎȊ'ȿƪɨ)ǠŰ?ðɰ 'ǁɨ éɝ?ćǭƅɏ#*ɧȂɒ&£ĄɊ¥'8"Ċš' Ȉ& éɝɥðɰ ɪɨɦ'Č"ɧQSZk*°DZÇ #JrSWsxK 8-Ĺķ:ŤďÉ'8"ŸȸÉɥð ɰ ɫɨɦɧFiPER #ĈǻÖǰ&wzJdvz'ûō;ɥð ɰ ɬɨɦɨţ'QSZk*ɧDZÇ#ȈňǛ?ǻ$'8 "ɧýŹ&ȎȊȈ)Ų?ɧȎȊǯ/$Ōǁ;ɥðɰ ɭɨɦɨ & ɧƥƅɏ' "*ɧDZÇwzJdvzĈǻ 8-DZÇ ȈňǛ*ɧQSZk LSI °ž)ȿƪ2#ĈȀ#

(64) "&ɨ )5ɧðɰ ɬɨ'ǁwzJdvz 8-ɭɨ'ǁ ňǛȈ*ɧlmsXYf)3?Čȝ$ȎȊȈ#;ɨ. 10.. `   o ȎȊ' ;ǶéɝȎć?ŕŏ;5'ɧɤȷ&Ȑǻ ɆȖĹƍ?ŌŲɧƧø?ĈȀɨƥò*ɧlmsXYf )3?Čȝ$ȎȊ2# ĈǻÖǰ#*& ɧǀ ' {ȹ)Ĺƍ?ǩ;$#ɧȎćéɝ'Č;ȈǏ*ȯ ȷ'ħ9<;$ ¸ ɨ’Ħ*ɧ° LSI ?Čȝ$ ȎȊ'Ǔï?Ĝɧéɝćǭ)Ŗë?%)8'ŕŏ#

(65) ;. % ?ŵȏ;‰ć#;ɨ. q   s ũƿLJ*ɧşũąǼńdzœ Ǎ 177 Ăæœ 8- Dassault Systemes Simulia Corp.8:ɧȠɃ&ȜȚ$Mlx\?əɨ 'Ɠ Ĩǂ?ƭ;ɨ. 11.. 12.. 13.. Allison, J. T., Kokkolaras, M., and Papalambros, P. Y., 2007, “On Selection of Single-Level Formulations for Complex System Design Optimization,” ASME ฀ pp. 898–906..

(66)

参照

関連したドキュメント

As soon as an Analytic Engine exists, it will necessarily guide the future course of the

Provided that the reduction of the time interval leads to incomparableness of normalized bubble-size distributions and does not change the comparable distributions in terms of

We have studied the effects of different treatment regimens on both the tumour growth and the immune response within the simple ODE model that describes tumour-immune dynamics

Note that the assumptions of that theorem can be checked with Theorem 2.2 (cf. The stochastic in- tegration theory from [20] holds for the larger class of UMD Banach spaces, but we

In Section 5 we give some concluding remarks, shortly discuss the different weight condition for characterizing the Hardy in- equality and prove a two-dimensional Minkowski

Thus, the present study is actually quite different and can be considered as an improvement of [6] and a generalization of [3] to quasilinear (monotone operators in the gradient)

The study of the eigenvalue problem when the nonlinear term is placed in the equation, that is when one considers a quasilinear problem of the form −∆ p u = λ|u| p−2 u with

Garaev, On a variant of sum-product estimates and explicit exponential sum bounds in prime fields, Math.. Garaev, The sum-product estimates for large subsets of prime