Please use this identifier to cite or link to this item:
DC FieldValueLanguage
dc.contributor.advisorCarrion Schafer, Benjamin (EIE)en_US
dc.contributor.advisorLau, C. M. Francis (EIE)en_US
dc.contributor.authorLiu, Shuangnanen_US
dc.descriptionxvi, 134 pages : color illustrationsen_US
dc.descriptionPolyU Library Call No.: [THS] LG51 .H577P EIE 2019 Liuen_US
dc.description.abstractDataflow computing is a computational paradigm that uses the flow of data streams to accelerate the computation of tasks. Thus, it is also known as stream computing. It is essential in multiple domains, such as image processing and digital signal processing, where data processing throughput is critical. Modern heterogeneous System on Chips (SoCs) exploit this computational paradigm to accelerate the computation of specific computationally intensive functions mapped as hardware accelerators on the SoC. Moreover, designing these accelerators in low-level hardware description languages is tedious, error-prone and takes a relatively long time. Thus, companies have started using High Level Synthesis (HLS). This thesis investigates the use of HLS to design and optimize dataflow hardware systems and uses Field Programmable Gate Arrays (FPGAs) as a test bed to demonstrate the usability of the developed methods. In particular, this thesis first investigates the effects of pin multiplexing on individual hardware accelerators given as untimed behavioral descriptions that we call Behavioral IPs (BIPs), written in C or SystemC and addresses the issues of port assignments and mappings. Next, it explores the design space of dataflow systems considering the inter-module connections to identify a set of Pareto optimal configurations as multiple conflicting objectives need to be optimized such as area and latency. Design teams now typically also prototype and emulate Application Specifc Integrated Circuit (ASIC) designs on FPGAs. Thus, we study how to automatically convert optimized dataflows for an ASIC technology to FPGAs based on machine learning techniques. The proposed method can avoid having to fully re-explore the design when an FPGA is targeted and achieves a speedup from hours to seconds while preserving the accuracy. This technique is extended to map complete dataflow systems from ASIC to FPGA platforms given full consideration of the design space of individual modules and the inter-module connections. Finally, the thesis describes a strategy to map dataflows onto runtime reconfigurable FPGAs given specific area and performance constraints.en_US
dc.description.sponsorshipDepartment of Electronic and Information Engineeringen_US
dc.publisherThe Hong Kong Polytechnic Universityen_US
dc.rightsAll rights reserved.en_US
dc.subjectData flow computingen_US
dc.subjectElectronic data processingen_US
dc.titleDesign and optimization of behavioral dataflowsen_US
dc.description.degreePh.D., Department of Electronic and Information Engineering, The Hong Kong Polytechnic University, 2019en_US
Appears in Collections:Thesis
Files in This Item:
File Description SizeFormat 
991022287148703411_link.htmFor PolyU Users168 BHTMLView/Open
991022287148703411_pira.pdfFor All Users (Non-printable)1.38 MBAdobe PDFView/Open
Show simple item record
PIRA download icon_1.1View/Download Contents

Page view(s)

Citations as of Dec 4, 2019


Citations as of Dec 4, 2019

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.