[理工] 一些考古題的問題

看板Grad-ProbAsk作者 (NullSpace)時間9年前 (2017/01/31 12:33), 編輯推噓3(3026)
留言29則, 4人參與, 最新討論串1/1
1.Every single instruction,when being executed in a n-stage pipelined datapath ,consistently needs n clock cycles before its execution is completely done. (104交大計系第8題) 這句是錯的 想問問錯在哪裡 如果說管線只放一個指令進去的話 不是要n個cycles才會做完嗎? 還是我理解錯 題目意思其實是說 在很多個指令中 一個指令平均需要一個cycle? (理想pipeline CPI = 1) 2.If the size of a block is 1024 bytes and a pointer require 32 bits,in a two- level index system,a file associated with a first-level index block can have a size of up to 256MB. (104交大計系第12題) 這句是錯的 想問正確答案應該是多少呢? 我的想法是: 一個block可以裝 1024/4 = 256 個pointers 所以first-level block中的每個pointer再指出去 每個pointer指一個block 所以total size = 256*1024 = 256 "KB" 若有錯請指正 3.Trying to allow some instructions to take fewer cycles does not help,since the throughput is determined by the clock cycle;the number of pipeline stages per instruction affects latency,not throughput. (104交大計系第17題) 這句是對的 但我其實選起來怕怕的... 我的想法是 首先第一句(Trying to......;) 把一個指令拆成多個stages後 每個stage的時間越短 整體的throughput就越好 第二句(the number......) 嗯...第二句不太懂 請各位救我 4.An I/O-bound process spends more time doing I/O than computations and consists of a few long CPU bursts. (105交大計系第3題) 請問這句為什麼錯呢? 有什麼反例嗎 5.It is possible to "eliminate" the occurrence of conflict misses by further increaing associativity. (105交大計系第14題) 這句是對的 我的理解是 關聯度一直上升 到最後就變成fully-associative了 自然不會有conflict misses 不知道我的想法有沒有錯? 6.GPUs rely on graphics DRAM chips to reduce memory latency and thereby increase performance on graphics applications. (103清大計系第15題) 這句是錯的 請問錯在哪 我好像也沒讀到這東西...QAQ 7.再來是我心中一直不解的疑問 在寫pipeline題目的時候 有時候遇到WB都很猶豫要不要再多stall一個cycle 因為課本說 WB可以前半周期寫後半周期讀 那到底要不要在WB stage的時候stall呢? 感謝大家 -- ※ 發信站: 批踢踢實業坊(ptt.cc), 來自: 36.233.82.115 ※ 文章網址: https://www.ptt.cc/bbs/Grad-ProbAsk/M.1485837222.A.0AA.html

01/31 12:42, , 1F
以下皆為不負責任的想法:
01/31 12:42, 1F

01/31 12:42, , 2F
1.如果遇到stall就會需要大於n個clock cycles了
01/31 12:42, 2F

01/31 12:46, , 3F
2.256*256*1KB=64MB
01/31 12:46, 3F

01/31 12:46, , 4F
3.我觀念不清楚不亂講
01/31 12:46, 4F

01/31 12:47, , 5F
4.最後應該是consists of a few "short" CPU bursts?
01/31 12:47, 5F

01/31 12:47, , 6F
5.我想法跟你一樣
01/31 12:47, 6F

01/31 12:49, , 7F
6.GPU relys on having enough threads to hide the
01/31 12:49, 7F

01/31 12:49, , 8F
latency to memory
01/31 12:49, 8F

01/31 12:49, , 9F
GPU rely on extensive paralleism to obtain high
01/31 12:49, 9F

01/31 12:50, , 10F
performance, implementing many parallel processors
01/31 12:50, 10F

01/31 12:50, , 11F
and many concurrent threads
01/31 12:50, 11F

01/31 12:52, , 12F
7.感覺不用?做的題目不夠多不敢確定
01/31 12:52, 12F

01/31 13:16, , 13F
第二題我跟你寫的一樣,y大那樣不是是算到two level嗎
01/31 13:16, 13F

01/31 13:16, , 14F
,題目是求第一層
01/31 13:16, 14F

01/31 13:35, , 15F
其實我也覺得我對題目的理解怪怪的,因為他說in a
01/31 13:35, 15F

01/31 13:36, , 16F
two-level index system,那first-level指出去的應該是
01/31 13:36, 16F

01/31 13:36, , 17F
second-level index block?
01/31 13:36, 17F

01/31 13:37, , 18F
那把所有second-level index block再指出去的收集起來
01/31 13:37, 18F

01/31 13:37, , 19F
就會像我算的那樣,還是說這題單純就是求one-level而已
01/31 13:37, 19F

01/31 13:37, , 20F
?雖然怎麼算這題都會是false,但我也想了解一下
01/31 13:37, 20F

01/31 13:39, , 21F
我一開始還想說first-level指出去沒有指到data block,
01/31 13:39, 21F

01/31 13:39, , 22F
所以是0,可是這樣更奇怪了
01/31 13:39, 22F

01/31 13:48, , 23F
突然發現我的算法好像是以inode架構為前提= ="
01/31 13:48, 23F

01/31 13:49, , 24F
但題目說的two-level好像不能這樣算
01/31 13:49, 24F

01/31 14:08, , 25F
7 是"register file" 可以前半週期寫 後半週期讀 不是"wb
01/31 14:08, 25F

01/31 14:08, , 26F
"
01/31 14:08, 26F

01/31 14:13, , 27F
第三題看不懂你的想法 題目的意思是說允許某些指令可以執
01/31 14:13, 27F

01/31 14:13, , 28F
行較少cycle(比方說R type要5 cycle 但其實不用mem 所以
01/31 14:13, 28F

01/31 14:13, , 29F
變成4 cycle 我猜他是這個意思) 感覺跟你講的無關
01/31 14:13, 29F
文章代碼(AID): #1Oa1Ec2g (Grad-ProbAsk)