The split data cache in multiprocessor systems: an initial hit ratio analysis

J. Sahuquillo, A. Pont
{"title":"The split data cache in multiprocessor systems: an initial hit ratio analysis","authors":"J. Sahuquillo, A. Pont","doi":"10.1109/EMPDP.1999.746641","DOIUrl":null,"url":null,"abstract":"As current first level (L1) data caches are poorly and inefficiently managed, new approaches to achieve better performance in uniprocessor systems have been proposed. The L1 data cache management system is basically the same as it was three decades ago. New organizations have recently been proposed, where two multi-lateral caches are included in the first level in accordance with the data locality where they are stored. The processor simultaneously sends the same memory request to both caches located in L1. These caches work independently and have different organizations. The main objective is to minimize the average data access time. These new organizations will normally increase the hit ratio. Additionally, the chip area occupied by these caches-including the necessary management hardware-is smaller than in a conventional organization. As the proposed cache size is smaller, it can work faster and improve access time at this level. Several authors have studied different approaches around this idea in uniprocessors. In this work we have made extensions for shared memory multiprocessors and studied the advantages.","PeriodicalId":335983,"journal":{"name":"Proceedings of the Seventh Euromicro Workshop on Parallel and Distributed Processing. PDP'99","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Seventh Euromicro Workshop on Parallel and Distributed Processing. PDP'99","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EMPDP.1999.746641","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

Abstract

As current first level (L1) data caches are poorly and inefficiently managed, new approaches to achieve better performance in uniprocessor systems have been proposed. The L1 data cache management system is basically the same as it was three decades ago. New organizations have recently been proposed, where two multi-lateral caches are included in the first level in accordance with the data locality where they are stored. The processor simultaneously sends the same memory request to both caches located in L1. These caches work independently and have different organizations. The main objective is to minimize the average data access time. These new organizations will normally increase the hit ratio. Additionally, the chip area occupied by these caches-including the necessary management hardware-is smaller than in a conventional organization. As the proposed cache size is smaller, it can work faster and improve access time at this level. Several authors have studied different approaches around this idea in uniprocessors. In this work we have made extensions for shared memory multiprocessors and studied the advantages.
多处理器系统中的分割数据缓存:初始命中率分析
由于当前的一级(L1)数据缓存管理不善且效率低下,因此提出了在单处理器系统中实现更好性能的新方法。L1数据缓存管理系统与30年前基本相同。最近提出了新的组织,其中根据存储数据的地点将两个多边缓存包括在第一级。处理器同时向L1中的两个缓存发送相同的内存请求。这些缓存独立工作,有不同的组织。主要目标是最小化平均数据访问时间。这些新组织通常会提高命中率。此外,这些缓存(包括必要的管理硬件)占用的芯片面积比传统组织要小。由于建议的缓存大小较小,因此它可以更快地工作并缩短此级别的访问时间。几位作者研究了在单处理器中围绕这个想法的不同方法。在这项工作中,我们对共享内存多处理器进行了扩展,并研究了其优点。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信