1 / 9

Computing Solutions: Overcoming Slow Moves and Detecting Overflows

Join Alex, Dave, Kevin, and Mike in this presentation as they showcase their work implementing move functions to address slow-moving computers, creating traps and exceptions to prevent arithmetical overflow, and setting up branch and jump functionalities with ALUs and MUXes. Learn about their progress and upcoming tasks for the project.

erna
Download Presentation

Computing Solutions: Overcoming Slow Moves and Detecting Overflows

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. Team 2 Week 6 PresentationThe Attack of the Slow Moving Computers! Alex Dave Kevin Mike

  2. What We Did This Week

  3. Set Conditionals

  4. Set Conditionals

  5. Moves • Implemented Move functions. • They seem to be working but will not know for sure until we get every part implemented into our final design.

  6. Traps/Exceptions • We made a unit that detects arithmetical overflow. • Has outputs that stall previous instructions from writing or anything else. • Has outputs that force an address on the PC counter. • Will continue to work on it this week to finish the part.

  7. Exception Unit

  8. Branches/Jumps • Using our ALU to do address calculation • Wired logic for branches • MUXes to choose PC

  9. Next Week • Finish JAL, JR, JALR • Finish TRAP/RFE

More Related