- 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
- 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
- 4、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
- 5、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们。
- 6、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
- 7、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
ECTE431-ECTE931 Real-Time Computing – Example Paper Solution 1
QUESTION 1 – [10 marks]
a) Define real-time systems. [4 marks]
Solution:
o A real-time system is a system with explicit timing
requirements.
o The system must respond to external inputs within a
specified period.
o Failure to meet the timing requirements is as bad as
producing the wrong outputs.
o An example of real-time systems: MPEG video and audio
encoder (30 frames/s)
b) Describe briefly three major scheduling approaches for
real-time systems. [6 marks]
Solution:
Clock-driven scheduling approach
o Scheduling decisions are made at specific time instants,
which are typically chosen a priori.
o Typically, a hardware timer is used to provided periodic
time instants, at which the scheduler wakes up and
selects the next jobs to execute.
o Suitable for systems that consist of mostly deterministic
and periodic tasks.
Weighted round-robin scheduling approach
o Jobs are given weights and are placed in a circular FIFO
queue.
o Processor’s time is divided into equal time slices.
o When it is job Ji’s turn, it will execute for wi time
slices before being pre-emptied for the next job in
queue.
o New jobs execute almost immediately. This approach is
suitable for incremental producer/consumer jobs.
Priority-driven scheduling approach
o At any scheduling decision time, among the eligible jobs,
the one with the highest priority is selected for
execution.
o This approach tries to make locally optimal decisions and
is also known as greedy scheduling.
o Examples are first-in-first-out, shortest-
文档评论(0)