Logical and Shift Operations COMP273 McGill 1 Up Until Now • Up until now, we’ve done – Arithmetic: add, sub,addi – Memory access: lw and sw – branches and jumps: j, jr, jal, beq, bne • These instructions view contents of register as a single quantity (such as a signed or unsigned integer) COMP273 McGill […]
CS计算机代考程序代写 compiler assembly Java mips Logical and Shift Operations Read More »
COMP273 McGill 1 Assembler Arithmetic and Memory Access Overview • VariablesinAssembly • AdditionandSubtractioninAssembly • Memory Access in Assembly COMP273 McGill 2 Below Your Program • High-level language program (in C) swap (int v[], int k) { int temp = v[k]; v[k] = v[k+1]; v[k+1] = temp; } • Assembly language program (for MIPS) swap: sll
CS计算机代考程序代写 assembler compiler assembly Java mips COMP273 McGill Read More »
Matrix Multiplication and Cache Friendly Code COMP 273 Winter 2021 – Assignment 4, Prof. Kry Available: 24 March – Due date: 12 April 1 Introduction In this assignment you will write code to multiply two square n × n matrices of single precision floating point numbers, and then optimize the code to exploit a memory
Input/Output: Polling and Interrupts • I/OBackground • Polling • Interrupts Outline Anatomy: 5 components of any Computer Computer Keyboard, Mouse Disk (where programs, data live when not running) Display, Printer Processor (active) Control (“brain”) Datapath (“brawn”) Memory (passive) (where programs, data live when running) Devices Input Output Motivation for Input/Output • I/Oishowhumansinteractwithcomputers • I/O gives
CS计算机代考程序代写 mips Input/Output: Polling and Interrupts Read More »
MIPS/SPIM Reference Card CORE INSTRUCTION SET (INCLUDING PSEUDO INSTRUCTIONS) MNE- FOR- MON- MAT IC add addi addiu addu sub subu and andi nor or ori xor xori sll srl sra sllv srlv srav slt slti sltiu sltu beq bne blt bgt ble bge j jal jr jalr move lb lbu lh lhu lui lw li
Low on cache? Caches, Part I Slides from Patterson’s 61C, Fall 2001 • Memory Hierarchy • Direct-Mapped Cache • Types of Cache Misses • A (long) detailed example Outline McGill COMP 273 2 Slides from Patterson’s 61C, Fall 2001 Memory Hierarchy (1/4) • Processor – executes programs – runs on order of nanoseconds to picoseconds
CS计算机代考程序代写 cache mips Low on cache? Read More »
COMP273 McGill 1 Decisions in MIPS Assembly Language • • All instructions we’ve seen so far allowusto manipulatedata. To build a computer we must have the ability to make decisions. COMP273 McGill 2 Decisions in High-Level Languages • ConditionalStatements:if,if-else,switch • Loops:while,dowhile,for • Equality and Inequalities: == != < > = COMP273 McGill 3 Branches From
CS计算机代考程序代写 compiler assembly Java mips COMP273 McGill Read More »
Instruction Representation COMP273 McGill 1 Review (1/2) • Logical and Shift Instructions • Operate on bits individually, unlike arithmetic, which operate on entire word • Use to isolate fields, either by masking or by shifting back and forth • Shift left logical (sll) multiplies by powers of 2 • Shift right arithmetic (sra) divides by
CS计算机代考程序代写 assembler compiler Java mips Instruction Representation Read More »
Instruction Representation 2 McGill COMP273 1 Review • MIPS defines instructions to be same size as data (one word) so that they can use the same memory (can use lw and sw) • Machine Language Instruction: • 32 bits representing a single instruction R I • Computer actually stores programs as a series of these
CS计算机代考程序代写 assembler data structure mips assembly Instruction Representation 2 Read More »
Procedures COMP273 McGill 1 á HLL Functions -> MIPS Procedures ± Passing arguments ± Function calls ± The stack ± Nested functions ± Register Conventions á Be aware: ± There are many ways to program ± This might be the most complicated topic in MIPS COMP273 McGill 2 Overview HLL Functions to MIPS Procedure //asimplefunction
CS计算机代考程序代写 compiler mips assembly Procedures Read More »