Central Processing Unit
Total Page:16
File Type:pdf, Size:1020Kb

Load more
Recommended publications
-
Pdp11-40.Pdf
processor handbook digital equipment corporation Copyright© 1972, by Digital Equipment Corporation DEC, PDP, UNIBUS are registered trademarks of Digital Equipment Corporation. ii TABLE OF CONTENTS CHAPTER 1 INTRODUCTION 1·1 1.1 GENERAL ............................................. 1·1 1.2 GENERAL CHARACTERISTICS . 1·2 1.2.1 The UNIBUS ..... 1·2 1.2.2 Central Processor 1·3 1.2.3 Memories ........... 1·5 1.2.4 Floating Point ... 1·5 1.2.5 Memory Management .............................. .. 1·5 1.3 PERIPHERALS/OPTIONS ......................................... 1·5 1.3.1 1/0 Devices .......... .................................. 1·6 1.3.2 Storage Devices ...................................... .. 1·6 1.3.3 Bus Options .............................................. 1·6 1.4 SOFTWARE ..... .... ........................................... ............. 1·6 1.4.1 Paper Tape Software .......................................... 1·7 1.4.2 Disk Operating System Software ........................ 1·7 1.4.3 Higher Level Languages ................................... .. 1·7 1.5 NUMBER SYSTEMS ..................................... 1-7 CHAPTER 2 SYSTEM ARCHITECTURE. 2-1 2.1 SYSTEM DEFINITION .............. 2·1 2.2 UNIBUS ......................................... 2-1 2.2.1 Bidirectional Lines ...... 2-1 2.2.2 Master-Slave Relation .. 2-2 2.2.3 Interlocked Communication 2-2 2.3 CENTRAL PROCESSOR .......... 2-2 2.3.1 General Registers ... 2-3 2.3.2 Processor Status Word ....... 2-4 2.3.3 Stack Limit Register 2-5 2.4 EXTENDED INSTRUCTION SET & FLOATING POINT .. 2-5 2.5 CORE MEMORY . .... 2-6 2.6 AUTOMATIC PRIORITY INTERRUPTS .... 2-7 2.6.1 Using the Interrupts . 2-9 2.6.2 Interrupt Procedure 2-9 2.6.3 Interrupt Servicing ............ .. 2-10 2.7 PROCESSOR TRAPS ............ 2-10 2.7.1 Power Failure .............. -
Appendix D an Alternative to RISC: the Intel 80X86
D.1 Introduction D-2 D.2 80x86 Registers and Data Addressing Modes D-3 D.3 80x86 Integer Operations D-6 D.4 80x86 Floating-Point Operations D-10 D.5 80x86 Instruction Encoding D-12 D.6 Putting It All Together: Measurements of Instruction Set Usage D-14 D.7 Concluding Remarks D-20 D.8 Historical Perspective and References D-21 D An Alternative to RISC: The Intel 80x86 The x86 isn’t all that complex—it just doesn’t make a lot of sense. Mike Johnson Leader of 80x86 Design at AMD, Microprocessor Report (1994) © 2003 Elsevier Science (USA). All rights reserved. D-2 I Appendix D An Alternative to RISC: The Intel 80x86 D.1 Introduction MIPS was the vision of a single architect. The pieces of this architecture fit nicely together and the whole architecture can be described succinctly. Such is not the case of the 80x86: It is the product of several independent groups who evolved the architecture over 20 years, adding new features to the original instruction set as you might add clothing to a packed bag. Here are important 80x86 milestones: I 1978—The Intel 8086 architecture was announced as an assembly language– compatible extension of the then-successful Intel 8080, an 8-bit microproces- sor. The 8086 is a 16-bit architecture, with all internal registers 16 bits wide. Whereas the 8080 was a straightforward accumulator machine, the 8086 extended the architecture with additional registers. Because nearly every reg- ister has a dedicated use, the 8086 falls somewhere between an accumulator machine and a general-purpose register machine, and can fairly be called an extended accumulator machine. -
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. -
Chapter 5 the LC-3
Instruction Set Architecture ISA = Programmer-visible components & operations • Memory organization Address space -- how may locations can be addressed? Addressibility -- how many bits per location? • Register set Chapter 5 How many? What size? How are they used? • Instruction set The LC-3 Opcodes Data types Addressing modes All information needed to write/gen machine language program Based on slides © McGraw-Hill Additional material © 2004/2005 Lewis/Martin CSE 240 5-2 LC-3 Overview: Memory and Registers LC-3 Overview: Instruction Set Memory Opcodes • Address space: 216 locations (16-bit addresses) • 16 opcodes • Addressibility: 16 bits • Operate instructions: ADD, AND, NOT, (MUL) • Data movement instructions: LD, LDI, LDR, LEA, ST, STR, STI Registers • Control instructions: BR, JSR, JSRR, RET, RTI, TRAP • Temporary storage, accessed in a single machine cycle • Some opcodes set/clear condition codes, based on result Memory access generally takes longer N = negative (<0), Z = zero (=0), P = positive (> 0) • Eight general-purpose registers: R0 - R7 Data Types Each 16 bits wide • 16-bit 2’s complement integer How many bits to uniquely identify a register? Addressing Modes • Other registers • How is the location of an operand specified? Not directly addressable, but used by (and affected by) • Non-memory addresses: register, immediate (literal) instructions PC (program counter), condition codes, MAR, MDR, etc. • Memory addresses: base+offset, PC-relative, indirect CSE 240 5-3 CSE 240 5-4 1 LC-3 Instruction Summary Operate Instructions (inside back cover) Only three operations • ADD, AND, NOT Source and destination operands are registers • Do not reference memory • ADD and AND can use “immediate” mode, (i.e., one operand is hard-wired into instruction) Will show abstracted datapath with each instruction • Illustrate when and where data moves to accomplish desired op. -
Instruction Set Architecture
Instruction Set Architecture EE3376 1 –Adapted from notes from BYU ECE124 Topics to Cover… l MSP430 ISA l MSP430 Registers, ALU, Memory l Instruction Formats l Addressing Modes l Double Operand Instructions l Single Operand Instructions l Jump Instructions l Emulated Instructions – http://en.wikipedia.org/wiki/TI_MSP430 2 –Adapted from notes from BYU ECE124 Levels of Transformation –Problems –Algorithms – C Instructions –Language (Program) –Programmable –Assembly Language – MSP 430 ISA –Machine (ISA) Architecture –Computer Specific –Microarchitecture –Manufacturer Specific –Circuits –Devices 3 –Adapted from notes from BYU ECE124 Instruction Set Architecture l The computer ISA defines all of the programmer-visible components and operations of the computer – memory organization l address space -- how may locations can be addressed? l addressibility -- how many bits per location? – register set (a place to store a collection of bits) l how many? what size? how are they used? – instruction set l Opcodes (operation selection codes) l data types (data types: byte or word) l addressing modes (coding schemes to access data) l ISA provides all information needed for someone that wants to write a program in machine language (or translate 4 from a high-level language to machine language). –Adapted from notes from BYU ECE124 MSP430 Instruction Set Architecture l MSP430 CPU specifically designed to allow the use of modern programming techniques, such as: – the computation of jump addresses – data processing in tables – use of high-level languages such as C. l 64KB memory space with 16 16-bit registers that reduce fetches to memory. l Implements RISC architecture with 27 instructions and 7 addressing modes. -
PDP-11 Conventions Manual
DEC-II-HR6A-D PDP-11 Conventions Manual DIGITAL EQUIPMENT CORPORATION • MAYNARD, MASSACHUSETTS 1st Edition September 1970 Copyright © 1970 by Digital Equipment Corporation The instructional times, operating speeds and the like are included in this manual for reference only; they are not to be taken as specifications. The following are registered trademarks of Digital Equipment Corporation, Maynard, Massachusetts: DEC PDP FLIP CHIP FOCAL DIGITAL COMPUTER LAB UNIBUS Contents Contents (cont.) Page Page APPENDIX A GENERAL MAINTENANCE APPENDIX E PRODUcr CODE FOR SOFTWARE PRODUcrS A.1 SCOPE A-I E.l INTRODUCTION E-1 A.2 TEST EQUIPMENT AND TOOLS A-I E.2 COMPUTER SERIES - [XX] -xxxx-xx E-1 A.3 INSTALLATION OF ECO's A-I E.3 PRODUCT IDENTIFICATION - XX-[XXXX]-XX E-1 A.4 MODULE IDENTIFICATION AND LAYOUT A-I E.3.1 Major Category E-1 A.5 MODULE COMPONENT IDENTIFICATION A-2 E.3.2 Minor Category E-2 A.6 UNIBUS CONNECTIONS A-2 E.3.3 Option Category E-2 A.7 MULTIPLE BOX SYSTEMS A-2 E.3.4 Revision Category E-3 A.8 POWER CONTROL A-2 E.3.5 Minor Category E-3 A.9 SYSTEM UNIT REMOV AL/INSTALLATION A-2 E.3.6 Unique Designation Category E-3 A.10 MAINTENANCE TIPS A-3 E.4 DISTRIBUTION METHOD - XX-XXXX-[XX] E-3 A.10.1 Diagnostic Programs A-3 E.5 SPECIAL CLASSIFICATION E-3 A.10.2 KM 11 Maintenance Set A-3 E.6 TYPICAL EXAMPLE E-3 A.lO.3 Observation of Service Major State Operation A-3 APPENDIX F PDP-II GLOSSARY F-1 APPENDIXB LOGIC SYMBOLOGY APPENDIX G PDP-II STANDARD ABBREVIATIONS G-l B.l GENERAL B-1 B.2 LOGIC SYMBOLS B-1 B.2.1 State Indicator B-1 B.2.1.1 State Indicator Absent B-1 B.2.1.2 State Indicator Present B-1 B.2.2 Table of Combinations B-2 Illustrations B.2.3 Flip-Flop B-2 B.2.4 One-Shot Functions B-2 B.2.5 One-Shot Delays B-3 B.2.6 Schmitt Trigger B-4 B.2.7 Amplifier B-4 Figure No. -
What Is ISA? Stack Accumulator General-Purpose Registers
What Is ISA? Instruction set architecture is the structure of a computer that a machine language Lecture 3: Instruction Set programmer (or a compiler) must understand Architecture to write a correct (timing independent) program for that machine. ISA types, register usage, memory For IBM System/360, 1964 addressing, endian and alignment, quantitative evaluation Class ISA types: Stack, Accumulator, and General-purpose register ISA is mature and stable Why do we study it? 1 2 Stack Accumulator The accumulator provides an Implicit operands on stack implicit input, and is the Ex. C = A + B implicit place to store the Push A result. Push B Ex. C = A + B Add Load R1, A Pop C Add R3, R1, B Good code density; used in Store R3, c 60’s-70’s; now in Java VM Used before 1980 3 4 General-purpose Registers Variants of GRP Architecture General-purpose registers are preferred by Number of operands in ALU instructions: two or compilers three Reduce memory traffic Add R1, R2, R3 Add R1, R2 Improve program speed Maximal number of operands in ALU instructions: Improve code density Usage of general-purpose registers zero, one, two, or three Load R1, A Load R1, A Holding temporal variables in expression evaluation Passing parameters Load R2, B Add R3, R1, B Holding variables Add R3, R1, R2 GPR and RISC and CISC Three popular combinations RISC ISA is extensively used for desktop, server, and register-register (load-store): 0 memory, 3 operands embedded: MIPS, PowerPC, UltraSPARC, ARM, MIPS16, register-memory: 1 memory, 2 operands Thumb memory-memory: 2 memories, 2 operands; or 3 memories, 3 CISC: IBM 360/370, an VAX, Intel 80x86 operands 5 6 1 Register-memory Register-register (Load-store) There is no implicit operand Both operands are registers One input operand is Values in memory must be register, and one in memory loaded into a register and Ex. -
X86 Instruction Set 4.2 Why Learn Assembly
4.1 CS356 Unit 4 Intro to x86 Instruction Set 4.2 Why Learn Assembly • To understand something of the limitation of the HW we are running on • Helpful to understand performance • To utilize certain HW options that high-level languages don't allow (e.g. operating systems, utilizing special HW features, etc.) • To understand possible security vulnerabilities or exploits • Can help debugging 4.3 Compilation Process CS:APP 3.2.2 void abs(int x, int* res) • Demo of assembler { if(x < 0) *res = -x; – $ g++ -Og -c -S file1.cpp else *res = x; • Demo of hexdump } Original Code – $ g++ -Og -c file1.cpp – $ hexdump -C file1.o | more Disassembly of section .text: 0000000000000000 <_Z3absiPi>: 0: 85 ff test %edi,%edi 2: 79 05 jns 9 <_Z3absiPi+0x9> • Demo of 4: f7 df neg %edi 6: 89 3e mov %edi,(%rsi) 8: c3 retq objdump/disassembler 9: 89 3e mov %edi,(%rsi) b: c3 retq – $ g++ -Og -c file1.cpp Compiler Output – $ objdump -d file1.o (Machine code & Assembly) Notice how each instruction is turned into binary (shown in hex) 4.4 Where Does It Live • Match (1-Processor / 2-Memory / 3-Disk Drive) where each item resides: – Source Code (.c/.java) = 3 – Running Program Code = 2 – Global Variables = 2 – Compiled Executable (Before It Executes) = 3 – Current Instruction Being Executed = 1 – Local Variables = 2 (1) Processor (2) Memory (3) Disk Drive 4.5 BASIC COMPUTER ORGANIZATION 4.6 Processor • Performs the same 3-step process over and over again – Fetch an instruction from Processor Arithmetic 3 Add the memory Circuitry specified values Decode 2 It’s an ADD – Decode the instruction Circuitry • Is it an ADD, SUB, etc.? 1 Fetch – Execute the instruction Instruction System Bus • Perform the specified operation • This process is known as the ADD SUB Instruction Cycle CMP Memory 4.7 Processor CS:APP 1.4 • 3 Primary Components inside a processor – ALU – Registers – Control Circuitry • Connects to memory and I/O via address, data, and control buses (bus = group of wires) Bus Processor Memory PC/IP 0 Addr Control 0 op. -
V850e/Ms1 , V850e/Ms2
User’s Manual V850E/MS1TM, V850E/MS2TM 32-Bit Single-Chip Microcontrollers Architecture V850E/MS1: V850E/MS2: µPD703100 µPD703130 µPD703100A µPD703101 µPD703101A µPD703102 µPD703102A µPD70F3102 µPD70F3102A Document No. U12197EJ6V0UM00 (6th edition) Date Published November 2002 N CP(K) 1996 Printed in Japan [MEMO] 2 User’s Manual U12197EJ6V0UM NOTES FOR CMOS DEVICES 1 PRECAUTION AGAINST ESD FOR SEMICONDUCTORS Note: Strong electric field, when exposed to a MOS device, can cause destruction of the gate oxide and ultimately degrade the device operation. Steps must be taken to stop generation of static electricity as much as possible, and quickly dissipate it once, when it has occurred. Environmental control must be adequate. When it is dry, humidifier should be used. It is recommended to avoid using insulators that easily build static electricity. Semiconductor devices must be stored and transported in an anti-static container, static shielding bag or conductive material. All test and measurement tools including work bench and floor should be grounded. The operator should be grounded using wrist strap. Semiconductor devices must not be touched with bare hands. Similar precautions need to be taken for PW boards with semiconductor devices on it. 2 HANDLING OF UNUSED INPUT PINS FOR CMOS Note: No connection for CMOS device inputs can be cause of malfunction. If no connection is provided to the input pins, it is possible that an internal input level may be generated due to noise, etc., hence causing malfunction. CMOS devices behave differently than Bipolar or NMOS devices. Input levels of CMOS devices must be fixed high or low by using a pull-up or pull-down circuitry. -
Instruction Sets
Instruction Sets • what is an instruction set? • what is a good instruction set? • the forces that shape instruction sets • aspects of instruction sets • instruction set examples • RISC vs. CISC © 2006 by Lebeck Sorin, Roth, ECE 252 / CPS 220 Lecture Notes 1 Hill, Wood, Sohi, Smith, Instruction Sets Vijaykumar, Lipasti Readings Hennessy and Patterson • chapter 2 © 2006 by Lebeck Sorin, Roth, ECE 252 / CPS 220 Lecture Notes 2 Hill, Wood, Sohi, Smith, Instruction Sets Vijaykumar, Lipasti Instruction Sets “Instruction set architecture is the structure of a computer that a machine language programmer (or a compiler) must understand to write a correct (timing independent) program for that machine” –IBM introducing 360 (1964) an instruction set specifies a processor’s functionality • what operations it supports • what storage mechanisms it has & how they are accessed • how the programmer/compiler communicates programs to processor instruction set architecture (ISA): “architecture” part of this course • the rest is micro-architecture © 2006 by Lebeck Sorin, Roth, ECE 252 / CPS 220 Lecture Notes 3 Hill, Wood, Sohi, Smith, Instruction Sets Vijaykumar, Lipasti What Makes a Good Instruction Set? implementability • supports a (performance/cost) range of implementations • implies support for high performance implementations programmability • easy to express programs (for human and/or compiler) backward/forward compatibility • implementability & programmability across generations • e.g., x86 generations: 8086, 286, 386, 486, Pentium, Pentium II, Pentium -
A New Architecture for Mini-Computers -- the DEC PDP-11
Reprinted from - AFIPS - Conference Proceedings, Volume 36 Copyright @ by AFlPS Press Montvale, New Jersey 07645 A new architecture for mini-computers- The DEC PDP-11 by G. BELL,* R. CADY, H. McFARLAND, B. DELAGI, J. O’LAUGHLINandR. NOONAN l?i&l Equipment Corporation Maynard, Massachusetts and W. WULF Carnegit+Mellon University Pittsburgh, Fcriiisylvnnia INTRODUCTION tion is not surprising since the basic architectural concepts for current mini-computers were formed in The mini-computer** has a wide variety of uses: com- the early 1960’s. First, the design was constrained by munications controller; instrument controller; large- cost, resulting in rather simple processor logic and system pre-processor ; real-time data acquisition register configurations. Second, application experience systems . .; desk calculator. Historically, Digital was not available. For example, the early constraints Equipment Corporation’s PDP-8 Family, with 6,000 often created computing designs with what we now installations has been the archetype of these mini- consider weaknesses : computers. In some applications current mini-computers have 1. limited addressing capability, particularly of limitations. These limitations show up when the scope larger core sizes of their initial task is increased (e.g., using a higher 2. few registers, general registers, accumulators, level language, or processing more variables). Increasing index registers, base registers the scope of the task generally requires the use of 3. no hardware stack facilities more comprehensive executives and system control 4. limited priority interrupt structures, and thus programs, hence larger memories and more processing. slow context switching among multiple programs This larger system tends to be at the limit of current (tasks) mini-computer capability, thus the user receives 5. -
(ISA) Evolution of Instruction Sets Instructions
Computer Architecture’s Appendix B Changing Definition • 1950s to 1960s: Computer Architecture Course = Computer Arithmetic • 1970s to mid 1980s: Instruction Set Principles Computer Architecture Course = Instruction Set and Examples Design, especially ISA appropriate for compilers • 1990s: Computer Architecture Course = Design of CPU, memory system, I/O system, Multiprocessors 1 2 Instruction Set Architecture Evolution of Instruction Sets (ISA) Single Accumulator (EDSAC 1950) Accumulator + Index Registers (Manchester Mark I, IBM 700 series 1953) software Separation of Programming Model from Implementation instruction set High-level Language Based Concept of a Family (B5000 1963) (IBM 360 1964) General Purpose Register Machines hardware Complex Instruction Sets Load/Store Architecture (Vax, Intel 432 1977-80) (CDC 6600, Cray 1 1963-76) RISC (Mips,Sparc,HP-PA,IBM RS6000,PowerPC . .1987) 3 4 LIW/”EPIC”? (IA-64. .1999) Instructions Can Be Divided into Classifying ISAs 3 Classes (I) Accumulator (before 1960): • Data movement instructions 1 address add A acc <− acc + mem[A] – Move data from a memory location or register to another Stack (1960s to 1970s): memory location or register without changing its form 0 address add tos <− tos + next – Load—source is memory and destination is register – Store—source is register and destination is memory Memory-Memory (1970s to 1980s): 2 address add A, B mem[A] <− mem[A] + mem[B] • Arithmetic and logic (ALU) instructions 3 address add A, B, C mem[A] <− mem[B] + mem[C] – Change the form of one or more operands to produce a result stored in another location Register-Memory (1970s to present): 2 address add R1, A R1 <− R1 + mem[A] – Add, Sub, Shift, etc.