UG018 Powerpc 405 Processor Block Reference Guide

Total Page:16

File Type:pdf, Size:1020Kb

UG018 Powerpc 405 Processor Block Reference Guide PowerPC 405 Processor Block Reference Guide Embedded Development Kit UG018 (v2.1) July 20, 2005 R R Xilinx is disclosing this Specification to you solely for use in the development of designs to operate on Xilinx FPGAs. Except as stated herein, none of the Specification may be copied, reproduced, distributed, republished, downloaded, displayed, posted, or transmitted in any form or by any means including, but not limited to, electronic, mechanical, photocopying, recording, or otherwise, without the prior written consent of Xilinx. Any unauthorized use of this Specification may violate copyright laws, trademark laws, the laws of privacy and publicity, and communications regulations and statutes. Xilinx does not assume any liability arising out of the application or use of the Specification; nor does Xilinx convey any license under its patents, copyrights, or any rights of others. You are responsible for obtaining any rights you may require for your use or implementation of the Specification. Xilinx reserves the right to make changes, at any time, to the Specification as deemed desirable in the sole discretion of Xilinx. Xilinx assumes no obligation to correct any errors contained herein or to advise you of any correction if such be made. Xilinx will not assume any liability for the accuracy or correctness of any engineering or technical support or assistance provided to you in connection with the Specification. THE SPECIFICATION IS PROVIDED “AS IS" WITH ALL FAULTS, AND THE ENTIRE RISK AS TO ITS FUNCTION AND IMPLEMENTATION IS WITH YOU. YOU ACKNOWLEDGE AND AGREE THAT YOU HAVE NOT RELIED ON ANY ORAL OR WRITTEN INFORMATION OR ADVICE, WHETHER GIVEN BY XILINX, OR ITS AGENTS OR EMPLOYEES. XILINX MAKES NO OTHER WARRANTIES, WHETHER EXPRESS, IMPLIED, OR STATUTORY, REGARDING THE SPECIFICATION, INCLUDING ANY WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, TITLE, AND NONINFRINGEMENT OF THIRD- PARTY RIGHTS. IN NO EVENT WILL XILINX BE LIABLE FOR ANY CONSEQUENTIAL, INDIRECT, EXEMPLARY, SPECIAL, OR INCIDENTAL DAMAGES, INCLUDING ANY LOST DATA AND LOST PROFITS, ARISING FROM OR RELATING TO YOUR USE OF THE SPECIFICATION, EVEN IF YOU HAVE BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. THE TOTAL CUMULATIVE LIABILITY OF XILINX IN CONNECTION WITH YOUR USE OF THE SPECIFICATION, WHETHER IN CONTRACT OR TORT OR OTHERWISE, WILL IN NO EVENT EXCEED THE AMOUNT OF FEES PAID BY YOU TO XILINX HEREUNDER FOR USE OF THE SPECIFICATION. YOU ACKNOWLEDGE THAT THE FEES, IF ANY, REFLECT THE ALLOCATION OF RISK SET FORTH IN THIS AGREEMENT AND THAT XILINX WOULD NOT MAKE AVAILABLE THE SPECIFICATION TO YOU WITHOUT THESE LIMITATIONS OF LIABILITY. The Specification is not designed or intended for use in the development of on-line control equipment in hazardous environments requiring fail-safe controls, such as in the operation of nuclear facilities, aircraft navigation or communications systems, air traffic control, life support, or weapons systems (“High-Risk Applications”). Xilinx specifically disclaims any express or implied warranties of fitness for such High-Risk Applications. You represent that use of the Specification in such High-Risk Applications is fully at your risk. © 2002-2005 Xilinx, Inc. All rights reserved. XILINX, the Xilinx logo, and other designated brands included herein are trademarks of Xilinx, Inc. All other trademarks are the property of their respective owners. Revision History The following table shows the revision history for this document. Date Version Revision 09/16/02 1.0 Initial Embedded Development Kit (EDK) release. 09/02/03 1.1 Updated for EDK 6.1 release PowerPC 405 Processor Block Reference Guide www.xilinx.com UG018 (v2.1) July 20, 2005 Date Version Revision 08/20/04 2.0 Updated to include Virtex-4 functionality. 07/20/05 2.1 • Updated Table 2-24, JTAG Instruction Register length for Virtex-4 devices: FX12, FX40, FX60. • Added (Virtex-4 only) DCREMACENABLER output port to Figure 2-29 and Table B-1. Added (Virtex-4 only) parity error detection sections for instruction cache, data cache and unified translation lookaside buffer. Introduced new privileged registers (Virtex-4 only) Core Configuration Register 1 (CCR1) and Machine Check Syndrome Register (MCSR). • Completely revised “PowerPC 405 APU Controller” in Chapter 4 including adding descriptions to figures and an entirely new section: “Flushed FCM Instructions”. UG018 (v2.1) July 20, 2005 www.xilinx.com PowerPC 405 Processor Block Reference Guide PowerPC 405 Processor Block Reference Guide www.xilinx.com UG018 (v2.1) July 20, 2005 Table of Contents Revision History . 2 Preface: About This Guide Guide Contents . 9 Additional Resources . 10 Conventions . 10 Typographical. 10 Online Document . 11 General Conventions . 12 Registers . 12 Terms. 13 Chapter 1: Introduction to the PowerPC 405 Processor PowerPC Architecture . 17 PowerPC Embedded-Environment Architecture . 18 PowerPC 405 Software Features . 21 Privilege Modes . 22 Address Translation Modes . 23 Addressing Modes . 23 Data Types . 23 Register Set Summary . 24 PowerPC 405 Hardware Organization. 26 Central-Processing Unit . 27 Exception Handling Logic . 27 Memory Management Unit . 27 Instruction and Data Caches . 29 Timer Resources . 30 Debug. 30 PowerPC 405 Interfaces. 31 PowerPC 405 Performance. 32 Chapter 2: Input/Output Interfaces Signal Naming Conventions. 34 Clock and Power Management Interface . 35 CPM Interface I/O Signal Summary . 36 CPM Interface I/O Signal Descriptions . 37 System Design Considerations for Clock Domains . 39 CPU Control Interface. 41 CPU Control Interface I/O Signal Summary . 41 CPU Control Interface I/O Signal Descriptions . 42 Reset Interface . 43 Reset Requirements . 43 Reset Interface I/O Signal Summary . 44 PowerPC 405 Processor Block Reference Guide www.xilinx.com 5 UG018 (v2.1) July 20, 2005 R Reset Interface I/O Signal Descriptions . 45 Instruction-Side Processor Local Bus Interface . 47 Instruction-Side PLB Operation . 47 Instruction-Side PLB I/O Signal Table . 50 Instruction-Side PLB Interface I/O Signal Descriptions . 51 Instruction-Side PLB Interface Timing Diagrams . 59 Data-Side Processor Local Bus Interface . 69 Data-Side PLB Operation . 69 Data-Side PLB Interface I/O Signal Table . 72 Data-Side PLB Interface I/O Signal Descriptions . 74 Data-Side PLB Interface Timing Diagrams . 86 Device-Control Register Interfaces . 99 Internal Device Control Register (DCR) Interface . 100 Virtex-II Pro and Virtex-II ProX Processor Blocks . 100 Virtex-4-FX Processor Blocks . 101 External DCR Bus Interface . 102 External DCR Bus Interface I/O Signal Summary . 105 External DCR Bus Interface I/O Signal Descriptions . 106 External DCR Bus Interface Timing Diagrams . 107 External DCR Timing Consideration (Virtex-II Pro/ProX Only) . 110 External Interrupt Controller Interface. ..
Recommended publications
  • Xilinx XAPP545 Statistical Profiler for Embedded IBM Powerpc, Application Note
    Product Not Recommended for New Designs Application Note: Virtex-II Pro R Statistical Profiler for Embedded IBM PowerPC XAPP545 (v1.0) September 15, 2004 Author: Njuguna Njoroge Summary This application note describes how to generate statistical profiling information from the IBM PowerPC 405D, which is embedded in some Virtex-II Pro™ FPGAs. Specifically, the application note details how to convert trace output files generated from the Agilent Technologies Trace Port Analyzer into a gprof (GNU profiler) readable format. The gprof tool is capable of generating a histogram of a program's functions and a call-graph table of those functions. Introduction Profiling allows a programmer to assess where a program is spending most of its time and how frequently functions are being called. With this information, a programmer can gain insight as to what optimizations to make. In some cases, a programmer can identify bugs that would be otherwise undetectable. Using the RISCWatch application is a first step in profiling a program. Nonetheless, manually mulling through approximately 350 MB (or 8 million cycles) of trace data to discern the run-time profile of the program is a fruitless endeavor. In fact, the designers of RISCWatch realized this, so they standardized the trace output format to enable post processing of the trace. The regular format of the trace files allows scripts to parse through the trace and convert it to the gprof format. By converting the trace files into the gprof format, the widespread use of gprof in the profiling community
    [Show full text]
  • How Data Hazards Can Be Removed Effectively
    International Journal of Scientific & Engineering Research, Volume 7, Issue 9, September-2016 116 ISSN 2229-5518 How Data Hazards can be removed effectively Muhammad Zeeshan, Saadia Anayat, Rabia and Nabila Rehman Abstract—For fast Processing of instructions in computer architecture, the most frequently used technique is Pipelining technique, the Pipelining is consider an important implementation technique used in computer hardware for multi-processing of instructions. Although multiple instructions can be executed at the same time with the help of pipelining, but sometimes multi-processing create a critical situation that altered the normal CPU executions in expected way, sometime it may cause processing delay and produce incorrect computational results than expected. This situation is known as hazard. Pipelining processing increase the processing speed of the CPU but these Hazards that accrue due to multi-processing may sometime decrease the CPU processing. Hazards can be needed to handle properly at the beginning otherwise it causes serious damage to pipelining processing or overall performance of computation can be effected. Data hazard is one from three types of pipeline hazards. It may result in Race condition if we ignore a data hazard, so it is essential to resolve data hazards properly. In this paper, we tries to present some ideas to deal with data hazards are presented i.e. introduce idea how data hazards are harmful for processing and what is the cause of data hazards, why data hazard accord, how we remove data hazards effectively. While pipelining is very useful but there are several complications and serious issue that may occurred related to pipelining i.e.
    [Show full text]
  • Tanium™ Client Deployment Guide
    Tanium™ Client Deployment Guide Version 6.0.314.XXXX February 05, 2018 The information in this document is subject to change without notice. Further, the information provided in this document is provided “as is” and is believed to be accurate, but is presented without any warranty of any kind, express or implied, except as provided in Tanium’s customer sales terms and conditions. Unless so otherwise provided, Tanium assumes no liability whatsoever, and in no event shall Tanium or its suppliers be liable for any indirect, special, consequential, or incidental damages, including without limitation, lost profits or loss or damage to data arising out of the use or inability to use this document, even if Tanium Inc. has been advised of the possibility of such damages. Any IP addresses used in this document are not intended to be actual addresses. Any examples, command display output, network topology diagrams, and other figures included in this document are shown for illustrative purposes only. Any use of actual IP addresses in illustrative content is unintentional and coincidental. Please visit https://docs.tanium.com for the most current Tanium product documentation. Tanium is a trademark of Tanium, Inc. in the U.S. and other countries. Third-party trademarks mentioned are the property of their respective owners. © 2018 Tanium Inc. All rights reserved. © 2018 Tanium Inc. All Rights Reserved Page 2 Table of contents Overview 8 What is the Tanium Client? 8 Registration 9 Client peering 9 File distribution 11 Prerequisites 14 Host system requirements 14 Admin account 15 Network connectivity and firewall 16 Host system security exceptions 16 Deployment options summary 18 Using the Tanium Client Deployment Tool 21 Methods 21 Before you begin 21 Install the Client Deployment Tool 23 Deploy the Tanium Client 25 Check for Tanium Client updates 32 Troubleshooting 33 Logs 34 Advanced settings 34 Deploying the Tanium Client to Windows endpoints 36 Step 1: Create the installer 36 Step 2: Execute the installer 37 © 2018 Tanium Inc.
    [Show full text]
  • Flynn's Taxonomy
    Flynn’s Taxonomy n Michael Flynn (from Stanford) q Made a characterization of computer systems which became known as Flynn’s Taxonomy Computer Instructions Data SISD – Single Instruction Single Data Systems SI SISD SD SIMD – Single Instruction Multiple Data Systems “Vector Processors” SIMD SD SI SIMD SD Multiple Data SIMD SD MIMD Multiple Instructions Multiple Data Systems “Multi Processors” Multiple Instructions Multiple Data SI SIMD SD SI SIMD SD SI SIMD SD MISD – Multiple Instructions / Single Data Systems n Some people say “pipelining” lies here, but this is debatable Single Data Multiple Instructions SIMD SI SD SIMD SI SIMD SI Abbreviations •PC – Program Counter •MAR – Memory Access Register •M – Memory •MDR – Memory Data Register •A – Accumulator •ALU – Arithmetic Logic Unit •IR – Instruction Register •OP – Opcode •ADDR – Address •CLU – Control Logic Unit LOAD X n MAR <- PC n MDR <- M[ MAR ] n IR <- MDR n MAR <- IR[ ADDR ] n DECODER <- IR[ OP ] n MDR <- M[ MAR ] n A <- MDR ADD n MAR <- PC n MDR <- M[ MAR ] n IR <- MDR n MAR <- IR[ ADDR ] n DECODER <- IR[ OP ] n MDR <- M[ MAR ] n A <- A+MDR STORE n MDR <- A n M[ MAR ] <- MDR SISD Stack Machine •Stack Trace •Push 1 1 _ •Push 2 2 1 •Add 2 3 •Pop _ 3 •Pop C _ _ •First Stack Machine •B5000 Array Processor Array Processors n One of the first Array Processors was the ILLIIAC IV n Load A1, V[1] n Load B1, Y[1] n Load A2, V[2] n Load B2, Y[2] n Load A3, V[3] n Load B3, Y[3] n ADDALL n Store C1, W[1] n Store C2, W[2] n Store C3, W[3] Memory Interleaving Definition: Memory interleaving is a design used to gain faster access to memory, by organizing memory into separate memories, each with their own MAR (memory address register).
    [Show full text]
  • Computer Organization & Architecture Eie
    COMPUTER ORGANIZATION & ARCHITECTURE EIE 411 Course Lecturer: Engr Banji Adedayo. Reg COREN. The characteristics of different computers vary considerably from category to category. Computers for data processing activities have different features than those with scientific features. Even computers configured within the same application area have variations in design. Computer architecture is the science of integrating those components to achieve a level of functionality and performance. It is logical organization or designs of the hardware that make up the computer system. The internal organization of a digital system is defined by the sequence of micro operations it performs on the data stored in its registers. The internal structure of a MICRO-PROCESSOR is called its architecture and includes the number lay out and functionality of registers, memory cell, decoders, controllers and clocks. HISTORY OF COMPUTER HARDWARE The first use of the word ‘Computer’ was recorded in 1613, referring to a person who carried out calculation or computation. A brief History: Computer as we all know 2day had its beginning with 19th century English Mathematics Professor named Chales Babage. He designed the analytical engine and it was this design that the basic frame work of the computer of today are based on. 1st Generation 1937-1946 The first electronic digital computer was built by Dr John V. Atanasoff & Berry Cliford (ABC). In 1943 an electronic computer named colossus was built for military. 1946 – The first general purpose digital computer- the Electronic Numerical Integrator and computer (ENIAC) was built. This computer weighed 30 tons and had 18,000 vacuum tubes which were used for processing.
    [Show full text]
  • An Efficient and Portable SIMD Algorithm for Charge/Current Deposition in Particle-In-Cell Codes✩
    Computer Physics Communications 210 (2017) 145–154 Contents lists available at ScienceDirect Computer Physics Communications journal homepage: www.elsevier.com/locate/cpc An efficient and portable SIMD algorithm for charge/current deposition in Particle-In-Cell codesI H. Vincenti a,b,∗, M. Lobet a, R. Lehe a, R. Sasanka c, J.-L. Vay a a Lawrence Berkeley National Laboratory, 1 Cyclotron Road, Berkeley, CA, USA b Lasers Interactions and Dynamics Laboratory (LIDyL), Commissariat À l'Energie Atomique, Gif-Sur-Yvette, France c Intel Corporation, OR, USA a r t i c l e i n f o a b s t r a c t Article history: In current computer architectures, data movement (from die to network) is by far the most energy Received 9 January 2016 consuming part of an algorithm (≈20 pJ=word on-die to ≈10,000 pJ/word on the network). To increase Received in revised form memory locality at the hardware level and reduce energy consumption related to data movement, 10 August 2016 future exascale computers tend to use many-core processors on each compute nodes that will have Accepted 19 August 2016 a reduced clock speed to allow for efficient cooling. To compensate for frequency decrease, machine Available online 19 September 2016 vendors are making use of long SIMD instruction registers that are able to process multiple data with one arithmetic operator in one clock cycle. SIMD register length is expected to double every four years. As Keywords: Particle-In-Cell method a consequence, Particle-In-Cell (PIC) codes will have to achieve good vectorization to fully take advantage OpenMP of these upcoming architectures.
    [Show full text]
  • Pipeline and Vector Processing
    Computer Organization and Architecture Chapter 4 : Pipeline and Vector processing Chapter – 4 Pipeline and Vector Processing 4.1 Pipelining Pipelining is a technique of decomposing a sequential process into suboperations, with each subprocess being executed in a special dedicated segment that operates concurrently with all other segments. The overlapping of computation is made possible by associating a register with each segment in the pipeline. The registers provide isolation between each segment so that each can operate on distinct data simultaneously. Perhaps the simplest way of viewing the pipeline structure is to imagine that each segment consists of an input register followed by a combinational circuit. o The register holds the data. o The combinational circuit performs the suboperation in the particular segment. A clock is applied to all registers after enough time has elapsed to perform all segment activity. The pipeline organization will be demonstrated by means of a simple example. o To perform the combined multiply and add operations with a stream of numbers Ai * Bi + Ci for i = 1, 2, 3, …, 7 Each suboperation is to be implemented in a segment within a pipeline. R1 Ai, R2 Bi Input Ai and Bi R3 R1 * R2, R4 Ci Multiply and input Ci R5 R3 + R4 Add Ci to product Each segment has one or two registers and a combinational circuit as shown in Fig. 9-2. The five registers are loaded with new data every clock pulse. The effect of each clock is shown in Table 4-1. Compiled By: Er. Hari Aryal [[email protected]] Reference: W. Stallings | 1 Computer Organization and Architecture Chapter 4 : Pipeline and Vector processing Fig 4-1: Example of pipeline processing Table 4-1: Content of Registers in Pipeline Example General Considerations Any operation that can be decomposed into a sequence of suboperations of about the same complexity can be implemented by a pipeline processor.
    [Show full text]
  • Computer Organization Structure of a Computer Registers Register
    Computer Organization Structure of a Computer z Computer design as an application of digital logic design procedures z Block diagram view address z Computer = processing unit + memory system Processor read/write Memory System central processing data z Processing unit = control + datapath unit (CPU) z Control = finite state machine y Inputs = machine instruction, datapath conditions y Outputs = register transfer control signals, ALU operation control signals codes Control Data Path y Instruction interpretation = instruction fetch, decode, data conditions execute z Datapath = functional units + registers instruction unit execution unit y Functional units = ALU, multipliers, dividers, etc. instruction fetch and functional units interpretation FSM y Registers = program counter, shifters, storage registers and registers CS 150 - Spring 2001 - Computer Organization - 1 CS 150 - Spring 2001 - Computer Organization - 2 Registers Register Transfer z Selectively loaded EN or LD input z Point-to-point connection MUX MUX MUX MUX z Output enable OE input y Dedicated wires y Muxes on inputs of rs rt rd R4 z Multiple registers group 4 or 8 in parallel each register z Common input from multiplexer y Load enables LD OE for each register rs rt rd R4 D7 Q7 OE asserted causes FF state to be D6 Q6 connected to output pins; otherwise they y Control signals D5 Q5 are left unconnected (high impedance) MUX D4 Q4 for multiplexer D3 Q3 D2 Q2 LD asserted during a lo-to-hi clock D1 Q1 transition loads new data into FFs z Common bus with output enables D0 CLK
    [Show full text]
  • Bapco® Eecomark V2 User Guide
    BAPCo® EEcoMark v2 User Guide BAPCo is a U.S. Registered Trademark of the Business Applications Performance Corporation. EEcoMark is a U.S. Registered Trademark of the Business Applications Performance Corporation. Copyright © 2012 Business Applications Performance Corporation. All other brand and product names are trademarks or registered trademarks of their respective holders Contents 1.0 General .................................................................................................................................................... 4 1.1 Terminology ........................................................................................................................................ 4 2.0 Setup ....................................................................................................................................................... 5 2.1 Minimum System Requirements ........................................................................................................ 5 2.2 Hardware Setup .................................................................................................................................. 5 2.3 Software Setup .................................................................................................................................... 6 3.0 Configuration .......................................................................................................................................... 7 3.1 Guidelines ..........................................................................................................................................
    [Show full text]
  • Perceptive – Installing Imagenow Client on a Workstation
    Perceptive – Installing ImageNow client on a workstation Installing the ImageNow client on a workstation PURPOSE – Any computer that is going to be used to scan or import documents into Avatar will need ImageNow installed. Monterey is hosted by Netsmart and requires that VPN Checkpoint be established prior to initiating ‘Launch POS Scan’ from within Avatar. 1. Installing the ImageNow Client • Open the ImageNow Client Build 6.7.0 (Patch Build 3543) > right click and select “run as Administrator” even if you use your $ account. Avatar – After hitting “launch POS” it should auto connect to the Sunflower screen but if it does not. Error msg = “Failed to load image now client”, it could be that it was installed incorrectly. If installed incorrectly, Uninstall program from control panel and then reinstall the ImageNow Client 6.7.0 (Patch Build 3543).exe • On the Welcome to the Installation Wizard dialog, click Next. • Enable the following icons to be installed: o ImageNow Client Files o Demo Help o Administrator Help o Support for Viewing Non-graphic Data o ImageNow Printer (this is not selected by default) Note: the picture below does not have the ImageNow Printer selected. • On the License Agreement window, scroll down to the bottom of the License Agreement and accept the terms of the License Agreement to activate the Next button. • All sub features will be installed on the local hard drive, click Next. • On the Default connection Profile window, enter the following information and then click Next. o Name: Monterey PROD o Server ID: montereyimagenow.netsmartcloud.com o Server Type: Test o Port Number: 6000 The default information entered above creates the connection profiles below: Monterey Perceptive - Installing ImageNow v3 0(Installing the ImageNow Client onto a workstation) 1 | Page Plexus Foundations Perceptive – Installing ImageNow client on a workstation • Select the Next twice, and then Install.
    [Show full text]
  • Computer Architectures
    Parallel (High-Performance) Computer Architectures Tarek El-Ghazawi Department of Electrical and Computer Engineering The George Washington University Tarek El-Ghazawi, Introduction to High-Performance Computing slide 1 Introduction to Parallel Computing Systems Outline Definitions and Conceptual Classifications » Parallel Processing, MPP’s, and Related Terms » Flynn’s Classification of Computer Architectures Operational Models for Parallel Computers Interconnection Networks MPP’s Performance Tarek El-Ghazawi, Introduction to High-Performance Computing slide 2 Definitions and Conceptual Classification What is Parallel Processing? - A form of data processing which emphasizes the exploration and exploitation of inherent parallelism in the underlying problem. Other related terms » Massively Parallel Processors » Heterogeneous Processing – In the1990s, heterogeneous workstations from different processor vendors – Now, accelerators such as GPUs, FPGAs, Intel’s Xeon Phi, … » Grid computing » Cloud Computing Tarek El-Ghazawi, Introduction to High-Performance Computing slide 3 Definitions and Conceptual Classification Why Massively Parallel Processors (MPPs)? » Increase processing speed and memory allowing studies of problems with higher resolutions or bigger sizes » Provide a low cost alternative to using expensive processor and memory technologies (as in traditional vector machines) Tarek El-Ghazawi, Introduction to High-Performance Computing slide 4 Stored Program Computer The IAS machine was the first electronic computer developed, under
    [Show full text]
  • UTP Cable Connectors
    Computer Architecture Prof. Dr. Nizamettin AYDIN [email protected] MIPS ISA - I [email protected] http://www.yildiz.edu.tr/~naydin 1 2 Outline Computer Architecture • Overview of the MIPS architecture • can be viewed as – ISA vs Microarchitecture? – the machine language the CPU implements – CISC vs RISC • Instruction set architecture (ISA) – Basics of MIPS – Built in data types (integers, floating point numbers) – Components of the MIPS architecture – Fixed set of instructions – Fixed set of on-processor variables (registers) – Datapath and control unit – Interface for reading/writing memory – Memory – Mechanisms to do input/output – Memory addressing issue – how the ISA is implemented – Other components of the datapath • Microarchitecture – Control unit 3 4 Computer Architecture MIPS Architecture • Microarchitecture • MIPS – An acronym for Microprocessor without Interlocking Pipeline Stages – Not to be confused with a unit of computing speed equivalent to a Million Instructions Per Second • MIPS processor – born in the early 1980s from the work done by John Hennessy and his students at Stanford University • exploring the architectural concept of RISC – Originally used in Unix workstations, – now mainly used in small devices • Play Station, routers, printers, robots, cameras 5 6 Copyright 2000 N. AYDIN. All rights reserved. 1 MIPS Architecture CISC vs RISC • Designer MIPS Technologies, Imagination Technologies • Advantages of CISC Architecture: • Bits 64-bit (32 → 64) • Introduced 1985; – Microprogramming is easy to implement and much • Version MIPS32/64 Release 6 (2014) less expensive than hard wiring a control unit. • Design RISC – It is easy to add new commands into the chip without • Type Register-Register changing the structure of the instruction set as the • Encoding Fixed architecture uses general-purpose hardware to carry out • Branching Compare and branch commands.
    [Show full text]