Brock-Nannestad, Laust

Karlsson, Sven

Passas, Stavros

Online Research Database In Technology

                       General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights.  • Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication in the public portal   If you believe that this document breaches copyright please contact us providing details, and we will remove access to the work immediately and investigate your claim.     Downloaded from orbit.dtu.dk on: Dec 19, 2017Effcient Co-Simulation of Multicore SystemsBrock-Nannestad, Laust; Passas, Stavros; Karlsson, SvenPublication date:2011Document VersionPublisher's PDF, also known as Version of recordLink back to DTU OrbitCitation (APA):Brock-Nannestad, L., Passas, S., & Karlsson, S. (2011). Effcient Co-Simulation of Multicore Systems. Postersession presented at 4th Swedish Workshop on Multicore Computing, Linköping, Sweden.Efficient Co-Simulation of Multicore SystemsLaust Brock-Nannestad, Stavros Passas and Sven KarlssonTechnical University of DenmarkWorkflowMotivationI Simulation of hardware helps debugging by exposing a hardware design’sinner operationI Simulation speed significantly slower than the actual hardwareimplementationICan we simulate at hardware speeds?I by default use FPGA to simulate at high speedI switch to a software simulator where visibility is requiredContributionsIA method for debugging and co-simulation of hardware designs at close toreal-time hardware speedsIA mechanism for transparently capturing and moving state between FPGAand software simulatorIPerformance evaluation and validation using two circuitsApproachIWe capture the state of the FPGA and transfer it to our softwareIThe state is injected into a software simulation model and simulation isresumed from the point of captureIWe perform the reverse process; transfer state from software simulationmodel back into the FPGAIThe hardware design is augmented with a small ”capture” core whichinitiates a captureIWe rely on capture and readback functionality implemented by FPGAConclusionsIWe implemented a method for co-simulation of hardware designs usingsoftware simulator and FPGAIWe validated our approach using a small circuit in a single FPGAIOur evaluation of performance shows co-simulation is beneficial for longsimulation timesFuture WorkIConsider state of components external to the FPGA – e.g. memoriesIHandle all complex HDL constructs such as state encodings chosen by thesynthesis toolIAllow for multiple FPGAsExperimental setupIExperiments were carried out on a Xilinx Spartan-3AN FPGA @ 50 MHzIModelSim 6.5 was used for simulationsIWe used generic low-cost JTAG dongle for all communication with FPGAITwo hardware designs were implemented using VHDLIA small design used to validate correctnessIA large design to evaluate performanceResourceHDL DesignValidation EvaluationSlice Flip-flops 64 381LUTs 42 1691Block RAMs 1 16Table: Resource utilization for the two FPGA designs.ResultsITo evaluate performance we compare execution time of 50,000,000 cyclesin the software simulator and on FPGAIWe see that hardware is more than 300 times faster than simulationIWe also measure the time from hardware description to running simulationand from hardware description to running FPGAIFinally, we measure the time to transfer the state between hardware andsoftware, when executing our workflowTaskExecution time (seconds)Validation EvaluationSimulate 50,000,000 cycles 104 355Run 50,000,000 cycles on FPGA 1 1Generate initial bitstream 58 309Download of bitstream 1 1Readback and parse 33 37Update simulation model 4 N/ACompile in ModelSim 1 4Regeneration of bitstream 13 33Table: Execution times for baseline and steps in the workflow.IGenerating initial bitstream is very slow due to synthesis and mappingI It only has to take place onceI Subsequent modifications to bitstream are fast as we only alter initialstates of flip-flops and block memoriesIFor short simulation times, the faster compile time of the softwaresimulator is beneficial, despite slow simulation speedIRegular software simulation is 300 times slower than execution on theFPGA — one second on FPGA takes 355 seconds to simulateDTU Informatics - Technical University of Denmark laustbn@acm.org http://www.imm.dtu.dk

Effcient Co-Simulation of Multicore Systems

http://orbit.dtu.dk/ws/files/6339179/laust_poster_final.pdf

Effcient Co-Simulation of Multicore Systems

Abstract

Similar works

Full text

Available Versions

Online Research Database In Technology