1 / 10

CS 152, Spring 2010 Section 2

CS 152, Spring 2010 Section 2. Andrew Waterman. University of California, Berkeley. Agenda. Instructional account forms In-class activity Q&A on HW1, Lab 1. Instructional Account Forms.

josefiner
Download Presentation

CS 152, Spring 2010 Section 2

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. CS 152, Spring 2010Section 2 Andrew Waterman University of California, Berkeley

  2. Agenda Instructional account forms In-class activity Q&A on HW1, Lab 1

  3. Instructional Account Forms • Once you have gotten your instructional account form, please fill out the sheet being passed around with the following info: • Full name • @berkeley.edu email address • Instructional login

  4. Assignment Short worksheet on Iron Law and variable-length instruction encoding

  5. Assignment Problem 1 • Option 1: Improve FPSQR • What is the overall CPI reduction? • (frequency of FPSQR)*(CPI reduction for FPSQR) • (0.02)*(20-2) = 0.36 • Option 2: Improve other FP ops • What is the overall CPI reduction? • (frequency of FP ops)*(CPI reduction for FP ops) • (0.25)*(4.0-2.5) = 0.375 • Option 2 reduces CPI further

  6. Assignment Problem 2A • 90.5% of branches fit within 8 offset bits • (24-8 bits saved)*(0.905) = 14.48 bits saved • 99.5% of branches fit within 16 offset bits • (24-16 bits saved)*(0.995-0.905) = 0.72 bits saved • This encoding saves 15.2 bits/branch (38%) • Branches are 10% of program • Overall code size reduction is 3.8%

  7. Assignment Problem 2B We reduced branch length by 15.2 bits Adding 2 bits reduces the benefit by 13% One alternative: use different opcodes to indicate length (if opcode space isn’t full) Another: Use offsets of length 6,14,22 instead of 8,16,24

  8. Assignment Problem 2C Most of the benefit was obtained by adding only a single new branch offset size (8 bits) Adding more branch types would meet diminishing returns

  9. Assignment Problem 2D • Variable-length instructions add complexity • If looking at arbitrary code, hard to know where instruction boundaries lie • Must decode instructions serially • Hard to implement processors that execute more than one instruction per cycle • Instructions can cross cache line/page boundaries

  10. Questions? HW Lab This in-class assignment

More Related