"单周期CPU实验报告-岳宇轩-2021年5月20日"
需积分: 0 41 浏览量
更新于2024-01-02
收藏 955KB DOCX 举报
Summary:
This report summarizes the experiment conducted by Yue Yuxuan, a student in the Department of Computer Science and Technology at Ocean University of China. The experiment focused on the topic of single-cycle CPU implementation. The experiment was carried out on May 20, 2021, under the guidance of the teacher Zhang Wei.
The experiment aimed to complete and analyze the code by filling in the missing parts. The report provides a detailed analysis of the experiment results, including code completion and simulation images. To facilitate result analysis, all registers are displayed as 00H.
Starting with the first instruction, which was fetched from the instruction register, the report reveals that the instruction's opcode is 24010001h, and the instruction address is 00h. The assembly instruction for this opcode is addiu $1 ,$0. However, due to the incomplete code, the report does not provide the complete instruction set.
In addition to the specific experiment details, the report also includes the student's personal information, such as name, grade, major, and course. Yue Yuxuan is a student from the 2019 grade, majoring in Computer Science and Technology, and is taking the Computer Organization Principles course.
Overall, the report provides a thorough analysis of the experiment results, meeting the strict requirement of reaching 2000 words. It details the steps taken, the code completion process, and provides screenshots and simulation images for comprehensive understanding.
2022-08-03 上传
2022-08-08 上传
2022-08-03 上传
2022-08-03 上传
2022-08-08 上传
2022-08-03 上传
2022-08-03 上传
2022-08-03 上传
2022-08-03 上传
丛乐
- 粉丝: 38
- 资源: 312
最新资源
- 背包问题 贪心算法
- IBM DB2通用数据库SQL入门
- ARM指令集及汇编 学习ARM必不可少的
- Lecture Halls 假设要在足够多的会场里安排一批活动,并希望使用尽可能少的会场。设计一个有效的算法进行安排。(这个问题实际上是著名的图着色问题。若将每一个活动作为图的一个顶点,不相容活动间用边相连。使相邻顶点着有不同颜色的最小着色数,相应于要找的最小会场数。)
- ARM开发工程师入门宝典
- 交通灯系统硬件软件设计(有图有程序)
- MAX SUM 给定由n整数(可能为负数)组成的序列 {a1,a2,…,an},求该序列形如ai+ai+1,…,+aj的子段和的最大值。当所有的整数均为负数时定义其最大子段和为0。
- Number Triangles 给定一个由n行数字组成的数字三角形如下图所示。试设计一个算法,计算出从三角形的顶至底的一条路径,使该路径经过的数字总和最大。
- st5dfsfdsdfsdfsfds
- 最长公共子序列 一个给定序列的子序列是在该序列中删去若干元素后得到的序列。给定两个序列X和Y,当另一序列Z既是X的子序列又是Y的子序列时,称Z是序列X和Y的公共子序列。例如,若X={A,B,C,B,D,B,A},Y={B,D,C,A,B,A},则序列{B,C,A}是X和Y的一个公共子序列,但它不是X和Y的一个最长公共子序列。序列{B,C,B,A}也是X和Y的一个公共子序列,它的长度为4,而且它是X和Y的一个最长公共子序列,因为X和Y没有长度大于4的公共子序列。 最长公共
- 《Keil Software –Cx51 编译器用户手册 中文完整版》(403页)
- Pebble Merging 在一个圆形操场的四周摆放着n 堆石子。现要将石子有次序地合并成一堆。规定每次只能选相邻的2 堆石子合并成新的一堆,并将新的一堆石子数记为该次合并的得分。试设计一个算法,计算出将n堆石子合并成一堆的最小得分和最大得分。
- 云计算:优势与挑战并存
- Minimal m Sums 给定n 个整数组成的序列,现在要求将序列分割为m 段,每段子序列中的数在原序列中连续排列。如何分割才能使这m段子序列的和的最大值达到最小?
- Lotus 公式秘籍---经验总结
- 数据结构C++二分搜索树