CDA 4101

General

• There is a mailing list on www.cs.fiu.edu for this class. Your FIU e-mail address is already on the list. To retrieve your password for access to the list, go to the following link, scroll to the bottom, enter your FIU e-mail address in the box for Edit Options and submit it. The next page has a button for retrieving your password. Do not change your password to your regular FIU password, as the mailing list passwords are not encrypted.
  • Section 01:
    http://www.cs.fiu.edu/mailman/listinfo.cgi/aul-cda4101u01
  • Section 02:
    http://www.cs.fiu.edu/mailman/listinfo.cgi/aul-cda4101u02

  You may add more than one address to the list. When adding a new e-mail, be sure to follow the instructions about placing 'confirm ######' in the body of the text. If you only reply, it might not work.This is a moderated list, so only messages that I approve will be sent to you. I will sell your e-mail address to whomever wants to buy it (just kidding).

• Syllabus
  • Section 01 (MW 3:30)
  • Section 02 (MW 5:00)
• Exam Information will be posted here prior to exams.
  • Check the Moodle calendar for exam dates.
  • Quiz 1 will be on September 28. It will be administered during the last 25 minutes of class. It will cover the material from Homework 1.
  • Exam 1 will be on October 5.
    • Book Chapters
      • Chapter 1 - all
      • Chapter 2
        • 2.1
        • 2.2 - skip 2.2.4
        • 2.3 - only 2.3.1
        • 2.4 - only 2.4.1
      • Chapter 3
        • 3.1
        • 3.2
        • 3.3
        • 3.4 Will not be on Exam 1
    • Lectures: ch1, ch2, ch3 part 1
  • Quiz 2 will be on 3/19. It will be administered during the last 15 minutes of class. It will cover part of chapter 3: sub-section 3.2.3 and section 3.3.
  • Exam 2 will be on 11/4.
    • Chapter 3
    • 3.4
    • 3.5
    • 3.6
    • 3.7
    • Chapter 4
      • 4.1
      • 4.2
      • 4.3.1
    • Lecture notes: ch3-part1, ch3-part2, ch4.1-4.3
  • Quiz 3 will be on 4/9. It will be administered during the last 15 minutes of class. It will cover part of chapter 4: 4.1, 4.2, 4.3.

    Guarantees:

    • Identify the microcode implementation of an IJVM instruction.
    • Write the microcode implementation of an IJVM instruction
  • Exam 3 will be on Monday, 12/7. Check Moodle for the time for your section.
    • Chapter 4
    • Exclude Section 4.5.4
    • Exclude Section 4.6
    • Chapter 5
      • Section 5.5.7
      • Section 5.6
    • Chapter 8
      • Section 8.3
      • Section 8.4, through 8.4.1
    • Lecture notes: ch4.1-4.3, ch4-4.6, ch4-4.5, ch4-section4.6, ch5.5.6-5.7, ch8.8.3-real
  • Exam 4
    • Check your Panther Soft schedule for the day and time./li>
    • Chapter 4, sections 4.4.5, 4.5, 4.6, 4.7, 4.8
    • Chapter 5, sections 5.5.7 and 5.6
    • Chapter 8, section 8.3
    • Lecture notes from 11/5 - 12/3
• Chapter 2 Topics to Skip
  • 2.3.7 CD-ROMs
  • 2.3.8 CD-Recordables
  • 2.3.9 CD-Rewritables
  • 2.3.10 DVD
  • 2.3.11 Blu-Ray
  • 2.4.2 Terminals
  • 2.4.3 Mice
  • 2.4.4 Game Controllers
  • 2.4.5 Printers
  • 2.4.6 Telecommunications Equipment
  • 2.4.7 Digital Cameras
  • 2.4.8 Character Codes

Online Resources

• Moodle
  • Moodle site, section 01
  • Moodle site, section 02
• Class Notes
  • Information
  • The password for the slides is comporg.
  • List of lectures for section 01
  • List of lectures for section 02
• Zip file containing simulators for an assembler and mic-1.
• Free circuit drawing and running programs.
  • GNU Electric.
  • Logism - Online.
  • Digital Works.
• Videos for Wednesday, November 18.
  • I/O from 5.7
  • Traps from 5.6
  • Interrupts from 5.6
  • Parallel Computers from 8.3
  • MESI from 8.3
• Video for Wednesday, November 25.
  • Sections 4.5 and 4.6

Assignments

• Homework 1
• Homework 2
• Homework 3

Miscellaneous

• Pipelining
• Superscalar
• Complete Memory Diagram
• Implementing the majority function using some of these SSI chips.
• 4-input Boolean function on the MSI multiplexer chip.
• Implementation of the Majority function using the LSI PLA chip from page 95.
• Implementation of the Majority function using SSI chips.
• PCIe Information
• Decentralized Bus Arbitration
• Information about Chip Select
• C and N Bits
• Changing hex microinstructions to MAL
• Calculating offsets for jumps in Java Byte Code
• Common Operations in Mic-1
• Nice examples for MIC-1
• More information about Mic-4
• Branch Prediction
• OMAP4430 Information
• TriMedia Information
• Fermi GPU. The Fermi description begins on page 16.

---

N and C Bits

• It is not possible to use the N bit alone to determine the relative order of unsigned numbers. Try to create the following examples:
  1. Perform A - B where the result is negative, and B > A as unsigned numbers.
  2. Perform C - B where the result is positive, and B > C as unsigned numbers.
  Use the same value for B as in the first example.
  3. Come up with an example where A - B = C - B. The N bit will be the same for both results, but the relative order of the numbers is different.
• The C bit is implemented as I had described originally. It is set as if the subtraction were done without using the 2's complement of the number. Perform the subtraction as you would normally (not with 2's complement), if you need to borrow to complete the subtraction, then the carry bit will be set. This raises the question of how this would be implemented in hardware. One solution would be to negate the carry-out of the highest ALU whenever the ALU forms the 2's complement of the A bus.

Back to Index

---