9 research outputs found

    λΉ λ₯Έ μ„±λŠ₯쑰건 λ§Œμ‘±μ„ μœ„ν•œ μž„κ³„κ²½λ‘œλ₯Ό κ³ λ €ν•˜λŠ” μƒμœ„ μˆ˜μ€€ ν•©μ„±

    Get PDF
    ν•™μœ„λ…Όλ¬Έ (박사)-- μ„œμšΈλŒ€ν•™κ΅ λŒ€ν•™μ› : 전기·컴퓨터곡학뢀, 2014. 2. 졜기영.Rapid advancement of process technology enables designers to integrate various functions onto a single chip and to realize diverse requirements of customers, but productivity of system designers has improved too slowly to make optimal design in time-to-market. Since designing at higher levels of abstraction reduces the number of design instances to be considered to acquire an optimal design, it improves quality of system as well as reduces design time and cost. High-level synthesis, which maps behavioral description models to register-transfer models, can improve design productivity drastically, and thus, it has been one of the important issues in electronic system level design. Centralized controllers commonly used in high-level synthesis often require long wires and cause high load capacitance, and that is why critical paths typically occur on paths from controllers to data registers instead of paths from data registers to data registers. However, conventional high-level synthesis has focused on delays within a datapath, making it difficult to solve the timing closure problem during physical synthesis. This thesis presents hardware architecture with a distributed controller, which makes the timing closure problem much easier. A novel critical-path-aware high-level synthesis flow is also presented for synthesizing such hardware through datapath partitioning, register binding, and controller optimization. We explore the design space related to the number of partitions, which is an important design parameter for target architecture. According to our experiments, the proposed approach reduces the critical path delay excluding FUs by 29.3% and that including FUs by 10.0%, with 2.2% area overhead on average compared to centralized controller architecture. We also propose two approaches, clock gating and register constrained flow, to alleviate high peak current problem which is caused by the proposed approach. These approaches suppress the peak current overhead to keep it less than 3.6%.Chapter 1 Introduction 1 Chapter 2 Background 7 2.1 High-level Synthesis 7 2.2 Subtasks of High-level Synthesis 8 2.2.1 Operation Scheduling and FU Binding 8 2.2.2 Register Binding 10 2.2.3 Controller Synthesis 11 2.2.4 Functional Pipelining Technique for High-level Synthesis 11 2.3 Centralized Controller Architecture 12 2.4 Design Closure Problem in High-level Synthesis 15 2.5 Thesis Contribution 18 Chapter 3 Target Architecture and Overall flow 21 3.1 Target Architecture 21 3.2 Overall flow 23 Chapter 4 Critical-Path-Aware Datapath Partitioning 27 4.1 Introduction 27 4.2 Problem Formulation 30 4.3 Proposed Algorithm 32 4.4 Exploring Design Space for the Number of Partitions 36 Chapter 5 Critical-Path-Aware Register Binding 39 5.1 Introduction 39 5.2 Problem Formulation 40 5.3 Proposed Algorithm 43 Chapter 6 Critical-Path-Aware Controller Optimization 49 6.1 Introduction 49 6.2 Problem Formulation 50 6.3 Proposed Algorithm 55 Chapter 7 Evaluation 63 7.1 Experimental Setup 63 7.2 Design Parameters and Computation Time 66 7.3 Analysis Critical Path Delay on Distributed Controller Architecture 68 7.4 Analysis of Performance and Area 70 7.5 Energy Consumption 78 7.6 Analysis on Register Overhead 80 7.6.1 Clock Gating Approach 81 7.6.2 Register Constrained Approach 84 7.6.3 Combined Approach 86 7.7 Join to Conventional Optimization Techniques on HLS 87 7.8 Comparison with DRFM Binding Approach 87 Chapter 8 Conclusion and Future Work 89 8.1 Summary 89 8.2 Future Work 90 Bibliography 93 Abstract in Korean 103Docto

    Personal rights infringement and liability on the internet

    No full text
    ν•™μœ„λ…Όλ¬Έ(석사)--μ„œμšΈλŒ€ν•™κ΅ λŒ€ν•™μ› :법학과 민법전곡,2005.Maste

    μƒμœ„ μˆ˜μ€€ ν•©μ„±μ—μ„œ 체계적인 루프 νŒŒμ΄ν”„λΌμ΄λ‹κ³Ό μ „κ°œμ˜ 적용

    No full text
    ν•™μœ„λ…Όλ¬Έ(석사) --μ„œμšΈλŒ€ν•™κ΅ λŒ€ν•™μ› :μ „κΈ°. 컴퓨터곡학뢀, d2008.2.Maste

    Zeng Gong’s Social Poems

    No full text

    Penoscrotal reconstruction with gracilis muscle flap and internal pudendal artery perforator flap transposition

    No full text
    OBJECTIVE: Extensive defects of the perineal area, with exposure of the testes, are difficult to reconstruct. For the reconstruction of these defects, we applied gracilis muscle flap combined with pudendal artery perforator fasciocutaneous flap, which provided us a reliable cutaneous flap and allowed us to cover exposed testes with sufficient muscular volume. METHODS: We retrospectively analyzed 7 patients from 2004-2011 whose penoscrotal defects had been reconstructed using gracilis muscle flap and an internal pudendal artery perforator flap. Six had Fournier's gangrene and 1 had extramammary Paget's disease. We examined characteristics of the patients, preoperative management, operative procedure, and their clinical courses. RESULTS: All flaps survived during the entire follow-up periods. The mean width of the defects was 10.14 cm and the mean length was 9.29 cm. The width of the fasciocutaneous flap was approximately 6-10 cm, whereas the length ranged from 10-15 cm. The reconstructed areas were in good functional and esthetic conditions. CONCLUSION: The combination of the gracilis muscle flap and the internal pudendal artery perforator fasciocutaneous flap provides pliable and reliable soft tissue coverage for extensive penoscrotal defects with adequate bulkiness and minimal donor site morbidity.ope
    corecore