1 / 108

Lower Power Embedded Architecture Design

Lower Power Embedded Architecture Design. 성균관대학교 조 준 동 교수 , 1999. 8 http://vada.skku.ac.kr . Contents. Embedded Systems Design and Optimization of ASIP (Application Specific Instruction Processor) Hardware and Software Codesign Reconfigurable Processors

radwan
Télécharger la présentation

Lower Power Embedded Architecture Design

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Lower Power Embedded Architecture Design 성균관대학교 조 준 동 교수, 1999. 8 http://vada.skku.ac.kr SungKyunKwan Univ.

  2. Contents • Embedded Systems • Design and Optimization of ASIP (Application Specific Instruction Processor) • Hardware and Software Codesign • Reconfigurable Processors • Ultra-Low-Power Domain-Specific MULTIMEDIA PROCESSORS • Reconguration for Power Savingin Real-Time Motion Estimation • Kernel Scheduling in Reconfigurable Computing SungKyunKwan Univ.

  3. Low Power MPU SungKyunKwan Univ.

  4. Levels for Low Power Design SungKyunKwan Univ.

  5. Present- Day Digital Systems • Current systems are complex and heterogenous Contain many different types of components • Programmable and Re-configurable processors • Application- specific integrated circuits (ASICs) • Application-specific Instruction processor (ASIP) • Read- Only Memory (ROM) and RAM • I/ O devices and circuitry • Typically designed from a (large) software specification • These heterogenous systems are called embedded systems SungKyunKwan Univ.

  6. Embedded System Characteristics • Limited user programmability • Completely transparent to user, e. g. automotive engine control • Limited user interface e. g., intelligent telephones • Programmable through application specific language e.g.,postscript printer • Real- time response No batch processing SungKyunKwan Univ.

  7. Embedded Systems: Products - 1 • Consumer Electronics • HDTV • CD player • video game • video tape recorder • programmable TV • camera • music system Computer Related personal digital assistant printer disc drive multimedia subsystem graphics subsystem graphics terminal • Communications • cellular phone • video phone • fax • modems • PBX SungKyunKwan Univ.

  8. Embedded Systems: Products - 2 • Control Systems • Automotive:engine, ignition, brake system • Manufacturing process control: robotics • Remote control: satellite control, spacecraft control • Other mechanical control: elevator control • Office Equipment • smart copier, printer, smart typewriter, calculator • point- of- sale equipment,credit- card validator,UPC code reader, cash register • Medical Applications: instruments( EKG, EEG), scanning, imaging SungKyunKwan Univ.

  9. Problem Domain Shift SungKyunKwan Univ.

  10. Embedded System Trends - I • Microcomponents grow in importance in IC industry due to their reusability: DSP, m P, m C • More embedded systems will require ASICs • From 20- 70% in 1992 to 60- 70% in 1996 Moral of the story: u-P are joining with high- speed highly-complex ASIC in embedded systems SungKyunKwan Univ.

  11. Embedded System Trends - II • Embedded systems will require more application software • Average moves from 16- 64k lines in 1992 to 64k-512k in 1996 • Requires migration from assembler to C/ C++, implying requirement for automatic compilation • From 40- 70% of programmers versus ASIC designers in 1992 to 60- 90% in 1996 Moral of the story: Increase in code- size / code- complexity is causing a migration to C/ C++ from assembly coding SungKyunKwan Univ.

  12. Embedded Software Optimization • Code size becomes an important objective Software will eventually become a part of the chip: • Need to generate the best possible code • Can afford longer compilation time • Need not only traditional optimization techniques, but also new application- domain-specific optimizations (e. g., DSP and microcontroller architectures) SungKyunKwan Univ.

  13. Implementing Digital Systems SungKyunKwan Univ.

  14. What is an ASIP? • Application- Specific Instruction Processor • Processor architecture tailored not just for application domain (e. g., DSP, microcontrollers), but for specific sets of applications (e. g., audio, engine control) • ASIP characteristics • Greater design cost (processor + compiler) • + Higher performance, lower power than commercial cores, more flexibility than ASIC SungKyunKwan Univ.

  15. ASIP Design • Given a set of applications, determine m architecture of ASIP (i. e., configuration of functional units in datapaths, instruction set) • To accurately evaluate performance of processor on a given application need to compile the application program onto the processor datapath and simulate object code • However, the m architecture of the processor is a design parameter! SungKyunKwan Univ.

  16. Processor Design Flow SungKyunKwan Univ.

  17. Required Compiler Optimizations • Machine independent optimizations • Parallelizing transformations (lots of them!) Common subexpression elimination, Strength reduction, Code motion • Machine dependent optimizations • Loop unrolling and software pipelining • Static allocation (non- recursive procedure calls) • Storage layout (arrays, scalars) • Optimization of mode setting instructions • ® Instruction selection, scheduling, and register allocation SungKyunKwan Univ.

  18. Parallelizing Transformation SungKyunKwan Univ.

  19. Split- Node DAG SungKyunKwan Univ.

  20. Split- Node DAG - 2 • Split- Node DAG represents: • All the legal assignments of basic block nodes to functional units • The data transfers implied by pairs of assignments of basic block nodes connected by an edge • Goal is to find parallelism in the basic block, which can be exploited by the target architecture • Implies grouping operator nodes and data transfer nodes into VLIW instructions • Constraints may disallow certain groupings SungKyunKwan Univ.

  21. Split- Node DAG - 3 SungKyunKwan Univ.

  22. Parallelism Matrix SungKyunKwan Univ.

  23. Common Subexpression Elimination SungKyunKwan Univ.

  24. Constant Propagation and Folding SungKyunKwan Univ.

  25. Dead Code Elimination SungKyunKwan Univ.

  26. Loop Invariant Code Motion SungKyunKwan Univ.

  27. Array Access Strength Reduction SungKyunKwan Univ.

  28. Features of DSP Architectures • DSPs have irregular data- paths • Instruction- set architecture tailored for DSP applications • Limited addressing capability • Autoincrement/ decrement • Bit- reversed addressing • Zero- overhead loops • Some degree of parallelism, e. g., Motorola 56K’s parallel moves. SungKyunKwan Univ.

  29. Example: TMS320C25 DSP SungKyunKwan Univ.

  30. Storage Assignment SungKyunKwan Univ.

  31. Alternative Assignment SungKyunKwan Univ.

  32. Simple Offset Assignment • Assumptions in Simple Offset Assignment (SOA): • Variables reside in memory and are accessed via a single address register • One- to- one mapping of variables to memory locations • A schedule for the basic block is given SungKyunKwan Univ.

  33. Access Sequence SungKyunKwan Univ.

  34. Access Graph SungKyunKwan Univ.

  35. Assignment and Access Graph SungKyunKwan Univ.

  36. Maximum Weighted Path Covering SungKyunKwan Univ.

  37. Optimal Disjoint Path Cover SungKyunKwan Univ.

  38. Code Generation and Optimization • Focus on automatic retargetability and parameterizable optimization methods • Instruction selection for configurable functional units • Scheduling for multiple functional units • Register bank allocation to minimize data transfers • Detailed register allocation with varying load/ spill costs • Optimization to exploit address generator features • Goal is to be able to generate high- quality code for any target architecture description WHEN THAT HAPPENS, CAD IS GOING TO ESSENTIALLY BECOME SOFTWARE COMPILATION !! SungKyunKwan Univ.

  39. The 100 Million Transistor Question HOW BEST CAN WE USE THEM TO SOLVE OUR COMPUTING PROBLEMS ? SungKyunKwan Univ.

  40. Answer I: Multiprocessor on a chip Requirement: Efficient, parallelizing compiler Problems: Enough parallelism in programs? Does not go fast enough for video applications, for instance. SungKyunKwan Univ.

  41. Answer II: Giant FPGA Requirement: CAD system for FPGAs Problems: May work well for bit- level video computations, but in general FPGAs are inefficient. SungKyunKwan Univ.

  42. Answer III: HW/SW Codesign SungKyunKwan Univ.

  43. Mixing Hardware and Software • Argument: Mixed hardware/ software systems represent the best of both worlds. High performance, flexibility, design reuse, etc. • Counterpoint: From a design standpoint, it is the worst of both worlds • Problems of verification, and test become harder • Too many tools, too many interactions, too much heterogeneity • Hardware/ software partitioning is “AI- complete”! SungKyunKwan Univ.

  44. Hardware/Software Co-design I.K.Hwang. San Kim, J.D.Cho • Co-design 이란… • Hardware와 software가 복합된 시스템을 체계적이며 효율적으로 설계하기 위해서 제안. • Hardware 구현 : 비용 증가, 수행시간 빠름. • Software 구현 : 비용 감소, 수행시간 늦음. • Co-design시 고려 사항. • Hardware/Software partitioning • Hardware/Software interface • Co-simulation SungKyunKwan Univ.

  45. Partitioning • Performance Requirements • 몇몇의 Function들은 Hardware로의 구현이 더 용이 • 반복적으로 사용되는 Block • Parallel하게 구성되어 있는 Block • Modifiability • Software로 구성된 Block은 변형이 용이 SungKyunKwan Univ.

  46. Continued • Implementation Cost • Hardware로 구성된 Block은 공유해서 사용이 가능 • Scheduling • 각각 HW와 SW로 분리된 Block들을 정해진 constraints들에 맞출 수 있도록 scheduling • SW Operation은 순차적으로 scheduling되어야 한다 • Data와 Control의 의존성만 없다면 SW와 HW는 Concurrent하게 scheduling SungKyunKwan Univ.

  47. Interface • Interface Block의 필요성 • Hardware와 Software Block간의 Data 전달 • 효율적인 Interface Block 을 구성해야만 HW/SW Block간의 Overhead를 줄일 수 있다 • Interface 방법 • Shared Memory • FIFO • Handshaking protocol SungKyunKwan Univ.

  48. Logical Bus Architecture • System Bus Signals • address, data, control signals • address space consists of the memory space & I/O space • memory space : memory of the SW component • I/O space : ports within SW & registers in other HW • Port Signals • These are specialized signals capable of directly interfacing between SW & HW component • Interrupt Signals • When SW & HW components have completed an operation, or when an error condition is detected SungKyunKwan Univ.

  49. Co-simulation • Co-simulation의 필요성 • HW part와 SW part를 함께 Simulation을 할 수 있게 해 줌으로써 구성된 System의 결과를 예측할 수 있다 • System Performance를 예측하여 Synthesis 이전에 지정된 Spec.에 맞도록 System을 재설계할 수 있도록 해 준다 • HW/SW Partitioning을 위한 각 Sub-block의 특성을 예측해 준다 • Co-simulation Tool • Ptolemy • COSSAP • POLIS SungKyunKwan Univ.

  50. Cossap • SW, HW Co-simulation Tool • SW : C-code(Generic C) • HW : VHDL • Data Flow 형태의 Simulation • block diagram형태로 System 구현 • Simulation Report • 출력을 Waveform 형태로 표시 • System의 Speed를 예측 SungKyunKwan Univ.

More Related