Chapter-04-A.pdf - CP216 – Introduction to Microprocessors Chapter 4 Instruction Set-Architecture – Breadth and Depth Lecture-4A Chapter 4

Chapter-04-A.pdf - CP216 – Introduction to...

This preview shows page 1 - 7 out of 20 pages.

CP216 Introduction to Microprocessors ©2017 Dr. S. Song Chapter 4 Instruction Set-Architecture Breadth and Depth Lecture-4A Introduction 4.1 The Stack and Data Storage 4.1.1 Storage and the Stack 4.1.2 Passing Parameters via the Stack 3.2 Components of an ISA Chapter 4 Instruction Set Architecture Breadth and Depth 04/03/2018 Lecture-02 Page 1 Chaper-4A 4.3 MIPS: Another RISC Chapter-4B
Image of page 1

Subscribe to view the full document.

CP216 Introduction to Microprocessors ©2017 Dr. S. Song Chapter 4 Instruction Set-Architecture Breadth and Depth Lecture-4A 04/03/2018 Lecture-02 Page 2 Introduction OP Select The Big Idea Software run on Hardware R1 R2 ALU X bits e.g. 32 or 64 X bits e.g. 32 or 64 Output Output R3 OP Select Main Memory Clock
Image of page 2
CP216 Introduction to Microprocessors ©2017 Dr. S. Song Chapter 4 Instruction Set-Architecture Breadth and Depth Lecture-4A 04/03/2018 Lecture-02 Page 3 Introduction The Second Idea Binding Main Memory High-Level Programs Variable A Variable B Variable C At the hardware Level Memory Address- 0000 1010 Memory Address- 0000 1110 Memory Address- 0001 1110 Binding (responsibility of Compiler) Binding method: Static Binding (all of the current popular compilers) Biding at compilation time Dynamic Biding (LISP) Biding and Rebinding at runtime.
Image of page 3

Subscribe to view the full document.

CP216 Introduction to Microprocessors ©2017 Dr. S. Song Chapter 4 Instruction Set-Architecture Breadth and Depth Lecture-4A 04/03/2018 Lecture-02 Page 4 Introduction The Third Idea Subroutines/Procedures
Image of page 4
CP216 Introduction to Microprocessors ©2017 Dr. S. Song Chapter 4 Instruction Set-Architecture Breadth and Depth Lecture-4A 04/03/2018 Lecture-02 Page 5 Introduction The Forth Idea Stack 4.1 The Stack and Data Storage The Stack Related Issues: 1. Subroutines/Procedures/Functions Global and local Variables 2. Binding method (Static or Dynamic) 3. Function call itself (Static or dynamic allocation) Recursion Static allocation: FORTRAN, COBOL, Pascal Dynamic Allocation: C/C++, Java N!=NX(N-1)!
Image of page 5

Subscribe to view the full document.

CP216 Introduction to Microprocessors ©2017 Dr. S. Song Chapter 4 Instruction Set-Architecture Breadth and Depth Lecture-4A 04/03/2018 Lecture-02 Page 6 4.1.1 Storage and the Stack Storage and the Stack When a language using dynamic data storage invokes a procedure, it is said to activate the procedure. Associated with each procedure and each invocation of a procedure is an activation record containing all the information necessary to execute the procedure.
Image of page 6
Image of page 7
  • Winter '14
  • Staff
  • Central processing unit, Call stack, Dr. S. Song

What students are saying

  • Left Quote Icon

    As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

    Student Picture

    Kiran Temple University Fox School of Business ‘17, Course Hero Intern

  • Left Quote Icon

    I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

    Student Picture

    Dana University of Pennsylvania ‘17, Course Hero Intern

  • Left Quote Icon

    The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

    Student Picture

    Jill Tulane University ‘16, Course Hero Intern

Ask Expert Tutors You can ask 0 bonus questions You can ask 0 questions (0 expire soon) You can ask 0 questions (will expire )
Answers in as fast as 15 minutes