PPT-MIPS Arithmetic and Logic Instructions

COE 301 Computer Organization Prof Aiman ElMaleh College of Computer Sciences and Engineering King Fahd University of Petroleum and Minerals Adapted from slides of Dr M Mudawar COE 301 . The ReversibleLogic has received great attention in the past recent years due to i ts ability in reducing the power dissipation the major concern in digital designing To generate a useful gate function the ReversibleGate s require constant inputs ca Types of Instructions. There are 3 main types of assembly instructions. Arithmetic - add, sub, mul, shifts, and, or, etc.. Load/store. Conditional - branches. Arithmetic Instructions. add a, b, c a = b+c. . Daniel . Kroening. and . Ofer. . Strichman. Decision Procedure. . Decision procedures. Decision procedures which we learnt... SAT Solver. BDDs. Decision procedure for equality logic. …. However, what kind of logic do we need to express bit-wise operations and bit-wise arithmetic?. Instruction Set Architecture. RISC Instruction Set Basics. All operations on data apply to data in registers and typically change the entire register. The only operations that affect memory are load and store operations. Organisation. MIPS Part III: Instruction Formats. (AY2015/6) Semester 1. Road Map: . Part II. MIPS III: Format & Encoding. 2. Performance. Assembly Language. Processor:. Datapath. Processor:. Control. Assemblers. Hakim Weatherspoon. CS 3410, Spring 2013. Computer Science. Cornell University. See P&H Appendix . B. .1-2, . and Chapters 2.8 and 2.12; . als. 2.16 and 2.17 . Big Picture: Where are we now?. Prof. Kavita Bala and Prof. Hakim Weatherspoon. CS 3410, Spring 2014. Computer Science. Cornell University. See P&H Appendix 2.16 – 2.18, and 2.21. Survey. Lectures. Need to repeat student questions. Define instruction set. Explain the concept of the source and destination registers for the MIPS instruction set.. Using the MIPS instruction set, explain how to add a set of variables.. Define the term computer register. We already know that the language of the machine is . binary. – that is, sequences of 1’s and 0’s. But why is this? . At the hardware level, computers are streams of signals. These signals only have two states of interest, high voltage and low voltage. . We already know that the language of the machine is . binary. – that is, sequences of 1’s and 0’s. But why is this? . At the hardware level, computers are streams of signals. These signals only have two states of interest, high voltage and low voltage. . Prof. Hakim Weatherspoon. CS 3410, Spring 2015. Computer Science. Cornell University. See P&H Appendix 2.16 – 2.18, and 2.21. Announcements. There . is. a Lab Section this week, C-Lab2. Project1 (PA1) . 7/01/2013. Summer 2013 -- Lecture #5. 1. CS 61C: Great Ideas in . Computer Architecture. Introduction to. Machine Language . Review of Last Lecture. C Memory Layout. Local variables disappear because Stack changes. First and Third Group. . . . First Group Instruction. ADD. , SUB,CMP, AND, TEST, OR, XOR. . REG. , memory. memory. , REG. REG. , REG. memory. , immediate. REG. , . immediate. These instructions affect these flags only:. Assembly Language. Architecture Design Principles. Simplicity favors regularity. Make the common case fast. Smaller is faster. Good design demands good compromises. Where to store data (memory/register).