Embedded Computing: A VLIW Approach to Architecture, Compilers and ToolsElsevier, 2005. gada 19. janv. - 712 lappuses The fact that there are more embedded computers than general-purpose computers and that we are impacted by hundreds of them every day is no longer news. What is news is that their increasing performance requirements, complexity and capabilities demand a new approach to their design. Fisher, Faraboschi, and Young describe a new age of embedded computing design, in which the processor is central, making the approach radically distinct from contemporary practices of embedded systems design. They demonstrate why it is essential to take a computing-centric and system-design approach to the traditional elements of nonprogrammable components, peripherals, interconnects and buses. These elements must be unified in a system design with high-performance processor architectures, microarchitectures and compilers, and with the compilation tools, debuggers and simulators needed for application development. In this landmark text, the authors apply their expertise in highly interdisciplinary hardware/software development and VLIW processors to illustrate this change in embedded computing. VLIW architectures have long been a popular choice in embedded systems design, and while VLIW is a running theme throughout the book, embedded computing is the core topic. Embedded Computing examines both in a book filled with fact and opinion based on the authors many years of R&D experience. · Complemented by a unique, professional-quality embedded tool-chain on the authors' website, http://www.vliw.org/book· Combines technical depth with real-world experience · Comprehensively explains the differences between general purpose computing systems and embedded systems at the hardware, software, tools and operating system levels. · Uses concrete examples to explain and motivate the trade-offs. |
No grāmatas satura
1.–5. rezultāts no 81.
xxxiii. lappuse
... algorithms, but always with an eye to their computing requirements and the interaction with the rest of the system. Each chapter is accompanied by a set of exercises. Following widespread practice, especially difficult exercises are ...
... algorithms, but always with an eye to their computing requirements and the interaction with the rest of the system. Each chapter is accompanied by a set of exercises. Following widespread practice, especially difficult exercises are ...
8. lappuse
... algorithms (cellular base stations). In spite of this, there are still many applications in which the “run one program only” phenomenon dominates. In these areas, radically new devices can sometimes turn around quickly from concept to ...
... algorithms (cellular base stations). In spite of this, there are still many applications in which the “run one program only” phenomenon dominates. In these areas, radically new devices can sometimes turn around quickly from concept to ...
13. lappuse
... algorithms. Superficially, general-purpose processors and DSPs are similar. Both have the usual processor trappings: registers, functional units, buses to memory, and a control mechanism (microsequenced or hardwired) that determines how ...
... algorithms. Superficially, general-purpose processors and DSPs are similar. Both have the usual processor trappings: registers, functional units, buses to memory, and a control mechanism (microsequenced or hardwired) that determines how ...
14. lappuse
... nonorthogonal ISA that is a perfect match with typical DSP algorithms, achieving very small code size and excellent energy efficiency. in assembly language, and thus it should not come as. 14 CHAPTER 1 An Introduction to Embedded ...
... nonorthogonal ISA that is a perfect match with typical DSP algorithms, achieving very small code size and excellent energy efficiency. in assembly language, and thus it should not come as. 14 CHAPTER 1 An Introduction to Embedded ...
15. lappuse
... algorithms. These tweaks come in a variety of forms, including saturating arithmetic modes, extra-wide accumulators, bit-reversed and cyclical (modulo) addressing, reuse of program memory for filter coefficient storage, zerooverhead ...
... algorithms. These tweaks come in a variety of forms, including saturating arithmetic modes, extra-wide accumulators, bit-reversed and cyclical (modulo) addressing, reuse of program memory for filter coefficient storage, zerooverhead ...
Saturs
1 | |
45 | |
83 | |
Chapter 4 Architectural Structures in ISA Design | 125 |
Chapter 5 Microarchitecture Design | 179 |
Chapter 6 System Design and Simulation | 231 |
Chapter 7 Embedded Compiling and Toolchains | 287 |
Chapter 8 Compiling for VLIWs and ILP | 337 |
Chapter 9 The Runtime System | 399 |
Chapter 10 Application Design and Customization | 443 |
Chapter 11 Application Areas | 493 |
Appendix A The VEX System | 539 |
Appendix B Glossary | 607 |
Appendix C Bibliography | 631 |
Index | 661 |
Citi izdevumi - Skatīt visu
Embedded Computing: A VLIW Approach to Architecture, Compilers and Tools Joseph A. Fisher,Paolo Faraboschi,Cliff Young Ierobežota priekšskatīšana - 2005 |
Embedded Computing: A Vliw Approach to Architecture, Compilers and Tools Joseph A. Fisher,Paolo Faraboschi,Cliff Young Priekšskatījums nav pieejams - 2004 |
Bieži izmantoti vārdi un frāzes
algorithms allow assembly language basic blocks bits branch bytes cache called Chapter chip CISC cluster cmpx compiled simulator complex components compression computing cost cycle datapath debugging decoding dependences described devices disk dynamic embedded domain embedded systems encoding engineering example exception execution Figure floating-point FPGA functional units general-purpose global hardware implementation inline instruction set integrated interface issue iterations Java latency load logic loop machine memory accesses micro-SIMD microarchitecture Multiflow multiple multiprocessing opcode operands operating system optimizations parallel path performance phase pointer pragma predication prefetch problem processor core region register allocation register file require RISC run-time Section single slots software pipelining specific speculation standard superscalar target task techniques tion today’s toolchain types typically unrolling variable vector virtual memory VLIW VLIW architectures