CGS4854	CDA4101	COP4226	COP2250	COP2210	UNIX	HOME

General Information for CDA-4101

I have made new links more apparent. Scroll down... you won't miss them!
I have used CSS to make exam links more apparent. Scroll down... you won't miss them!

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:00)
  • Section 02 (MW 5:00)
• Exam Information will be posted here prior to exams. Check the Moodle calendar for exam dates.
  • Exam 1 will be on October 1.
    • Chapter 1
    • Chapter 2
    • Chapter 3, up through 3.2
  • Exam 2 will be on October 22.
    • Chapter 3
    • Chapter 4, up through 4.1.1
    • Lecture notes from 9/10 - 10/13
  • Exam 3 will be on November 12.
    • Chapter 4, up through 4.4.4
    • Lecture notes from 10/8 - 11/5
  • 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

On-line resources

• Moodle
  1. Moodle site, section 01
  2. Moodle site, section 02
• Piazza Forum I have not enrolled any students in the Piazza forum. I like the forum and will support it over the semester. Please enroll.
• 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 program. It has a simulator for testing circuits.
  GNU Electric.

Assignments

• Submitting Homework Online.
• Extra Credit 1. This is the new and improved assignment.
• Homework 1
• Extra Credit 2. The longer you wait, the more difficult the assignment will be.
• Homework 2
• Homework 3
• New: Extra Credit 3.
  • Spreadsheet Template for Extra Credit 3.
  • Answer for Extra Credit 3.
• Homework 4
• Answer for Homework 4.
• Extra Credit 4

Additional Information

• Complete Memory Diagram
• Information about Chip Select
• 3-input Boolean function using SSI chips.
• 4-input Boolean function on the MSI multiplexer chip.
• More information about the C and N bits when comparing numbers.
• Decentralized Bus Arbitration. I have updated this so that it holds Bus Busy until the device has finished with the bus.
• Implementation of the Majority function using the LSI PLA chip from page 95.
• Implementation of the Majority function using SSI chips.
• PCIe Information
• Common Operations in Mic-1
• Nice examples for MIC-1
• Changing hex microinstructions to MAL
• Calculating offsets for jumps in Java Byte Code
• Pipelining
• More information about Mic-4
• Branch Prediction
• Superscalar
• OMAP4430 Information
• TriMedia Information
• Fermi GPU. The Fermi description begins on page 16.

More Information on the 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

You are visitor number to visit this page since 08/16/2014.