- 1、本文档共28页,可阅读全部内容。
- 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
- 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
I/O Caching and Page Replacement Memory/Storage Hierarchy 101 I/O Caching 101 Rationale for I/O Cache Structure Goal: maintain K slots in memory as a cache over a collection of m items on secondary storage (K m). 1. What happens on the first access to each item? Fetch it into some slot of the cache, use it, and leave it there to speed up access if it is needed again later. 2. How to determine if an item is resident in the cache? Maintain a directory of items in the cache: a hash table. Hash on a unique identifier (tag) for the item (fully associative). 3. How to find a slot for an item fetched into the cache? Choose an unused slot, or select an item to replace according to some policy, and evict it from the cache, freeing its slot. Mechanism for Cache Eviction/Replacement Typical approach: maintain an ordered free/inactive list of slots that are candidates for reuse. Busy items in active use are not on the list. E.g., some in-memory data structure holds a pointer to the item. E.g., an I/O operation is in progress on the item. The best candidates are slots that do not contain valid items. Initially all slots are free, and they may become free again as items are destroyed (e.g., as files are removed). Other slots are listed in order of value of the items they contain. These slots contain items that are valid but inactive: they are held in memory only in the hope that they will be accessed again later. Replacement Policy The effectiveness of a cache is determined largely by the policy for ordering slots/items on the free/inactive list. defines the replacement policy A typical cache replacement policy is Least Recently Used. Assume hot items used recently are likely to be used again. Move the item to the tail of the free list on every release. The item at the front of the list is the coldest inactive item. Other alternatives: FIFO: replace the oldest item. MRU/LIFO: replace the most recently used item. Example: File Block Buffer Cache Why Are File Caches Effective?
您可能关注的文档
- Case Study 8 University of Pittsburgh案例研究8匹兹堡大学.ppt
- Case study 1 All Saints Catholic Technology School 案例研究1所有圣徒天主教技术学校.ppt
- Case study Kohler Co科勒公司案例研究. California State University .ppt
- Case Study Delirium in an Adolescent Girl With Human 在一个有人的青春期女孩的案例研究.ppt
- Case Study 31 Chronic Renal Failure Santa Monica 案例31慢性肾功能衰竭圣塔莫尼卡.ppt
- CASE STUDY RESEARCH web案例研究网络.viu.ppt
- Case Study Blended learning through interuniversity混合式学习通过校际案例研究.ppt
- Case Study 63 Cancer of the Female Breast女性乳腺癌63例病例研究.ppt
- Case Study The Grameen Bank Harvard University案例研究格莱珉银行哈佛大学.ppt
- Case Study – Omaxe Real Estate Omaxe TG was Non 案例研究–omaxe房地产omaxe TG是非.ppt
- CheckFence Checking Consistency of Concurrent Data Types oncheckfence检查并发数据类型的一致性.ppt
- CHECKING THE CONSISTENCY OF POVERTY IN POLAND 1997 2003检查波兰贫困的一致性2003 1997.ppt
- Checks and Balances WordPress制衡WordPress.ppt
- Cheer for our colors Gold Black and white We are the 为我们的颜色加油我们是黑色和白色.ppt
- Chekhov Wikispaces契诃夫 wiki空间.ppt
- Chemical Agents South Bay Disater Resource Center化学试剂南湾灾害资源中心.ppt
- Chemical Bonds Karen Timberlake化学键凯伦.ppt
- CHEMICAL CARCINOGENS Providence VA Medical 化学致癌物质上帝的医疗.ppt
- Chemical Education Chemistry化学教育化学.ppt
- Chemical Dependency Start Here化学依赖从这里开始. Get There..ppt
文档评论(0)