ebook img

UNIVERSITY OF CALIFORNIA Santa Barbara Ant Colony Metaheuristics for Fundamental ... PDF

200 Pages·2007·0.91 MB·English
by  
Save to my drive
Quick download
Download
Most books are stored in the elastic cloud where traffic is expensive. For this reason, we have a limit on daily download.

Preview UNIVERSITY OF CALIFORNIA Santa Barbara Ant Colony Metaheuristics for Fundamental ...

UNIVERSITY OF CALIFORNIA Santa Barbara Ant Colony Metaheuristics for Fundamental Architectural Design Problems A Dissertation submitted in partial satisfaction of the requirements for the degree Doctor of Philosophy in Electrical and Computer Engineering by Gang Wang Committee in charge: Professor Ryan Kastner, Chair Professor Malgorzata Marek-Sadowska Professor Steve Butner Professor Elaheh Bozorgzadeh Professor Timothy Sherwood September 2007 ThedissertationofGang Wangis approved: Chair Date Date Date Date Date UniversityofCalifornia, SantaBarbara September2007 AntColonyMetaheuristicsforFundamentalArchitectural DesignProblems Copyright2007 by GangWang iii To my wife Fang Liu, my children James, Justin, Jocelyn, and my parents Tihao Wang and Shuchun Li. iv Abstract AntColonyMetaheuristicsforFundamentalArchitectural DesignProblems by GangWang DoctorofPhilosophyinElectrical and ComputerEngineering UniversityofCalifornia, SantaBarbara ProfessorRyan Kastner,Chair As thefabrication technologyadvances, thenumberoftransistorsin modern computer systems keeps growing exponentially. This growth creates tremendous potential while imposingbigchallengestotheelectronicdesignautomationcommunityonhowtocon- structsuchcomplicatedsystems. Inordertoeffectivelyutilizethecomputingresources, a number of fundamental problems need to be addressed. As the scale and complexity oftheseproblemsgrow,wemustlooktowardsnewoptimizationsmethods,ratherthan simplyperform iterativeimprovementson existingtechniques. In this dissertation, I will report our research work on constructing new heuristic algorithms using the Ant Colony metaheuristicfor effectively and efficiently solving a range of difficult architectural design problems. We investigate three NP-hard prob- lemsinthiscontext,namelysystempartitioning,operationschedulinganddesignspace exploration. Results showthat Ant Colony metaheuristicis a very promisingapproach for solving these problems, and the algorithms we propose generally achieve better quality solutions with much improved stability compared to conventional methods. v Moreover,byestablishingthetheoreticallinkbetweentimingandresourceconstrained scheduling, we propose an effective design exploration framework that leverages du- ality between the scheduling problems. To our best knowledge, our work is the first extensive study on applying the Ant Colony metaheuristics to the architectural design field. vi Acknowledgments I would like to show my sincerest gratitude to my advisor Professor Ryan Kastner for giving me copious amounts of insightful guidance, constant encouragement, construc- tivecriticism, and expertise on every subject that arose throughout all these years. His enthusiasm and dedication to his students are truly inspiring; it is my very privilege to have been one of them. I would also like to thank Professor Malgorzata Marek- Sadowska,ProfessorElahehBozorgzadeh,ProfessorStevenButner,andProfessorTim Sherwood forbeingon myPh.D. committeeand forall theirhelpsalong theway. I am very thankful for the many friends and fellow students I have had at UCSB, includingAnupHosangadi,Yen Meng, Brian DeRenzi, fortheirmanystimulatingdis- cussionsandwarmfriendship. Particularly,IwanttothankWenruiGong,whoIcollab- orated with on numerous research efforts and became close friend with over the years. Withoutthem, myexperienceat UCSB won’tbeas rewardingas it is. Finally, I want to thank my wife, Fang Liu, for her love, support, encouragement, sense of humor, and for being an intelligent partner on my research journey as well. I could not have accomplished this without her. Very special thanks to my parents for theirselflessloveandsupport,and tomy lovelychildrenJames,JustinandJocelyn. vii Curriculum Vitæ GangWangwasborninShaanxi,Chinain1971. HereceivedtheBachelorofElectrical Engineering degree from Xian Jiaotong University in 1992, and Master of Computer SciencedegreefromChineseAcademyofSciencesin1995,bothinChina. From1995 to 1997, he conducted research work at Michigan State University (East Lansing, MI, US),andCarnegieMellonUniversity(Pittsburgh,PA,US),focusingonspeechandim- ageunderstanding. Since1997,Mr. Wangheldpositionsassoftwarearchitectandtech- nical manager in different leading companies ofmedical industry,includingComputer Motion,IntuitiveSurgicalandKarlStorzEndoscope. Hisworkfocusedontheresearch and development of complex surgical robotics systems, multi-modal human-computer interaction and intelligent operating room. His current research interests include re- configurableandembeddedcomputing,optimizationalgorithmsandtheirapplications, novelarchitecturaldesignforFPGAandnanocomputingplatforms,ubiquitouscomput- inganditsapplicationsinmedical/healthcaresystems. Hehasauthored orco-authored morethan20 technicalpapers in differentjournalsand conferences on related topics. RelatedPublications: BOOKS/BOOK CHAPTERS [B1] Gang Wang, Wenrui Gong, and Ryan Kastner. Operation Scheduling: Al- gorithms and Design Space Exploration, to appear in High Level Synthesis Handbook: The StateofArtspublishedbySpringer. JOURNAL ARTICLES viii [J1] Gang Wang, Wenrui Gong, Brian DeRenzi, and Ryan Kastner. Exploring Time/Resource Tradeoffs by Solving Dual Scheduling Problems with the Ant Colony Optimization, accepted by ACM Transactionson Design Automation ofElectronicSystems(TODAES). [J2] Gang Wang,Wenrui Gong, Brian DeRenzi, and Ryan Kastner. Ant Schedul- ing Algorithms for Resource and Timing Constrained Operation Scheduling, IEEETransactionsofComputer-AidedDesignofIntegratedCircuitsandSys- tems(TCAD), Vol26,Issue6, pp1010-1029,2006. [J3] GangWang,SatishSivaswamy,CristinelAbabei,KiaBazargan, Ryan Kast- ner and Eli Bozorgzadeh. Statistical Analysis and Design of HARP Routing PatternFPGAs,IEEE Transactionson Computer-AidedDesignofIntegrated CircuitsandSystems(TCAD),Vol25,Issue10,pp2088-2102,October2006. [J4] Gang Wang, Wenrui Gong and Ryan Kastner, Application Partitioning on ProgrammablePlatformsUsingtheAntColonyOptimization,JournalofEm- beddedComputing(JEC), Vol 2,Issue1, pp119-136,2006. PEER-REVIEWED CONFERENCE/WORKSHOP PAPERS [C1] Ted Huffmire, Brett Brotherton, Gang Wang, Ryan Kastner, and Tim Sher- wood. Moats and Drawbridges: An Isolation Primitive for Reconfigurable HardwareBased Systems,IEEE SymposiumonSecurityand Privacy,2007. [C2] Gang Wang, Wenrui Gong, and Ryan Kastner, On the Use of Bloom Fil- ters for Defect Maps in Nanocomputing, In International Conference on ix Computer-AidedDesign (ICCAD), 2006. [C3] GangWang,WenruiGong,BrianDeRenziandRyanKastner,DesignSpace ExplorationusingTimeandResourceDualitywiththeAntColonyOptimiza- tion,In 43rd DesignAutomationConference(DAC), 2006. [C4] Gang Wang, Wenrui Gong, and Ryan Kastner, Defect-Tolerant Nanocom- puting Using Bloom Filters for Defect Mapping, In IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM), pp 277-278, 2006. [C5] Wenrui Gong, Gang Wang and Ryan Kastner. Storage Assignment During High-levelSynthesisforConfigurableAchitectures,InInternationalConfer- ence onComputer AidedDesign(ICCAD), 2005. [C6] Gang Wang, Wenrui Gong and Ryan Kastner, Instruction Scheduling us- ing MAX-MIN Ant Optimization, In ACM Great Lakes Symposium on VLSI (GLSVLSI), 2005. [C7] SatishSivaswamy,GangWang,CristinelAbabei,KiaBazargan,RyanKast- ner, Eli Bozorgzadeh. HARP: hard-wired routing pattern FPGAs, In Pro- ceedings of the ACM/SIGDA 13th International Symposium on Field Pro- grammableGateArrays(FPGA), 2005. [C8] Wenrui Gong, Yan Meng, Gang Wang, Ryan Kastner, and Timothy Sher- wood, Data Partitioning for Reconfigurable Architectures with Distributed Block RAM, In International Conference on Engineering of Reconfigurable x

Description:
University of California, Santa Barbara Professor Ryan Kastner, Chair Science degree from Chinese Academy of Sciences in 1995, both in China. From 1995
See more

The list of books you might like

Most books are stored in the elastic cloud where traffic is expensive. For this reason, we have a limit on daily download.