网站大量收购闲置独家精品文档,联系QQ:2885784924

Cellular Phones as Embedded Systems University of 蜂窝电话作为嵌入式系统大学.ppt

Cellular Phones as Embedded Systems University of 蜂窝电话作为嵌入式系统大学.ppt

  1. 1、本文档共20页,可阅读全部内容。
  2. 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
* of 23 * of 33 * of 33 Pipelines for Future Architectures in Time Critical Embedded Systems By: R.Wilhelm, D. Grund, J. Reineke, M. Schlickling, M. Pister, and C.Ferdinand EEL 6935 - Embedded Systems Dept. of Electrical and Computer Engineering University of Florida Liza Rodriguez Aurelio Morales Outline Pipelining Review Timing Analysis Anomalies Domino Effects Architecture Classifications Conclusions Outline Pipelining Review Timing Analysis Anomalies Domino Effects Architecture Classifications Conclusions Pipelining Review Pipelining is an implementation technique where multiple instructions are overlapped in execution Pipelining takes advantage of parallelism that exists among the actions needed to execute and instruction Pipelining is like an assembly line, each stage operates in parallel with the other stages Instructions enter at one end, progress through the stages, and exit at the other end Pipelining is the key implementation technique used to make fast CPUs Pipelined Example LD r4, 0(r3) Fetch Decode Execute Memory Write Back LD r4, 0(r3) 5 cycles (5) ADD r1, r7, r3 1 cycles (4) ADD r1, r7, r3 001100 r4 LOAD 0 + r3 read LD r4, 0(r3) ADD r1, r7, r3 101011 ADD r7 + r3 ADD r2, r6, r30 101011 ADD r6 + r3 ADD r2, r6, r30 ADD r2, r6, r30 1 cycles (4) XXX XXX r1 r2 Pipeline registers separate functional units to allow parallel operation Pipeline will stall if there is a hazard Further Optimizations Superscalar – executes more than one instruction per clock cycle by simultaneously dispatching multiple instructions to redundant functional units Branch Prediction – predict branches based on a predefined static algorithm or based on dynamic branch history Out of order execution – instructions are dynamically scheduled to avoid hazards and dependencies that may stall the pipeline Fetch Decode Execute Memory Write Back Fetch Decode Execute Memory Write Back Execute ADD r1, r2, r3 wait SUB r1, r2, r3 wait MUL r

文档评论(0)

zyzsaa + 关注
实名认证
内容提供者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档