完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.author | Hu, YC | en_US |
dc.contributor.author | Chiao, WH | en_US |
dc.contributor.author | Shann, JJJ | en_US |
dc.contributor.author | Chung, CP | en_US |
dc.contributor.author | Chen, WF | en_US |
dc.date.accessioned | 2014-12-08T15:25:28Z | - |
dc.date.available | 2014-12-08T15:25:28Z | - |
dc.date.issued | 2005 | en_US |
dc.identifier.isbn | 1-932415-54-8 | en_US |
dc.identifier.uri | http://hdl.handle.net/11536/17871 | - |
dc.description.abstract | Low-power design has gained much attention recently, especially for computing on battery-powered equipments. Reducing BTB (branch target buffer) accesses is an effective way to reduce processor power consumption, since BTB consumes a significant portion of power in a processor. In this paper, we propose two approaches to reduce BTB accesses. The first approach expects the distance of every two dynamic branch instructions to be a constant n, where n can be statically profiled, and forces BTB to repose for n instructions after a BTB hit. The second approach dynamically predicts the address of the next branch instruction, and accesses BTB only on the predicted address. Multimedia/DSP benchmarks are used in our evaluation. Experimental results show that these methods can potentially reduce 22-033% of all BTB accesses. | en_US |
dc.language.iso | en_US | en_US |
dc.subject | low-power | en_US |
dc.subject | branch prediction | en_US |
dc.subject | branch target buffer | en_US |
dc.title | Low-power branch prediction | en_US |
dc.type | Proceedings Paper | en_US |
dc.identifier.journal | CDES '05: Proceedings of the 2005 International Conference on Computer Design | en_US |
dc.citation.spage | 211 | en_US |
dc.citation.epage | 217 | en_US |
dc.contributor.department | 資訊工程學系 | zh_TW |
dc.contributor.department | Department of Computer Science | en_US |
dc.identifier.wosnumber | WOS:000236728000031 | - |
顯示於類別: | 會議論文 |