DOCSLIB.ORG

Accumulator Machine Simulator Developed for CS2700 Assembly Language and Computer Architecture Xuejun Liang Fall 2009 Motivation

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Accumulator Machine Simulator Developed for CS2700 Assembly Language and Computer Architecture Xuejun Liang Fall 2009 Motivation Accumulator Machine Simulator Developed for CS2700 Assembly Language and Computer Architecture Xuejun Liang Fall 2009 Motivation • MARIE is an accumulator-based machine simulator • Used for assembly language programming exercises. • But, MARIE simulator has some problems: • Programmers can not define a variable to hold the address of another variable. • Conditional branch can only skip the next instruction. It takes numbers as its operands for indicating different conditions. Programmers have to remember these numbers. • MARIE do not have the stack pointer. So its subroutine has no local variables and can not be recursive. • To solve these problem, I developed a new accumulator- based machine simulator. The goal of this simulator • Used for assembly language programming with an accumulator-based machine. • Microarchitecture that will support the execution of instructions of this accumulator-based machine is not considered for now. • Used for advanced course projects • Add more instructions in the simulated machine • Add user interfaces for the simulator • Add more debugging functions in the simulator • Design a microarchitecture to support the simulated machine. Architecture Characteristics • Binary, two's complement data representation. • Stored program, fixed word length data and instructions. • 64K words of word-addressable data memory. • 64K words of word-addressable instruction memory. • 32-bit data words. • 32-bit instructions. • A 32-bit arithmetic logic unit (ALU). • Only arithmetic operations are implemented • Registers • ACC: 32-bit Accumulator • PC: 32-bit Program counter • SP: Stack pointer pointing to the top of the stack op Instruction Explanation Instruction Set 0 LIMM Imm ACC Imm 1 AIMM Imm ACC ACC+Imm 2 ADD Var ACC ACC+M[Var] Imm: 16-bit 2’s compliment 3 SUB Var ACC ACC-M[Var] ACC: Accumulator 4 MUL Var ACC ACC*M[Var] PC: Program counter 5 DIV Var ACC ACC/M[Var] Var: Variable 6 REM Var ACC ACC%M[Var] Lab: Label 7 GET Var ACC M[Var] M[A]: Memory content of variable A 8 PUT Var M[Var] ACC PUSH PC: Push PC on stack 9 GOTO Lab PC Lab 10 BEQZ Lab If ACC = 0 GOTO Lab POP: Remove top content on stack 11 BNEZ Lab If ACC ≠ 0 GOTO Lab SP: Reserved location, Stack pointer 12 BGEZ Lab If AC퐶 ≥ 0 GOTO Lab ZERO: Reserved location, M[ZERO]=0 13 BLTZ Lab If ACC < 0 GOTO Lab 14 JNS Lab PC L & PUSH PC $+Imm: Local variable 15 JR PC M[M[SP]] & POP Its address is M[SP]+Imm, 16 READ ACC Input where Imm is a 16-bit integer. 17 PRNT Print ACC Example: ADD $+4 means 18 STOP Stop ACC ACC + M[M[SP]+4] 19 GETI Var ACC M[M[Var]] 20 PUTI Var M[M[Var]] ACC Pseudo-Instructions Pseudo- Meaning Instruction instruction 1 POP M[SP] = M[SP] -1 GET SP AIMM -1 PUT SP 2 TOP A M[A] M[M[SP]] GETI SP PUT A 3 PUSH A M[SP] = M[SP] + 1 GET SP M[M[SP]] M[A] AIMM 1 PUT SP GET A PUTI SP Implementations • Three separate 32-bit integer arrays are used for instructions, memory data, and input data, respectively. • Each instruction takes 22 bits • 5-bit opcode, and 16-bit operand (address). • 1-bit indicating if the operand is local or global • But, using one 32-bit word to hold one instruction. • Instruction memory address is 16 bits. So, Instructions will take up to 64K 32-bit words (or integers). • The branch instructions use 16-bit absolute address. The instructions JNS also use 16-bit absolution address • Each datum occupies 32 bits. The data address is 16 bits. So, we have 64K words of data memory. • Stack is growing towards higher data memory address Program Structure and Syntax (1) • Every program contains three sections [Data] and separated by END END • Data (optional) Code • Code END • Input (optional) [Input] • Data (Declarations) • One variable definition per line • ID (identifier) is the variable name. ID Type [Value] • Type is a positive integer • Type = 1, ID is a scalar variable • Type > 1, ID is an array variable [Label:] Instruction • Value is up to Type initial integers of ID. If less than Type initial values are provided, Number (integer) default initial values are used. Program Structure and Syntax (2) • Code (Instructions) • One instruction per line [Data] • Label is optional. It must be followed by ‘:’ END immediately. There is no space between Code Label and ‘:’. END • Instruction is any instruction, including [Input] pseudo-instruction. • Input: ID Type [Value] • One input value per line. • Number is any integer. • Comments: [Label:] Instruction • Any text starting from // to the end of the line will be considered as comments Number (integer) Simple Example 1: Add Two Numbers Our Simulator Code MARIE Simulator Code X 1 23 //First number Load X /Get first number Y 1 48 //Second number Add Y /Add the second Z 1 0 //Sum Store Z /Store Sum at Z END Output /Print the Sum GET X //Get first number Halt /Terminate program ADD Y //Add the second X, DEC 23 /First number PUT Z //Store Sum at Z Y, DEC 48 /Second number PRNT //Print the Sum Z, DEC 0 /Sum STOP //Terminate program END Example 2: Compute sum of absolute values of elements in an array Our Simulator Code //Data I 1 0 //Array Index SUM 1 0 //Sum N 1 9 //Number of elements in the array TMP 1 0 //Temporary location PDAT 1 DAT //A pointer to the array DAT DAT 9 10 20 30 -40 50 60 70 80 -90 //array DAT END //Code L1: GET N SUB I BEQZ L3 //if (N-I)=0, done GETI PDAT //Get an array element into ACC Our Simulator Code BGEZ L2 //if positive, skip PUT TMP //else, negate LIMM 0 SUB TMP L2: ADD SUM //add to sum PUT SUM GET I //increase index I by one AIMM 1 PUT I GET PDAT //increase array address by one AIMM 1 PUT PDAT GOTO L1 //next element L3: GET SUM //print sum PRNT STOP //stop END //Inputs //None Example 3 MARIE Assembly Program: Ex4_2.mas in the MARIE simulator package If X = Y then X = X × 2 else ORG 100 Y = Y - X If, Load X /Load the first value Subt Y /Subtract the value of Y, store result in AC Skipcond 400 /If AC=0, skip the next instruction Jump Else /Jump to Else part if AC is not equal to 0 Then, Load X /Reload X so it can be doubled Add X /Double X Store X /Store the new value Jump Endif /Skip over the false, or else, part to end of if Else, Load Y /Start the else part by loading Y Subt X /Subtract X from Y Store Y /Store Y-X in Y Endif, Halt /Terminate program (it doesn't do much!) X, Dec 12 /Load the loop control variable Y, Dec 20 /Subtract one from the loop control variable END Example 3 Our Simulator Code If X = Y then X = X × 2 else X 1 12 Y = Y - X Y 1 20 END If: GET X //Load the first value SUB Y //Subtract the value of Y, store result in AC BNEZ Else //If AC=0, Jump to Else part Then: GET X //Reload X so it can be doubled ADD X //Double X PUT X //Store the new value GOTO Endif //Skip over the else part to end of if Else: GET Y //Start the else part by getting Y SUB X //Subtract X from Y PUT Y //Store Y-X in Y Endif: STOP //Terminate program END Example 4: Compute Fibonacci Number fib(N), Where N is an Input Mathematics formula int I, A, B, C, N cin >> N; C++ code using a loop if (N < 2) C = N; else { A = 0; B = 1; for (I = 2; I <= N; I++) { C = B + A; A = B; B = C; } } cout << C; Example 4: C++ Code with Using Function int N; int N; int fib(int N) { int fib(int N) { int I, A, B, C; if (N < 2) if (N < 2) return N; return N; else else { return f(N) + f(N-1); A = 0; B = 1; } for (I = 2; I <= N; I++) { cin >> N; C = B + A; A = B; B = C; C = fib(N); } cout << C; } return C; } Recursive function cin >> N; C = fib(N); Non-recursive function cout << C; Example 4: L1:GET B //ACC=B ADD A //ACC=B+A Loop Solution PUT C //C=B+A GET B //ACC=B //Declarations PUT A //A=B I 1 1 //index GET C //ACC=C N 1 0 //N PUT B //B=C C 1 0 //f(N) GET I //ACC=I B 1 1 //f(N-1) AIMM 1 //ACC=I+1 A 1 0 //f(N-2) PUT I //I=I+1 END SUB N //ACC=I-N //Instructions BLTZ L1 //if I<N, cont. READ //Read input L2:GET C //print result PUT N //N=input PRNT PUT C //C=N STOP //stop SUB I //ACC=N-1 END BLTZ L2 //if N<1 //inputs BEQZ L2 //if N=1 10 //N Example 4: Using Function Stack Frame or Activation Record N 1 0 //N: input C 1 0 //C: result fib(N) Addr Name Explanation END //main code $-1 N/Fib(N) Input/output READ //Read input $ RA Return Address PUT N //N=input $+1 I Local variable PUSH N //Push N on stack JNS Fib //call Fib $+2 A Local variable TOP C //Get and save fib(N) $+3 B Local variable POP //Restore stack $+4 C Local variable GET C //Get fib(N) from C PRNT //Print fib(N) STOP L2: GET $+3 //ACC=B ADD $+2 //ACC=B+A PUT $+4 //C=B+A Fib: LIMM 1 GET $+3 //ACC=B PUT $+1 //I=1 PUT $+2 //A=B PUT $+3 //B=1 GET $+4 //ACC=C AIMM -1 PUT $+3 //B=C PUT$+2 //A=0 GET $+1 //ACC=I GET $-1 //ACC=N AIMM 1 //ACC=I+1 SUB $+1 //N-1 PUT $+1 //I=I+1 BLTZ L3 //N<1 SUB $-1 //ACC=I-N BEQZ L3 //N=1 BLTZ L2 //if I<N, cont.
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 ..............
    [Show full text]
  • 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.
    [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]
  • 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.
    [Show full text]
  • 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.
    [Show full text]
  • 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.
    [Show full text]
  • 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.
    [Show full text]
  • 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
    [Show full text]
  • 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.
    [Show full text]
  • (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.
    [Show full text]
  • Memory Buffer Register (MBR)
    William Stallings Computer Organization and Architecture 10 th Edition Edited by Dr. George Lazik Chapter 1 + Basic Concepts and Computer Evolution © 2016 Pearson Education, Inc., Hoboken, NJ. All rights reserved. Computer Architecture Computer Organization •Attributes of a system •Instruction set, number of visible to the bits used to represent programmer various data types, I/O •Have a direct impact on mechanisms, techniques the logical execution of a for addressing memory program Architectural Computer attributes Architecture include: Organizational Computer attributes Organization include: •Hardware details •The operational units and transparent to the their interconnections programmer, control that realize the signals, interfaces architectural between the computer specifications and peripherals, memory technology used © 2016 Pearson Education, Inc., Hoboken, NJ. All rights reserved. + IBM System 370 Architecture IBM System/370 architecture Was introduced in 1970 Included a number of models Could upgrade to a more expensive, faster model without having to abandon original software New models are introduced with improved technology, but retain the same architecture so that the customer’s software investment is protected Architecture has survived to this day as the architecture of IBM’s mainframe product line © 2016 Pearson Education, Inc., Hoboken, NJ. All rights reserved. + Structure and Function Hierarchical system Structure Set of interrelated The way in which subsystems components relate to each other Hierarchical nature of complex systems is essential to both Function their design and their description The operation of individual components as part of the Designer need only deal with structure a particular level of the system at a time Concerned with structure and function at each level © 2016 Pearson Education, Inc., Hoboken, NJ.
    [Show full text]
  • Leros the Return of the Accumulator Machine
    Downloaded from orbit.dtu.dk on: Sep 26, 2021 Leros The return of the accumulator machine Schoeberl, Martin; Petersen, Morten Borup Published in: Architecture of Computing Systems - ARCS 2019 - 32nd International Conference, Proceedings Link to article, DOI: 10.1007/978-3-030-18656-2_9 Publication date: 2019 Document Version Peer reviewed version Link back to DTU Orbit Citation (APA): Schoeberl, M., & Petersen, M. B. (2019). Leros: The return of the accumulator machine. In M. Schoeberl, T. Pionteck, S. Uhrig, J. Brehm, & C. Hochberger (Eds.), Architecture of Computing Systems - ARCS 2019 - 32nd International Conference, Proceedings (pp. 115-127). Springer. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) Vol. 11479 LNCS https://doi.org/10.1007/978-3-030-18656-2_9 General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. Users may download and print one copy of any publication from the public portal for the purpose of private study or research. You may not further distribute the material or use it for any profit-making activity or commercial gain You may freely distribute the URL identifying the publication in the public portal If you believe that this document breaches copyright please contact us providing details, and we will remove access to the work immediately and investigate your claim. Leros: the Return of the Accumulator Machine Martin Schoeberl1 and Morten Borup Petersen1 Department of Applied Mathematics and Computer Science Technical University of Denmark, Kgs.
    [Show full text]